java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:56:17,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:56:17,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:56:17,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:56:17,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:56:17,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:56:17,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:56:17,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:56:17,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:56:17,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:56:17,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:56:17,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:56:17,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:56:17,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:56:17,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:56:17,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:56:17,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:56:17,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:56:17,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:56:17,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:56:17,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:56:17,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:56:17,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:56:17,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:56:17,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:56:17,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:56:17,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:56:17,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:56:17,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:56:17,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:56:17,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:56:17,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:56:17,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:56:17,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:56:17,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:56:17,594 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:56:17,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:56:17,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:56:17,607 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:56:17,608 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:56:17,608 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:56:17,609 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:56:17,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:56:17,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:56:17,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:56:17,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:56:17,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:56:17,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:56:17,612 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:56:17,613 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:56:17,613 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:56:17,613 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:56:17,613 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:56:17,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:56:17,614 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:56:17,615 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:56:17,615 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:56:17,674 INFO ]: Repository-Root is: /tmp [2018-06-22 11:56:17,690 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:56:17,697 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:56:17,698 INFO ]: Initializing SmtParser... [2018-06-22 11:56:17,699 INFO ]: SmtParser initialized [2018-06-22 11:56:17,699 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-22 11:56:17,701 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:56:17,791 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3c6ab0c4 [2018-06-22 11:56:18,101 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-22 11:56:18,106 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:56:18,114 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:56:18,114 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:56:18,114 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:56:18,115 INFO ]: ChcToBoogie initialized [2018-06-22 11:56:18,120 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,166 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18 Unit [2018-06-22 11:56:18,166 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:56:18,167 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:56:18,167 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:56:18,167 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:56:18,189 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,189 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,197 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,197 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,209 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,211 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,212 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... [2018-06-22 11:56:18,213 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:56:18,219 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:56:18,219 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:56:18,219 INFO ]: RCFGBuilder initialized [2018-06-22 11:56:18,220 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:56:18,233 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:56:18,233 INFO ]: Found specification of procedure False [2018-06-22 11:56:18,233 INFO ]: Found implementation of procedure False [2018-06-22 11:56:18,233 INFO ]: Specification and implementation of procedure INV_MAIN_3 given in one single declaration [2018-06-22 11:56:18,233 INFO ]: Found specification of procedure INV_MAIN_3 [2018-06-22 11:56:18,233 INFO ]: Found implementation of procedure INV_MAIN_3 [2018-06-22 11:56:18,233 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 11:56:18,233 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 11:56:18,233 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 11:56:18,233 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:56:18,233 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:56:18,233 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:56:18,233 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:56:18,233 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:56:18,233 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:56:18,597 INFO ]: Using library mode [2018-06-22 11:56:18,598 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:56:18 BoogieIcfgContainer [2018-06-22 11:56:18,598 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:56:18,599 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:56:18,600 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:56:18,602 INFO ]: TraceAbstraction initialized [2018-06-22 11:56:18,603 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:56:18" (1/3) ... [2018-06-22 11:56:18,603 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102d0fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:56:18, skipping insertion in model container [2018-06-22 11:56:18,603 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:18" (2/3) ... [2018-06-22 11:56:18,604 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102d0fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:56:18, skipping insertion in model container [2018-06-22 11:56:18,604 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:56:18" (3/3) ... [2018-06-22 11:56:18,606 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:56:18,614 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:56:18,622 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:56:18,663 INFO ]: Using default assertion order modulation [2018-06-22 11:56:18,663 INFO ]: Interprodecural is true [2018-06-22 11:56:18,664 INFO ]: Hoare is false [2018-06-22 11:56:18,664 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:56:18,664 INFO ]: Backedges is TWOTRACK [2018-06-22 11:56:18,664 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:56:18,664 INFO ]: Difference is false [2018-06-22 11:56:18,664 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:56:18,664 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:56:18,677 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 11:56:18,690 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:56:18,690 INFO ]: Found error trace [2018-06-22 11:56:18,691 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:18,691 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:18,696 INFO ]: Analyzing trace with hash -1033112072, now seen corresponding path program 1 times [2018-06-22 11:56:18,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:18,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:18,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:18,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:18,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:18,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:18,910 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:56:18,912 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:18,912 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:18,915 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:18,930 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:18,931 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:18,933 INFO ]: Start difference. First operand 29 states. Second operand 6 states. [2018-06-22 11:56:19,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:19,471 INFO ]: Finished difference Result 33 states and 58 transitions. [2018-06-22 11:56:19,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:56:19,473 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:56:19,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:19,482 INFO ]: With dead ends: 33 [2018-06-22 11:56:19,482 INFO ]: Without dead ends: 33 [2018-06-22 11:56:19,484 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:19,497 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:56:19,525 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 11:56:19,526 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:56:19,528 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 58 transitions. [2018-06-22 11:56:19,529 INFO ]: Start accepts. Automaton has 33 states and 58 transitions. Word has length 17 [2018-06-22 11:56:19,530 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:19,530 INFO ]: Abstraction has 33 states and 58 transitions. [2018-06-22 11:56:19,530 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:19,530 INFO ]: Start isEmpty. Operand 33 states and 58 transitions. [2018-06-22 11:56:19,533 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:19,533 INFO ]: Found error trace [2018-06-22 11:56:19,533 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:19,533 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:19,534 INFO ]: Analyzing trace with hash -1071778403, now seen corresponding path program 1 times [2018-06-22 11:56:19,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:19,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:19,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:19,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:19,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:19,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:19,628 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:19,628 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:19,628 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:19,630 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:19,630 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:19,630 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:19,630 INFO ]: Start difference. First operand 33 states and 58 transitions. Second operand 6 states. [2018-06-22 11:56:20,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:20,088 INFO ]: Finished difference Result 47 states and 86 transitions. [2018-06-22 11:56:20,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:20,089 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:56:20,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:20,091 INFO ]: With dead ends: 47 [2018-06-22 11:56:20,091 INFO ]: Without dead ends: 47 [2018-06-22 11:56:20,092 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:20,092 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:56:20,103 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:56:20,103 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:56:20,104 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 77 transitions. [2018-06-22 11:56:20,105 INFO ]: Start accepts. Automaton has 43 states and 77 transitions. Word has length 21 [2018-06-22 11:56:20,105 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:20,105 INFO ]: Abstraction has 43 states and 77 transitions. [2018-06-22 11:56:20,105 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:20,105 INFO ]: Start isEmpty. Operand 43 states and 77 transitions. [2018-06-22 11:56:20,107 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:20,107 INFO ]: Found error trace [2018-06-22 11:56:20,107 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:20,107 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:20,107 INFO ]: Analyzing trace with hash 1172136903, now seen corresponding path program 1 times [2018-06-22 11:56:20,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:20,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:20,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:20,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:20,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:20,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:20,453 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:20,453 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:20,453 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:20,454 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:20,454 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:20,454 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:20,454 INFO ]: Start difference. First operand 43 states and 77 transitions. Second operand 6 states. [2018-06-22 11:56:20,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:20,778 INFO ]: Finished difference Result 61 states and 123 transitions. [2018-06-22 11:56:20,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:20,778 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:56:20,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:20,781 INFO ]: With dead ends: 61 [2018-06-22 11:56:20,781 INFO ]: Without dead ends: 61 [2018-06-22 11:56:20,781 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:20,782 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:56:20,809 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 11:56:20,809 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:56:20,811 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 106 transitions. [2018-06-22 11:56:20,811 INFO ]: Start accepts. Automaton has 55 states and 106 transitions. Word has length 21 [2018-06-22 11:56:20,812 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:20,812 INFO ]: Abstraction has 55 states and 106 transitions. [2018-06-22 11:56:20,812 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:20,812 INFO ]: Start isEmpty. Operand 55 states and 106 transitions. [2018-06-22 11:56:20,816 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:20,816 INFO ]: Found error trace [2018-06-22 11:56:20,816 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:20,816 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:20,816 INFO ]: Analyzing trace with hash 1024136061, now seen corresponding path program 1 times [2018-06-22 11:56:20,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:20,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:20,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:20,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:20,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:20,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:20,921 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:20,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:20,921 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:20,921 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:20,921 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:20,921 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:20,921 INFO ]: Start difference. First operand 55 states and 106 transitions. Second operand 6 states. [2018-06-22 11:56:21,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:21,136 INFO ]: Finished difference Result 63 states and 119 transitions. [2018-06-22 11:56:21,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:21,136 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:56:21,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:21,138 INFO ]: With dead ends: 63 [2018-06-22 11:56:21,138 INFO ]: Without dead ends: 63 [2018-06-22 11:56:21,138 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:21,139 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:56:21,152 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 11:56:21,152 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:56:21,153 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 99 transitions. [2018-06-22 11:56:21,154 INFO ]: Start accepts. Automaton has 53 states and 99 transitions. Word has length 21 [2018-06-22 11:56:21,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:21,155 INFO ]: Abstraction has 53 states and 99 transitions. [2018-06-22 11:56:21,155 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:21,155 INFO ]: Start isEmpty. Operand 53 states and 99 transitions. [2018-06-22 11:56:21,157 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:21,157 INFO ]: Found error trace [2018-06-22 11:56:21,157 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:21,157 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:21,157 INFO ]: Analyzing trace with hash -1049347166, now seen corresponding path program 1 times [2018-06-22 11:56:21,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:21,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:21,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:21,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:21,216 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:21,216 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:21,216 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:21,217 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:21,217 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:21,217 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:21,217 INFO ]: Start difference. First operand 53 states and 99 transitions. Second operand 6 states. [2018-06-22 11:56:21,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:21,360 INFO ]: Finished difference Result 73 states and 137 transitions. [2018-06-22 11:56:21,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:56:21,360 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:56:21,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:21,364 INFO ]: With dead ends: 73 [2018-06-22 11:56:21,364 INFO ]: Without dead ends: 69 [2018-06-22 11:56:21,364 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:21,365 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:56:21,380 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-06-22 11:56:21,380 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:56:21,381 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2018-06-22 11:56:21,381 INFO ]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 21 [2018-06-22 11:56:21,381 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:21,381 INFO ]: Abstraction has 61 states and 112 transitions. [2018-06-22 11:56:21,382 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:21,382 INFO ]: Start isEmpty. Operand 61 states and 112 transitions. [2018-06-22 11:56:21,389 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:21,389 INFO ]: Found error trace [2018-06-22 11:56:21,389 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:21,389 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:21,389 INFO ]: Analyzing trace with hash -427330019, now seen corresponding path program 1 times [2018-06-22 11:56:21,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:21,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:21,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:21,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:21,444 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:21,444 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:21,444 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:21,444 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:21,444 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:21,444 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:21,444 INFO ]: Start difference. First operand 61 states and 112 transitions. Second operand 7 states. [2018-06-22 11:56:21,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:21,703 INFO ]: Finished difference Result 73 states and 139 transitions. [2018-06-22 11:56:21,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:21,705 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:56:21,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:21,706 INFO ]: With dead ends: 73 [2018-06-22 11:56:21,707 INFO ]: Without dead ends: 71 [2018-06-22 11:56:21,707 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:21,707 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:56:21,719 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-06-22 11:56:21,719 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:56:21,720 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2018-06-22 11:56:21,720 INFO ]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 21 [2018-06-22 11:56:21,721 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:21,721 INFO ]: Abstraction has 65 states and 123 transitions. [2018-06-22 11:56:21,721 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:21,721 INFO ]: Start isEmpty. Operand 65 states and 123 transitions. [2018-06-22 11:56:21,722 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:21,722 INFO ]: Found error trace [2018-06-22 11:56:21,722 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:21,722 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:21,722 INFO ]: Analyzing trace with hash 1371128378, now seen corresponding path program 1 times [2018-06-22 11:56:21,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:21,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:21,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:21,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:21,782 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:21,783 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:21,783 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:21,783 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:21,783 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:21,783 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:21,783 INFO ]: Start difference. First operand 65 states and 123 transitions. Second operand 7 states. [2018-06-22 11:56:21,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:21,966 INFO ]: Finished difference Result 77 states and 146 transitions. [2018-06-22 11:56:21,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:21,966 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:56:21,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:21,967 INFO ]: With dead ends: 77 [2018-06-22 11:56:21,967 INFO ]: Without dead ends: 75 [2018-06-22 11:56:21,967 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:21,968 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:56:21,978 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-06-22 11:56:21,978 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:56:21,980 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 129 transitions. [2018-06-22 11:56:21,980 INFO ]: Start accepts. Automaton has 67 states and 129 transitions. Word has length 21 [2018-06-22 11:56:21,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:21,980 INFO ]: Abstraction has 67 states and 129 transitions. [2018-06-22 11:56:21,980 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:21,980 INFO ]: Start isEmpty. Operand 67 states and 129 transitions. [2018-06-22 11:56:21,981 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:21,981 INFO ]: Found error trace [2018-06-22 11:56:21,981 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:21,982 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:21,982 INFO ]: Analyzing trace with hash -1214671166, now seen corresponding path program 1 times [2018-06-22 11:56:21,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:21,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:21,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:21,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:21,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:22,042 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:22,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:22,043 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:22,043 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:22,043 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:22,043 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:22,043 INFO ]: Start difference. First operand 67 states and 129 transitions. Second operand 7 states. [2018-06-22 11:56:22,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:22,219 INFO ]: Finished difference Result 77 states and 146 transitions. [2018-06-22 11:56:22,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:22,219 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:56:22,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:22,220 INFO ]: With dead ends: 77 [2018-06-22 11:56:22,220 INFO ]: Without dead ends: 75 [2018-06-22 11:56:22,221 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:22,221 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:56:22,230 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-06-22 11:56:22,230 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:56:22,231 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 125 transitions. [2018-06-22 11:56:22,231 INFO ]: Start accepts. Automaton has 65 states and 125 transitions. Word has length 21 [2018-06-22 11:56:22,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:22,232 INFO ]: Abstraction has 65 states and 125 transitions. [2018-06-22 11:56:22,232 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:22,232 INFO ]: Start isEmpty. Operand 65 states and 125 transitions. [2018-06-22 11:56:22,233 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:22,233 INFO ]: Found error trace [2018-06-22 11:56:22,233 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:22,233 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:22,233 INFO ]: Analyzing trace with hash -724864510, now seen corresponding path program 1 times [2018-06-22 11:56:22,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:22,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:22,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:22,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:22,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:22,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:22,360 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:22,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:22,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:22,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:22,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:22,413 INFO ]: Computing forward predicates... [2018-06-22 11:56:22,977 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:23,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:23,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-22 11:56:23,002 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:56:23,002 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:56:23,002 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:23,002 INFO ]: Start difference. First operand 65 states and 125 transitions. Second operand 16 states. [2018-06-22 11:56:23,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:23,400 INFO ]: Finished difference Result 79 states and 146 transitions. [2018-06-22 11:56:23,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:23,401 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:56:23,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:23,402 INFO ]: With dead ends: 79 [2018-06-22 11:56:23,402 INFO ]: Without dead ends: 79 [2018-06-22 11:56:23,402 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:56:23,403 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:56:23,414 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 69. [2018-06-22 11:56:23,414 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:56:23,415 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 130 transitions. [2018-06-22 11:56:23,415 INFO ]: Start accepts. Automaton has 69 states and 130 transitions. Word has length 21 [2018-06-22 11:56:23,415 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:23,415 INFO ]: Abstraction has 69 states and 130 transitions. [2018-06-22 11:56:23,416 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:56:23,416 INFO ]: Start isEmpty. Operand 69 states and 130 transitions. [2018-06-22 11:56:23,417 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:23,417 INFO ]: Found error trace [2018-06-22 11:56:23,417 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:23,417 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:23,418 INFO ]: Analyzing trace with hash 1262303271, now seen corresponding path program 1 times [2018-06-22 11:56:23,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:23,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:23,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:23,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:23,523 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:23,523 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:23,523 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:23,523 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:23,523 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:23,523 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:23,524 INFO ]: Start difference. First operand 69 states and 130 transitions. Second operand 8 states. [2018-06-22 11:56:23,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:23,677 INFO ]: Finished difference Result 83 states and 162 transitions. [2018-06-22 11:56:23,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:23,677 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:23,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:23,678 INFO ]: With dead ends: 83 [2018-06-22 11:56:23,678 INFO ]: Without dead ends: 81 [2018-06-22 11:56:23,678 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:23,678 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:56:23,688 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 69. [2018-06-22 11:56:23,688 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:56:23,689 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 130 transitions. [2018-06-22 11:56:23,689 INFO ]: Start accepts. Automaton has 69 states and 130 transitions. Word has length 25 [2018-06-22 11:56:23,689 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:23,689 INFO ]: Abstraction has 69 states and 130 transitions. [2018-06-22 11:56:23,689 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:23,689 INFO ]: Start isEmpty. Operand 69 states and 130 transitions. [2018-06-22 11:56:23,690 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:23,690 INFO ]: Found error trace [2018-06-22 11:56:23,690 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:23,691 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:23,691 INFO ]: Analyzing trace with hash -2087090785, now seen corresponding path program 1 times [2018-06-22 11:56:23,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:23,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:23,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:23,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:23,781 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:23,781 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:23,781 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:23,781 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:23,781 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:23,781 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:23,782 INFO ]: Start difference. First operand 69 states and 130 transitions. Second operand 8 states. [2018-06-22 11:56:23,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:23,961 INFO ]: Finished difference Result 91 states and 185 transitions. [2018-06-22 11:56:23,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:23,968 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:23,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:23,969 INFO ]: With dead ends: 91 [2018-06-22 11:56:23,969 INFO ]: Without dead ends: 89 [2018-06-22 11:56:23,970 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:23,970 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:56:23,979 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 71. [2018-06-22 11:56:23,979 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:56:23,980 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 136 transitions. [2018-06-22 11:56:23,980 INFO ]: Start accepts. Automaton has 71 states and 136 transitions. Word has length 25 [2018-06-22 11:56:23,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:23,980 INFO ]: Abstraction has 71 states and 136 transitions. [2018-06-22 11:56:23,980 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:23,980 INFO ]: Start isEmpty. Operand 71 states and 136 transitions. [2018-06-22 11:56:23,982 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:23,982 INFO ]: Found error trace [2018-06-22 11:56:23,982 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:23,982 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:23,982 INFO ]: Analyzing trace with hash 305453791, now seen corresponding path program 1 times [2018-06-22 11:56:23,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:23,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:23,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:23,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:24,159 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:24,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:24,160 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:24,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:24,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:24,185 INFO ]: Computing forward predicates... [2018-06-22 11:56:24,205 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:24,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:24,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:56:24,236 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:56:24,236 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:56:24,236 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:24,236 INFO ]: Start difference. First operand 71 states and 136 transitions. Second operand 9 states. [2018-06-22 11:56:24,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:24,334 INFO ]: Finished difference Result 81 states and 152 transitions. [2018-06-22 11:56:24,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:24,335 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:56:24,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:24,336 INFO ]: With dead ends: 81 [2018-06-22 11:56:24,336 INFO ]: Without dead ends: 79 [2018-06-22 11:56:24,336 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:24,336 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:56:24,343 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-06-22 11:56:24,344 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:56:24,349 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 143 transitions. [2018-06-22 11:56:24,349 INFO ]: Start accepts. Automaton has 75 states and 143 transitions. Word has length 25 [2018-06-22 11:56:24,349 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:24,349 INFO ]: Abstraction has 75 states and 143 transitions. [2018-06-22 11:56:24,349 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:56:24,349 INFO ]: Start isEmpty. Operand 75 states and 143 transitions. [2018-06-22 11:56:24,351 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:24,351 INFO ]: Found error trace [2018-06-22 11:56:24,351 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:24,351 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:24,351 INFO ]: Analyzing trace with hash -17306265, now seen corresponding path program 1 times [2018-06-22 11:56:24,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:24,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:24,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:24,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:24,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:24,375 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:24,427 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:56:24,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:24,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:24,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:24,449 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:24,451 INFO ]: Computing forward predicates... [2018-06-22 11:56:24,510 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:24,530 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:24,530 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-06-22 11:56:24,530 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:24,531 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:24,531 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:24,531 INFO ]: Start difference. First operand 75 states and 143 transitions. Second operand 12 states. [2018-06-22 11:56:25,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:25,460 INFO ]: Finished difference Result 111 states and 221 transitions. [2018-06-22 11:56:25,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:56:25,464 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 11:56:25,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:25,465 INFO ]: With dead ends: 111 [2018-06-22 11:56:25,465 INFO ]: Without dead ends: 109 [2018-06-22 11:56:25,465 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:25,465 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:56:25,474 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 73. [2018-06-22 11:56:25,475 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:56:25,476 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 136 transitions. [2018-06-22 11:56:25,476 INFO ]: Start accepts. Automaton has 73 states and 136 transitions. Word has length 25 [2018-06-22 11:56:25,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:25,476 INFO ]: Abstraction has 73 states and 136 transitions. [2018-06-22 11:56:25,476 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:25,476 INFO ]: Start isEmpty. Operand 73 states and 136 transitions. [2018-06-22 11:56:25,478 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:25,478 INFO ]: Found error trace [2018-06-22 11:56:25,478 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:25,478 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:25,478 INFO ]: Analyzing trace with hash -1290997500, now seen corresponding path program 1 times [2018-06-22 11:56:25,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:25,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:25,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:25,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:25,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:25,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:25,559 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:25,559 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:25,559 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:25,559 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:25,559 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:25,559 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:25,560 INFO ]: Start difference. First operand 73 states and 136 transitions. Second operand 8 states. [2018-06-22 11:56:25,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:25,690 INFO ]: Finished difference Result 99 states and 202 transitions. [2018-06-22 11:56:25,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:25,690 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:25,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:25,691 INFO ]: With dead ends: 99 [2018-06-22 11:56:25,691 INFO ]: Without dead ends: 97 [2018-06-22 11:56:25,692 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:25,692 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:56:25,700 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-06-22 11:56:25,700 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:56:25,701 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 148 transitions. [2018-06-22 11:56:25,701 INFO ]: Start accepts. Automaton has 77 states and 148 transitions. Word has length 25 [2018-06-22 11:56:25,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:25,702 INFO ]: Abstraction has 77 states and 148 transitions. [2018-06-22 11:56:25,702 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:25,702 INFO ]: Start isEmpty. Operand 77 states and 148 transitions. [2018-06-22 11:56:25,703 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:25,703 INFO ]: Found error trace [2018-06-22 11:56:25,703 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:25,703 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:25,703 INFO ]: Analyzing trace with hash 1724360260, now seen corresponding path program 1 times [2018-06-22 11:56:25,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:25,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:25,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:25,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:25,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:25,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:25,800 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:56:25,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:25,800 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:25,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:25,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:25,833 INFO ]: Computing forward predicates... [2018-06-22 11:56:25,987 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:26,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:26,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-06-22 11:56:26,006 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:26,007 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:26,007 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:26,007 INFO ]: Start difference. First operand 77 states and 148 transitions. Second operand 12 states. [2018-06-22 11:56:26,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:26,463 INFO ]: Finished difference Result 103 states and 199 transitions. [2018-06-22 11:56:26,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:56:26,464 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 11:56:26,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:26,465 INFO ]: With dead ends: 103 [2018-06-22 11:56:26,465 INFO ]: Without dead ends: 101 [2018-06-22 11:56:26,465 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:26,466 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 11:56:26,472 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 65. [2018-06-22 11:56:26,472 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:56:26,473 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 116 transitions. [2018-06-22 11:56:26,473 INFO ]: Start accepts. Automaton has 65 states and 116 transitions. Word has length 25 [2018-06-22 11:56:26,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:26,474 INFO ]: Abstraction has 65 states and 116 transitions. [2018-06-22 11:56:26,474 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:26,474 INFO ]: Start isEmpty. Operand 65 states and 116 transitions. [2018-06-22 11:56:26,475 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:26,475 INFO ]: Found error trace [2018-06-22 11:56:26,475 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:26,475 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:26,475 INFO ]: Analyzing trace with hash -737904436, now seen corresponding path program 1 times [2018-06-22 11:56:26,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:26,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:26,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:26,542 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:26,542 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:26,542 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:26,542 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:26,542 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:26,542 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:26,543 INFO ]: Start difference. First operand 65 states and 116 transitions. Second operand 4 states. [2018-06-22 11:56:26,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:26,570 INFO ]: Finished difference Result 65 states and 117 transitions. [2018-06-22 11:56:26,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:56:26,571 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:56:26,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:26,571 INFO ]: With dead ends: 65 [2018-06-22 11:56:26,571 INFO ]: Without dead ends: 65 [2018-06-22 11:56:26,571 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:26,571 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:56:26,576 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-06-22 11:56:26,576 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:56:26,576 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 112 transitions. [2018-06-22 11:56:26,576 INFO ]: Start accepts. Automaton has 63 states and 112 transitions. Word has length 25 [2018-06-22 11:56:26,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:26,577 INFO ]: Abstraction has 63 states and 112 transitions. [2018-06-22 11:56:26,577 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:26,577 INFO ]: Start isEmpty. Operand 63 states and 112 transitions. [2018-06-22 11:56:26,578 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:26,578 INFO ]: Found error trace [2018-06-22 11:56:26,578 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:26,578 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:26,578 INFO ]: Analyzing trace with hash 1200529452, now seen corresponding path program 1 times [2018-06-22 11:56:26,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:26,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:26,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:26,645 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:26,645 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:26,645 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:26,645 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:26,646 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:26,646 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:26,646 INFO ]: Start difference. First operand 63 states and 112 transitions. Second operand 8 states. [2018-06-22 11:56:26,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:26,886 INFO ]: Finished difference Result 95 states and 183 transitions. [2018-06-22 11:56:26,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:56:26,886 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:26,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:26,887 INFO ]: With dead ends: 95 [2018-06-22 11:56:26,887 INFO ]: Without dead ends: 86 [2018-06-22 11:56:26,888 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:26,888 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:56:26,896 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-06-22 11:56:26,896 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:56:26,897 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 131 transitions. [2018-06-22 11:56:26,897 INFO ]: Start accepts. Automaton has 74 states and 131 transitions. Word has length 25 [2018-06-22 11:56:26,897 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:26,897 INFO ]: Abstraction has 74 states and 131 transitions. [2018-06-22 11:56:26,897 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:26,897 INFO ]: Start isEmpty. Operand 74 states and 131 transitions. [2018-06-22 11:56:26,899 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:26,899 INFO ]: Found error trace [2018-06-22 11:56:26,899 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:26,899 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:26,899 INFO ]: Analyzing trace with hash 1814856716, now seen corresponding path program 2 times [2018-06-22 11:56:26,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:26,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:26,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:27,615 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:27,615 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:27,615 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 11:56:27,627 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:27,669 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:27,669 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:27,671 INFO ]: Computing forward predicates... [2018-06-22 11:56:27,947 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:27,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:27,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-06-22 11:56:27,966 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:56:27,966 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:56:27,966 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:27,966 INFO ]: Start difference. First operand 74 states and 131 transitions. Second operand 14 states. [2018-06-22 11:56:28,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:28,332 INFO ]: Finished difference Result 100 states and 186 transitions. [2018-06-22 11:56:28,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:56:28,333 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:56:28,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:28,333 INFO ]: With dead ends: 100 [2018-06-22 11:56:28,333 INFO ]: Without dead ends: 81 [2018-06-22 11:56:28,334 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:56:28,334 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:56:28,341 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-06-22 11:56:28,341 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:56:28,342 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 139 transitions. [2018-06-22 11:56:28,342 INFO ]: Start accepts. Automaton has 75 states and 139 transitions. Word has length 25 [2018-06-22 11:56:28,342 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:28,342 INFO ]: Abstraction has 75 states and 139 transitions. [2018-06-22 11:56:28,342 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:56:28,342 INFO ]: Start isEmpty. Operand 75 states and 139 transitions. [2018-06-22 11:56:28,343 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:28,343 INFO ]: Found error trace [2018-06-22 11:56:28,344 INFO ]: 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] [2018-06-22 11:56:28,344 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:28,344 INFO ]: Analyzing trace with hash 138976750, now seen corresponding path program 1 times [2018-06-22 11:56:28,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:28,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:28,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:28,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,383 INFO ]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:28,383 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:28,383 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:28,383 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:28,383 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:28,383 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:28,383 INFO ]: Start difference. First operand 75 states and 139 transitions. Second operand 4 states. [2018-06-22 11:56:28,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:28,412 INFO ]: Finished difference Result 63 states and 110 transitions. [2018-06-22 11:56:28,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:56:28,413 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 11:56:28,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:28,414 INFO ]: With dead ends: 63 [2018-06-22 11:56:28,414 INFO ]: Without dead ends: 63 [2018-06-22 11:56:28,414 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:28,414 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:56:28,418 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-06-22 11:56:28,418 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:56:28,419 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2018-06-22 11:56:28,419 INFO ]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 29 [2018-06-22 11:56:28,419 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:28,419 INFO ]: Abstraction has 63 states and 110 transitions. [2018-06-22 11:56:28,419 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:28,419 INFO ]: Start isEmpty. Operand 63 states and 110 transitions. [2018-06-22 11:56:28,420 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:28,420 INFO ]: Found error trace [2018-06-22 11:56:28,420 INFO ]: 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] [2018-06-22 11:56:28,420 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:28,420 INFO ]: Analyzing trace with hash -450926271, now seen corresponding path program 1 times [2018-06-22 11:56:28,420 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:28,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:28,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:28,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,512 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:28,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:28,512 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:28,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:28,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,555 INFO ]: Computing forward predicates... [2018-06-22 11:56:28,591 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:28,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:28,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:56:28,610 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:56:28,610 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:56:28,610 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:28,610 INFO ]: Start difference. First operand 63 states and 110 transitions. Second operand 10 states. [2018-06-22 11:56:28,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:28,769 INFO ]: Finished difference Result 81 states and 139 transitions. [2018-06-22 11:56:28,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:56:28,770 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 11:56:28,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:28,771 INFO ]: With dead ends: 81 [2018-06-22 11:56:28,771 INFO ]: Without dead ends: 79 [2018-06-22 11:56:28,771 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:56:28,771 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:56:28,776 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-06-22 11:56:28,776 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:56:28,777 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 128 transitions. [2018-06-22 11:56:28,777 INFO ]: Start accepts. Automaton has 73 states and 128 transitions. Word has length 29 [2018-06-22 11:56:28,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:28,777 INFO ]: Abstraction has 73 states and 128 transitions. [2018-06-22 11:56:28,777 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:56:28,777 INFO ]: Start isEmpty. Operand 73 states and 128 transitions. [2018-06-22 11:56:28,778 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:28,778 INFO ]: Found error trace [2018-06-22 11:56:28,778 INFO ]: 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] [2018-06-22 11:56:28,778 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:28,778 INFO ]: Analyzing trace with hash -1156738165, now seen corresponding path program 1 times [2018-06-22 11:56:28,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:28,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:28,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:28,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,868 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:28,869 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:28,869 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:28,875 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:28,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,912 INFO ]: Computing forward predicates... [2018-06-22 11:56:28,998 INFO ]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:29,018 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:29,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:56:29,019 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:56:29,019 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:56:29,019 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:29,019 INFO ]: Start difference. First operand 73 states and 128 transitions. Second operand 11 states. [2018-06-22 11:56:29,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:29,147 INFO ]: Finished difference Result 81 states and 135 transitions. [2018-06-22 11:56:29,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:56:29,147 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:56:29,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:29,148 INFO ]: With dead ends: 81 [2018-06-22 11:56:29,148 INFO ]: Without dead ends: 79 [2018-06-22 11:56:29,149 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:56:29,149 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:56:29,153 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-06-22 11:56:29,153 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:56:29,154 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2018-06-22 11:56:29,154 INFO ]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 29 [2018-06-22 11:56:29,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:29,154 INFO ]: Abstraction has 73 states and 121 transitions. [2018-06-22 11:56:29,154 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:56:29,154 INFO ]: Start isEmpty. Operand 73 states and 121 transitions. [2018-06-22 11:56:29,155 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:29,155 INFO ]: Found error trace [2018-06-22 11:56:29,155 INFO ]: trace histogram [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, 1, 1, 1, 1] [2018-06-22 11:56:29,155 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:29,155 INFO ]: Analyzing trace with hash 983234379, now seen corresponding path program 1 times [2018-06-22 11:56:29,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:29,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:29,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:29,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:29,526 INFO ]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:29,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:29,526 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:29,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:29,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:29,556 INFO ]: Computing forward predicates... [2018-06-22 11:56:29,883 INFO ]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:29,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:29,902 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-22 11:56:29,902 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:56:29,902 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:56:29,903 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:56:29,903 INFO ]: Start difference. First operand 73 states and 121 transitions. Second operand 25 states. [2018-06-22 11:56:30,480 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 11:56:31,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:31,322 INFO ]: Finished difference Result 111 states and 181 transitions. [2018-06-22 11:56:31,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:56:31,323 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:56:31,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:31,325 INFO ]: With dead ends: 111 [2018-06-22 11:56:31,325 INFO ]: Without dead ends: 107 [2018-06-22 11:56:31,326 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:56:31,326 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:56:31,331 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-06-22 11:56:31,331 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:56:31,332 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 140 transitions. [2018-06-22 11:56:31,332 INFO ]: Start accepts. Automaton has 83 states and 140 transitions. Word has length 33 [2018-06-22 11:56:31,332 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:31,332 INFO ]: Abstraction has 83 states and 140 transitions. [2018-06-22 11:56:31,332 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:56:31,332 INFO ]: Start isEmpty. Operand 83 states and 140 transitions. [2018-06-22 11:56:31,333 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:31,333 INFO ]: Found error trace [2018-06-22 11:56:31,333 INFO ]: trace histogram [3, 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] [2018-06-22 11:56:31,333 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:31,333 INFO ]: Analyzing trace with hash 726436035, now seen corresponding path program 2 times [2018-06-22 11:56:31,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:31,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:31,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:31,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:31,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:31,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:31,546 INFO ]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:31,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:31,546 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:31,552 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:31,571 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:31,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:31,574 INFO ]: Computing forward predicates... [2018-06-22 11:56:31,884 INFO ]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:31,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:31,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 11:56:31,904 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:56:31,904 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:56:31,904 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:31,904 INFO ]: Start difference. First operand 83 states and 140 transitions. Second operand 14 states. [2018-06-22 11:56:32,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:32,067 INFO ]: Finished difference Result 115 states and 190 transitions. [2018-06-22 11:56:32,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:56:32,068 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:56:32,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:32,068 INFO ]: With dead ends: 115 [2018-06-22 11:56:32,068 INFO ]: Without dead ends: 107 [2018-06-22 11:56:32,068 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:56:32,069 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:56:32,074 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 89. [2018-06-22 11:56:32,074 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 11:56:32,075 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 148 transitions. [2018-06-22 11:56:32,075 INFO ]: Start accepts. Automaton has 89 states and 148 transitions. Word has length 33 [2018-06-22 11:56:32,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:32,075 INFO ]: Abstraction has 89 states and 148 transitions. [2018-06-22 11:56:32,075 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:56:32,075 INFO ]: Start isEmpty. Operand 89 states and 148 transitions. [2018-06-22 11:56:32,076 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:32,076 INFO ]: Found error trace [2018-06-22 11:56:32,076 INFO ]: trace histogram [3, 3, 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, 1, 1] [2018-06-22 11:56:32,076 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:32,076 INFO ]: Analyzing trace with hash -953618768, now seen corresponding path program 1 times [2018-06-22 11:56:32,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:32,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:32,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:32,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:32,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:32,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:32,799 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:32,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:32,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 11:56:32,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:32,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:32,835 INFO ]: Computing forward predicates... [2018-06-22 11:56:33,000 INFO ]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:56:33,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:33,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2018-06-22 11:56:33,019 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:56:33,019 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:56:33,019 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:56:33,019 INFO ]: Start difference. First operand 89 states and 148 transitions. Second operand 18 states. [2018-06-22 11:56:34,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:34,462 INFO ]: Finished difference Result 135 states and 233 transitions. [2018-06-22 11:56:34,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:56:34,462 INFO ]: Start accepts. Automaton has 18 states. Word has length 37 [2018-06-22 11:56:34,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:34,463 INFO ]: With dead ends: 135 [2018-06-22 11:56:34,463 INFO ]: Without dead ends: 135 [2018-06-22 11:56:34,464 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:56:34,464 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:56:34,470 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 95. [2018-06-22 11:56:34,470 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 11:56:34,471 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 162 transitions. [2018-06-22 11:56:34,471 INFO ]: Start accepts. Automaton has 95 states and 162 transitions. Word has length 37 [2018-06-22 11:56:34,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:34,471 INFO ]: Abstraction has 95 states and 162 transitions. [2018-06-22 11:56:34,472 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:56:34,472 INFO ]: Start isEmpty. Operand 95 states and 162 transitions. [2018-06-22 11:56:34,473 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:34,473 INFO ]: Found error trace [2018-06-22 11:56:34,474 INFO ]: trace histogram [3, 3, 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, 1, 1] [2018-06-22 11:56:34,474 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:34,474 INFO ]: Analyzing trace with hash -2087045611, now seen corresponding path program 1 times [2018-06-22 11:56:34,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:34,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:34,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:34,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:34,637 INFO ]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:34,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:34,637 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:34,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:34,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:34,663 INFO ]: Computing forward predicates... [2018-06-22 11:56:34,852 INFO ]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:56:34,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:34,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2018-06-22 11:56:34,871 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:56:34,872 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:56:34,872 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:56:34,872 INFO ]: Start difference. First operand 95 states and 162 transitions. Second operand 20 states. [2018-06-22 11:56:35,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:35,437 INFO ]: Finished difference Result 165 states and 277 transitions. [2018-06-22 11:56:35,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:56:35,437 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 11:56:35,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:35,439 INFO ]: With dead ends: 165 [2018-06-22 11:56:35,439 INFO ]: Without dead ends: 159 [2018-06-22 11:56:35,439 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:56:35,440 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 11:56:35,448 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 135. [2018-06-22 11:56:35,448 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:56:35,449 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 229 transitions. [2018-06-22 11:56:35,450 INFO ]: Start accepts. Automaton has 135 states and 229 transitions. Word has length 37 [2018-06-22 11:56:35,450 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:35,450 INFO ]: Abstraction has 135 states and 229 transitions. [2018-06-22 11:56:35,450 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:56:35,450 INFO ]: Start isEmpty. Operand 135 states and 229 transitions. [2018-06-22 11:56:35,451 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:35,451 INFO ]: Found error trace [2018-06-22 11:56:35,451 INFO ]: trace histogram [4, 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-06-22 11:56:35,451 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:35,451 INFO ]: Analyzing trace with hash 565697365, now seen corresponding path program 2 times [2018-06-22 11:56:35,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:35,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:35,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:35,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:35,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:35,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:35,708 INFO ]: Checked inductivity of 25 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:35,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:35,709 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:35,720 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:35,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:35,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:35,741 INFO ]: Computing forward predicates... [2018-06-22 11:56:35,775 INFO ]: Checked inductivity of 25 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:35,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:35,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-22 11:56:35,794 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:56:35,794 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:56:35,795 INFO ]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:35,795 INFO ]: Start difference. First operand 135 states and 229 transitions. Second operand 16 states. [2018-06-22 11:56:36,064 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:36,064 INFO ]: Finished difference Result 163 states and 268 transitions. [2018-06-22 11:56:36,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:56:36,064 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-22 11:56:36,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:36,065 INFO ]: With dead ends: 163 [2018-06-22 11:56:36,065 INFO ]: Without dead ends: 157 [2018-06-22 11:56:36,065 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:36,065 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-22 11:56:36,074 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 133. [2018-06-22 11:56:36,074 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 11:56:36,075 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 226 transitions. [2018-06-22 11:56:36,075 INFO ]: Start accepts. Automaton has 133 states and 226 transitions. Word has length 37 [2018-06-22 11:56:36,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:36,075 INFO ]: Abstraction has 133 states and 226 transitions. [2018-06-22 11:56:36,075 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:56:36,075 INFO ]: Start isEmpty. Operand 133 states and 226 transitions. [2018-06-22 11:56:36,077 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:36,077 INFO ]: Found error trace [2018-06-22 11:56:36,077 INFO ]: trace histogram [3, 3, 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, 1, 1] [2018-06-22 11:56:36,077 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:36,077 INFO ]: Analyzing trace with hash -1354874278, now seen corresponding path program 1 times [2018-06-22 11:56:36,077 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:36,077 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:36,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:36,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:36,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:36,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:36,443 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:36,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:36,443 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:36,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:36,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:36,471 INFO ]: Computing forward predicates... [2018-06-22 11:56:36,515 INFO ]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:56:36,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:36,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2018-06-22 11:56:36,535 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:56:36,535 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:56:36,535 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:56:36,535 INFO ]: Start difference. First operand 133 states and 226 transitions. Second operand 15 states. [2018-06-22 11:56:37,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:37,281 INFO ]: Finished difference Result 209 states and 347 transitions. [2018-06-22 11:56:37,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:56:37,281 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-22 11:56:37,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:37,282 INFO ]: With dead ends: 209 [2018-06-22 11:56:37,282 INFO ]: Without dead ends: 174 [2018-06-22 11:56:37,282 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:56:37,283 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 11:56:37,291 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 138. [2018-06-22 11:56:37,292 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 11:56:37,293 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 236 transitions. [2018-06-22 11:56:37,293 INFO ]: Start accepts. Automaton has 138 states and 236 transitions. Word has length 37 [2018-06-22 11:56:37,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:37,293 INFO ]: Abstraction has 138 states and 236 transitions. [2018-06-22 11:56:37,293 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:56:37,293 INFO ]: Start isEmpty. Operand 138 states and 236 transitions. [2018-06-22 11:56:37,296 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:37,296 INFO ]: Found error trace [2018-06-22 11:56:37,296 INFO ]: trace histogram [3, 3, 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, 1, 1] [2018-06-22 11:56:37,297 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:37,297 INFO ]: Analyzing trace with hash -537509835, now seen corresponding path program 1 times [2018-06-22 11:56:37,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:37,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:37,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:37,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:37,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:37,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:37,441 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:37,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:37,441 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:37,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:37,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:37,467 INFO ]: Computing forward predicates... [2018-06-22 11:56:37,547 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:37,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:37,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 11:56:37,566 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:56:37,566 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:56:37,566 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:56:37,566 INFO ]: Start difference. First operand 138 states and 236 transitions. Second operand 15 states. [2018-06-22 11:56:37,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:37,792 INFO ]: Finished difference Result 178 states and 297 transitions. [2018-06-22 11:56:37,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:56:37,792 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-22 11:56:37,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:37,793 INFO ]: With dead ends: 178 [2018-06-22 11:56:37,793 INFO ]: Without dead ends: 172 [2018-06-22 11:56:37,794 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:56:37,794 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-22 11:56:37,804 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 144. [2018-06-22 11:56:37,804 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 11:56:37,805 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 252 transitions. [2018-06-22 11:56:37,805 INFO ]: Start accepts. Automaton has 144 states and 252 transitions. Word has length 37 [2018-06-22 11:56:37,807 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:37,808 INFO ]: Abstraction has 144 states and 252 transitions. [2018-06-22 11:56:37,808 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:56:37,808 INFO ]: Start isEmpty. Operand 144 states and 252 transitions. [2018-06-22 11:56:37,809 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:37,809 INFO ]: Found error trace [2018-06-22 11:56:37,809 INFO ]: trace histogram [3, 3, 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-06-22 11:56:37,809 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:37,809 INFO ]: Analyzing trace with hash 970020306, now seen corresponding path program 1 times [2018-06-22 11:56:37,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:37,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:37,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:37,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:37,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:37,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:38,112 INFO ]: Checked inductivity of 22 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:56:38,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:38,113 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:38,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:38,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:38,139 INFO ]: Computing forward predicates... [2018-06-22 11:56:38,261 INFO ]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:56:38,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:38,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-06-22 11:56:38,280 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:56:38,281 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:56:38,281 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:56:38,281 INFO ]: Start difference. First operand 144 states and 252 transitions. Second operand 17 states. [2018-06-22 11:56:38,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:38,668 INFO ]: Finished difference Result 188 states and 302 transitions. [2018-06-22 11:56:38,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:56:38,668 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 11:56:38,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:38,669 INFO ]: With dead ends: 188 [2018-06-22 11:56:38,669 INFO ]: Without dead ends: 172 [2018-06-22 11:56:38,669 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:56:38,669 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-22 11:56:38,679 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 146. [2018-06-22 11:56:38,679 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-22 11:56:38,681 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 253 transitions. [2018-06-22 11:56:38,681 INFO ]: Start accepts. Automaton has 146 states and 253 transitions. Word has length 37 [2018-06-22 11:56:38,681 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:38,681 INFO ]: Abstraction has 146 states and 253 transitions. [2018-06-22 11:56:38,681 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:56:38,681 INFO ]: Start isEmpty. Operand 146 states and 253 transitions. [2018-06-22 11:56:38,682 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:38,682 INFO ]: Found error trace [2018-06-22 11:56:38,682 INFO ]: trace histogram [3, 3, 3, 2, 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] [2018-06-22 11:56:38,682 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:38,682 INFO ]: Analyzing trace with hash -974532051, now seen corresponding path program 1 times [2018-06-22 11:56:38,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:38,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:38,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:38,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:38,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:38,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:38,729 INFO ]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:56:38,729 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:38,729 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:56:38,729 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:56:38,730 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:56:38,730 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:56:38,730 INFO ]: Start difference. First operand 146 states and 253 transitions. Second operand 5 states. [2018-06-22 11:56:38,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:38,755 INFO ]: Finished difference Result 100 states and 160 transitions. [2018-06-22 11:56:38,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:56:38,755 INFO ]: Start accepts. Automaton has 5 states. Word has length 41 [2018-06-22 11:56:38,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:38,755 INFO ]: With dead ends: 100 [2018-06-22 11:56:38,755 INFO ]: Without dead ends: 99 [2018-06-22 11:56:38,756 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:38,756 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:56:38,760 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-06-22 11:56:38,760 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 11:56:38,760 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2018-06-22 11:56:38,760 INFO ]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 41 [2018-06-22 11:56:38,760 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:38,760 INFO ]: Abstraction has 95 states and 149 transitions. [2018-06-22 11:56:38,761 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:56:38,761 INFO ]: Start isEmpty. Operand 95 states and 149 transitions. [2018-06-22 11:56:38,761 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:38,761 INFO ]: Found error trace [2018-06-22 11:56:38,761 INFO ]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:38,761 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:38,762 INFO ]: Analyzing trace with hash -215085889, now seen corresponding path program 2 times [2018-06-22 11:56:38,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:38,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:38,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:38,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:38,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:38,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:39,055 INFO ]: Checked inductivity of 31 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:56:39,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:39,071 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:39,077 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:39,097 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:39,097 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:39,099 INFO ]: Computing forward predicates... [2018-06-22 11:56:39,231 INFO ]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:56:39,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:39,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:56:39,250 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:56:39,250 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:56:39,250 INFO ]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:56:39,250 INFO ]: Start difference. First operand 95 states and 149 transitions. Second operand 21 states. [2018-06-22 11:56:39,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:39,868 INFO ]: Finished difference Result 127 states and 192 transitions. [2018-06-22 11:56:39,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:56:39,869 INFO ]: Start accepts. Automaton has 21 states. Word has length 41 [2018-06-22 11:56:39,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:39,869 INFO ]: With dead ends: 127 [2018-06-22 11:56:39,869 INFO ]: Without dead ends: 111 [2018-06-22 11:56:39,870 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:56:39,870 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:56:39,874 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-06-22 11:56:39,874 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:56:39,875 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2018-06-22 11:56:39,875 INFO ]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 41 [2018-06-22 11:56:39,875 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:39,875 INFO ]: Abstraction has 99 states and 152 transitions. [2018-06-22 11:56:39,875 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:56:39,875 INFO ]: Start isEmpty. Operand 99 states and 152 transitions. [2018-06-22 11:56:39,876 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:39,876 INFO ]: Found error trace [2018-06-22 11:56:39,876 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:39,876 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:39,876 INFO ]: Analyzing trace with hash -1598234292, now seen corresponding path program 3 times [2018-06-22 11:56:39,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:39,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:39,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:39,879 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:39,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:39,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:40,092 INFO ]: Checked inductivity of 41 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:56:40,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:40,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:40,098 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:40,125 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:56:40,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:40,126 INFO ]: Computing forward predicates... [2018-06-22 11:56:40,327 INFO ]: Checked inductivity of 41 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:56:40,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:40,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-06-22 11:56:40,348 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:56:40,348 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:56:40,348 INFO ]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:40,349 INFO ]: Start difference. First operand 99 states and 152 transitions. Second operand 22 states. [2018-06-22 11:56:40,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:40,928 INFO ]: Finished difference Result 167 states and 247 transitions. [2018-06-22 11:56:40,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:56:40,928 INFO ]: Start accepts. Automaton has 22 states. Word has length 45 [2018-06-22 11:56:40,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:40,929 INFO ]: With dead ends: 167 [2018-06-22 11:56:40,929 INFO ]: Without dead ends: 141 [2018-06-22 11:56:40,929 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:56:40,930 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:56:40,935 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 113. [2018-06-22 11:56:40,935 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 11:56:40,937 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2018-06-22 11:56:40,937 INFO ]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 45 [2018-06-22 11:56:40,937 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:40,937 INFO ]: Abstraction has 113 states and 171 transitions. [2018-06-22 11:56:40,937 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:56:40,937 INFO ]: Start isEmpty. Operand 113 states and 171 transitions. [2018-06-22 11:56:40,938 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:40,938 INFO ]: Found error trace [2018-06-22 11:56:40,938 INFO ]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:40,938 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:40,939 INFO ]: Analyzing trace with hash 1150912980, now seen corresponding path program 3 times [2018-06-22 11:56:40,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:40,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:40,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:40,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:40,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:40,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,268 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-06-22 11:56:41,832 INFO ]: Checked inductivity of 39 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:56:41,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:41,832 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:41,837 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:41,863 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:56:41,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,866 INFO ]: Computing forward predicates... [2018-06-22 11:56:42,390 INFO ]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:56:42,409 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:42,409 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-06-22 11:56:42,409 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:56:42,409 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:56:42,409 INFO ]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:56:42,410 INFO ]: Start difference. First operand 113 states and 171 transitions. Second operand 33 states. [2018-06-22 11:56:44,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:44,149 INFO ]: Finished difference Result 185 states and 278 transitions. [2018-06-22 11:56:44,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:56:44,163 INFO ]: Start accepts. Automaton has 33 states. Word has length 45 [2018-06-22 11:56:44,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:44,164 INFO ]: With dead ends: 185 [2018-06-22 11:56:44,164 INFO ]: Without dead ends: 181 [2018-06-22 11:56:44,165 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=184, Invalid=1886, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:56:44,165 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 11:56:44,172 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 143. [2018-06-22 11:56:44,172 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 11:56:44,173 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2018-06-22 11:56:44,173 INFO ]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2018-06-22 11:56:44,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:44,173 INFO ]: Abstraction has 143 states and 219 transitions. [2018-06-22 11:56:44,173 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:56:44,173 INFO ]: Start isEmpty. Operand 143 states and 219 transitions. [2018-06-22 11:56:44,174 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:44,174 INFO ]: Found error trace [2018-06-22 11:56:44,174 INFO ]: trace histogram [4, 3, 3, 2, 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-06-22 11:56:44,174 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:44,175 INFO ]: Analyzing trace with hash -764314908, now seen corresponding path program 2 times [2018-06-22 11:56:44,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:44,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:44,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,175 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:44,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:44,311 INFO ]: Checked inductivity of 38 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:56:44,311 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:44,311 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:44,317 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:44,341 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:44,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:44,343 INFO ]: Computing forward predicates... [2018-06-22 11:56:44,417 INFO ]: Checked inductivity of 38 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:56:44,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:44,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-06-22 11:56:44,436 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:56:44,436 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:56:44,436 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:56:44,436 INFO ]: Start difference. First operand 143 states and 219 transitions. Second operand 18 states. [2018-06-22 11:56:44,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:44,841 INFO ]: Finished difference Result 161 states and 243 transitions. [2018-06-22 11:56:44,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:56:44,841 INFO ]: Start accepts. Automaton has 18 states. Word has length 45 [2018-06-22 11:56:44,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:44,842 INFO ]: With dead ends: 161 [2018-06-22 11:56:44,842 INFO ]: Without dead ends: 143 [2018-06-22 11:56:44,842 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:56:44,842 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 11:56:44,847 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 131. [2018-06-22 11:56:44,847 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 11:56:44,848 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2018-06-22 11:56:44,848 INFO ]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 45 [2018-06-22 11:56:44,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:44,849 INFO ]: Abstraction has 131 states and 199 transitions. [2018-06-22 11:56:44,849 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:56:44,849 INFO ]: Start isEmpty. Operand 131 states and 199 transitions. [2018-06-22 11:56:44,850 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:44,850 INFO ]: Found error trace [2018-06-22 11:56:44,850 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 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] [2018-06-22 11:56:44,850 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:44,850 INFO ]: Analyzing trace with hash -1277616770, now seen corresponding path program 3 times [2018-06-22 11:56:44,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:44,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:44,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,850 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:44,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:45,076 INFO ]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:56:45,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:45,076 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:45,083 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:45,110 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:56:45,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:45,113 INFO ]: Computing forward predicates... [2018-06-22 11:56:45,417 INFO ]: Checked inductivity of 48 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:56:45,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:45,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-22 11:56:45,436 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:56:45,436 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:56:45,436 INFO ]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:56:45,436 INFO ]: Start difference. First operand 131 states and 199 transitions. Second operand 24 states. [2018-06-22 11:56:46,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:46,686 INFO ]: Finished difference Result 215 states and 334 transitions. [2018-06-22 11:56:46,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:56:46,686 INFO ]: Start accepts. Automaton has 24 states. Word has length 49 [2018-06-22 11:56:46,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:46,687 INFO ]: With dead ends: 215 [2018-06-22 11:56:46,687 INFO ]: Without dead ends: 211 [2018-06-22 11:56:46,688 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:56:46,688 INFO ]: Start minimizeSevpa. Operand 211 states. [2018-06-22 11:56:46,696 INFO ]: Finished minimizeSevpa. Reduced states from 211 to 163. [2018-06-22 11:56:46,696 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-22 11:56:46,697 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2018-06-22 11:56:46,697 INFO ]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 49 [2018-06-22 11:56:46,697 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:46,697 INFO ]: Abstraction has 163 states and 251 transitions. [2018-06-22 11:56:46,697 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:56:46,697 INFO ]: Start isEmpty. Operand 163 states and 251 transitions. [2018-06-22 11:56:46,699 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:46,699 INFO ]: Found error trace [2018-06-22 11:56:46,700 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 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] [2018-06-22 11:56:46,700 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:46,700 INFO ]: Analyzing trace with hash -283844450, now seen corresponding path program 3 times [2018-06-22 11:56:46,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:46,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:46,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:46,700 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:46,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:46,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:46,849 INFO ]: Checked inductivity of 48 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:56:46,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:46,849 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 11:56:46,860 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:46,951 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:56:46,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:46,953 INFO ]: Computing forward predicates... [2018-06-22 11:56:47,035 INFO ]: Checked inductivity of 48 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:56:47,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:47,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:56:47,058 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:47,058 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:47,058 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:47,058 INFO ]: Start difference. First operand 163 states and 251 transitions. Second operand 4 states. [2018-06-22 11:56:47,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:47,088 INFO ]: Finished difference Result 173 states and 260 transitions. [2018-06-22 11:56:47,088 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:56:47,088 INFO ]: Start accepts. Automaton has 4 states. Word has length 49 [2018-06-22 11:56:47,088 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:47,089 INFO ]: With dead ends: 173 [2018-06-22 11:56:47,089 INFO ]: Without dead ends: 167 [2018-06-22 11:56:47,089 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:56:47,089 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:56:47,097 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-06-22 11:56:47,097 INFO ]: Start removeUnreachable. Operand 167 states. [2018-06-22 11:56:47,098 INFO ]: Finished removeUnreachable. Reduced from 167 states to 167 states and 253 transitions. [2018-06-22 11:56:47,098 INFO ]: Start accepts. Automaton has 167 states and 253 transitions. Word has length 49 [2018-06-22 11:56:47,098 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:47,098 INFO ]: Abstraction has 167 states and 253 transitions. [2018-06-22 11:56:47,098 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:47,098 INFO ]: Start isEmpty. Operand 167 states and 253 transitions. [2018-06-22 11:56:47,099 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:47,099 INFO ]: Found error trace [2018-06-22 11:56:47,099 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 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] [2018-06-22 11:56:47,100 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:47,100 INFO ]: Analyzing trace with hash -2145107810, now seen corresponding path program 4 times [2018-06-22 11:56:47,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:47,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:47,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:47,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:47,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:47,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:47,269 INFO ]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:56:47,269 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:47,269 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:56:47,269 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:56:47,269 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:56:47,269 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:56:47,269 INFO ]: Start difference. First operand 167 states and 253 transitions. Second operand 5 states. [2018-06-22 11:56:47,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:47,320 INFO ]: Finished difference Result 143 states and 214 transitions. [2018-06-22 11:56:47,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:56:47,321 INFO ]: Start accepts. Automaton has 5 states. Word has length 49 [2018-06-22 11:56:47,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:47,322 INFO ]: With dead ends: 143 [2018-06-22 11:56:47,322 INFO ]: Without dead ends: 136 [2018-06-22 11:56:47,322 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:47,322 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 11:56:47,327 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-22 11:56:47,327 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 11:56:47,328 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 204 transitions. [2018-06-22 11:56:47,328 INFO ]: Start accepts. Automaton has 136 states and 204 transitions. Word has length 49 [2018-06-22 11:56:47,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:47,328 INFO ]: Abstraction has 136 states and 204 transitions. [2018-06-22 11:56:47,328 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:56:47,328 INFO ]: Start isEmpty. Operand 136 states and 204 transitions. [2018-06-22 11:56:47,329 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:47,329 INFO ]: Found error trace [2018-06-22 11:56:47,329 INFO ]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:47,329 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:47,329 INFO ]: Analyzing trace with hash -1310064674, now seen corresponding path program 4 times [2018-06-22 11:56:47,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:47,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:47,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:47,330 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:47,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:47,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:47,443 INFO ]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:56:47,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:47,443 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:47,449 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:56:47,474 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:56:47,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:47,476 INFO ]: Computing forward predicates... [2018-06-22 11:56:47,618 INFO ]: Checked inductivity of 52 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:56:47,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:47,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 25 [2018-06-22 11:56:47,638 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:56:47,638 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:56:47,638 INFO ]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:56:47,638 INFO ]: Start difference. First operand 136 states and 204 transitions. Second operand 25 states. [2018-06-22 11:56:48,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:48,531 INFO ]: Finished difference Result 162 states and 238 transitions. [2018-06-22 11:56:48,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:56:48,531 INFO ]: Start accepts. Automaton has 25 states. Word has length 49 [2018-06-22 11:56:48,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:48,532 INFO ]: With dead ends: 162 [2018-06-22 11:56:48,532 INFO ]: Without dead ends: 156 [2018-06-22 11:56:48,533 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:56:48,533 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 11:56:48,539 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 138. [2018-06-22 11:56:48,539 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 11:56:48,540 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 204 transitions. [2018-06-22 11:56:48,540 INFO ]: Start accepts. Automaton has 138 states and 204 transitions. Word has length 49 [2018-06-22 11:56:48,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:48,540 INFO ]: Abstraction has 138 states and 204 transitions. [2018-06-22 11:56:48,540 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:56:48,540 INFO ]: Start isEmpty. Operand 138 states and 204 transitions. [2018-06-22 11:56:48,542 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:48,542 INFO ]: Found error trace [2018-06-22 11:56:48,542 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 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] [2018-06-22 11:56:48,542 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:48,543 INFO ]: Analyzing trace with hash -606592221, now seen corresponding path program 2 times [2018-06-22 11:56:48,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:48,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:48,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:48,543 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:48,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:48,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:48,712 INFO ]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:56:48,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:48,712 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:48,718 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:48,747 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:48,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:48,749 INFO ]: Computing forward predicates... [2018-06-22 11:56:48,805 INFO ]: Checked inductivity of 48 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:56:48,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:48,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2018-06-22 11:56:48,824 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:56:48,824 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:56:48,824 INFO ]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:56:48,824 INFO ]: Start difference. First operand 138 states and 204 transitions. Second operand 18 states. [2018-06-22 11:56:49,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:49,106 INFO ]: Finished difference Result 170 states and 249 transitions. [2018-06-22 11:56:49,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:56:49,106 INFO ]: Start accepts. Automaton has 18 states. Word has length 49 [2018-06-22 11:56:49,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:49,107 INFO ]: With dead ends: 170 [2018-06-22 11:56:49,107 INFO ]: Without dead ends: 154 [2018-06-22 11:56:49,108 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:56:49,108 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 11:56:49,113 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 128. [2018-06-22 11:56:49,113 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 11:56:49,114 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 193 transitions. [2018-06-22 11:56:49,114 INFO ]: Start accepts. Automaton has 128 states and 193 transitions. Word has length 49 [2018-06-22 11:56:49,114 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:49,114 INFO ]: Abstraction has 128 states and 193 transitions. [2018-06-22 11:56:49,114 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:56:49,114 INFO ]: Start isEmpty. Operand 128 states and 193 transitions. [2018-06-22 11:56:49,115 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:56:49,115 INFO ]: Found error trace [2018-06-22 11:56:49,115 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:49,115 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:49,116 INFO ]: Analyzing trace with hash 764469213, now seen corresponding path program 2 times [2018-06-22 11:56:49,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:49,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:49,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:49,116 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:49,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:49,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:49,305 INFO ]: Checked inductivity of 61 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 11:56:49,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:49,375 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:49,381 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:49,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:49,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:49,448 INFO ]: Computing forward predicates... [2018-06-22 11:56:49,726 INFO ]: Checked inductivity of 61 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:56:49,744 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:49,744 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-06-22 11:56:49,745 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:56:49,745 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:56:49,745 INFO ]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:56:49,745 INFO ]: Start difference. First operand 128 states and 193 transitions. Second operand 25 states. [2018-06-22 11:56:50,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:50,332 INFO ]: Finished difference Result 148 states and 222 transitions. [2018-06-22 11:56:50,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:56:50,333 INFO ]: Start accepts. Automaton has 25 states. Word has length 53 [2018-06-22 11:56:50,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:50,333 INFO ]: With dead ends: 148 [2018-06-22 11:56:50,333 INFO ]: Without dead ends: 140 [2018-06-22 11:56:50,334 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:56:50,334 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 11:56:50,339 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 116. [2018-06-22 11:56:50,339 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:56:50,339 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2018-06-22 11:56:50,339 INFO ]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 53 [2018-06-22 11:56:50,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:50,339 INFO ]: Abstraction has 116 states and 172 transitions. [2018-06-22 11:56:50,340 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:56:50,340 INFO ]: Start isEmpty. Operand 116 states and 172 transitions. [2018-06-22 11:56:50,340 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:56:50,340 INFO ]: Found error trace [2018-06-22 11:56:50,340 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:50,340 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:50,340 INFO ]: Analyzing trace with hash 389854997, now seen corresponding path program 4 times [2018-06-22 11:56:50,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:50,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:50,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:50,341 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:50,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:50,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:50,482 INFO ]: Checked inductivity of 78 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:56:50,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:50,482 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:50,488 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:56:50,517 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:56:50,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:50,520 INFO ]: Computing forward predicates... [2018-06-22 11:56:50,623 INFO ]: Checked inductivity of 78 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:56:50,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:50,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-22 11:56:50,642 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:56:50,642 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:56:50,642 INFO ]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:56:50,642 INFO ]: Start difference. First operand 116 states and 172 transitions. Second operand 20 states. [2018-06-22 11:56:50,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:50,929 INFO ]: Finished difference Result 184 states and 271 transitions. [2018-06-22 11:56:50,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:56:50,929 INFO ]: Start accepts. Automaton has 20 states. Word has length 57 [2018-06-22 11:56:50,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:50,930 INFO ]: With dead ends: 184 [2018-06-22 11:56:50,930 INFO ]: Without dead ends: 176 [2018-06-22 11:56:50,931 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:56:50,931 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 11:56:50,937 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 134. [2018-06-22 11:56:50,937 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 11:56:50,938 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2018-06-22 11:56:50,938 INFO ]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 57 [2018-06-22 11:56:50,938 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:50,938 INFO ]: Abstraction has 134 states and 194 transitions. [2018-06-22 11:56:50,938 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:56:50,938 INFO ]: Start isEmpty. Operand 134 states and 194 transitions. [2018-06-22 11:56:50,939 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:56:50,939 INFO ]: Found error trace [2018-06-22 11:56:50,939 INFO ]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:50,939 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:50,939 INFO ]: Analyzing trace with hash 651533349, now seen corresponding path program 5 times [2018-06-22 11:56:50,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:50,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:50,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:50,940 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:50,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:50,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:52,244 INFO ]: Checked inductivity of 74 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:56:52,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:52,244 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:52,250 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:56:52,291 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:56:52,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:52,294 INFO ]: Computing forward predicates... [2018-06-22 11:56:53,012 INFO ]: Checked inductivity of 74 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:56:53,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:53,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-06-22 11:56:53,031 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:56:53,032 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:56:53,032 INFO ]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:53,032 INFO ]: Start difference. First operand 134 states and 194 transitions. Second operand 22 states. [2018-06-22 11:56:53,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:53,627 INFO ]: Finished difference Result 140 states and 203 transitions. [2018-06-22 11:56:53,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:56:53,628 INFO ]: Start accepts. Automaton has 22 states. Word has length 57 [2018-06-22 11:56:53,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:53,628 INFO ]: With dead ends: 140 [2018-06-22 11:56:53,628 INFO ]: Without dead ends: 140 [2018-06-22 11:56:53,628 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:56:53,629 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 11:56:53,633 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-06-22 11:56:53,633 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:56:53,634 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2018-06-22 11:56:53,634 INFO ]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 57 [2018-06-22 11:56:53,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:53,634 INFO ]: Abstraction has 122 states and 177 transitions. [2018-06-22 11:56:53,634 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:56:53,634 INFO ]: Start isEmpty. Operand 122 states and 177 transitions. [2018-06-22 11:56:53,635 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:53,635 INFO ]: Found error trace [2018-06-22 11:56:53,635 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:53,635 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:53,635 INFO ]: Analyzing trace with hash -1651765084, now seen corresponding path program 3 times [2018-06-22 11:56:53,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:53,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:53,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:53,635 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:53,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:53,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:53,790 INFO ]: Checked inductivity of 90 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:56:53,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:53,790 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:53,796 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:53,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:56:53,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:53,837 INFO ]: Computing forward predicates... [2018-06-22 11:56:53,954 INFO ]: Checked inductivity of 90 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 11:56:53,973 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:53,973 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2018-06-22 11:56:53,973 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:56:53,973 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:56:53,973 INFO ]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:56:53,974 INFO ]: Start difference. First operand 122 states and 177 transitions. Second operand 23 states. [2018-06-22 11:56:54,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:54,636 INFO ]: Finished difference Result 200 states and 273 transitions. [2018-06-22 11:56:54,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:56:54,636 INFO ]: Start accepts. Automaton has 23 states. Word has length 61 [2018-06-22 11:56:54,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:54,637 INFO ]: With dead ends: 200 [2018-06-22 11:56:54,637 INFO ]: Without dead ends: 164 [2018-06-22 11:56:54,638 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:56:54,638 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 11:56:54,643 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 148. [2018-06-22 11:56:54,643 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 11:56:54,644 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 209 transitions. [2018-06-22 11:56:54,644 INFO ]: Start accepts. Automaton has 148 states and 209 transitions. Word has length 61 [2018-06-22 11:56:54,644 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:54,644 INFO ]: Abstraction has 148 states and 209 transitions. [2018-06-22 11:56:54,644 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:56:54,644 INFO ]: Start isEmpty. Operand 148 states and 209 transitions. [2018-06-22 11:56:54,645 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:54,645 INFO ]: Found error trace [2018-06-22 11:56:54,646 INFO ]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:54,646 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:54,646 INFO ]: Analyzing trace with hash 1293017511, now seen corresponding path program 6 times [2018-06-22 11:56:54,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:54,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:54,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:54,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:54,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:54,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:54,852 INFO ]: Checked inductivity of 91 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 11:56:54,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:54,852 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:54,857 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:56:54,892 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:56:54,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:54,894 INFO ]: Computing forward predicates... [2018-06-22 11:56:54,965 INFO ]: Checked inductivity of 91 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 11:56:54,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:54,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 22 [2018-06-22 11:56:54,984 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:56:54,984 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:56:54,984 INFO ]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:54,984 INFO ]: Start difference. First operand 148 states and 209 transitions. Second operand 22 states. [2018-06-22 11:56:55,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:55,300 INFO ]: Finished difference Result 182 states and 262 transitions. [2018-06-22 11:56:55,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:56:55,300 INFO ]: Start accepts. Automaton has 22 states. Word has length 61 [2018-06-22 11:56:55,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:55,301 INFO ]: With dead ends: 182 [2018-06-22 11:56:55,301 INFO ]: Without dead ends: 176 [2018-06-22 11:56:55,301 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:56:55,301 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 11:56:55,306 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 154. [2018-06-22 11:56:55,306 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 11:56:55,307 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2018-06-22 11:56:55,307 INFO ]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 61 [2018-06-22 11:56:55,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:55,307 INFO ]: Abstraction has 154 states and 216 transitions. [2018-06-22 11:56:55,307 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:56:55,307 INFO ]: Start isEmpty. Operand 154 states and 216 transitions. [2018-06-22 11:56:55,308 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:55,308 INFO ]: Found error trace [2018-06-22 11:56:55,308 INFO ]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:55,308 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:55,309 INFO ]: Analyzing trace with hash -2110117881, now seen corresponding path program 4 times [2018-06-22 11:56:55,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:55,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:55,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:55,309 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:55,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:55,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:55,554 INFO ]: Checked inductivity of 87 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:56:55,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:55,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:55,559 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:56:55,592 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:56:55,592 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:55,594 INFO ]: Computing forward predicates... [2018-06-22 11:56:55,794 INFO ]: Checked inductivity of 87 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:56:55,814 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:55,814 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-06-22 11:56:55,814 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:56:55,814 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:56:55,814 INFO ]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:56:55,814 INFO ]: Start difference. First operand 154 states and 216 transitions. Second operand 28 states. [2018-06-22 11:56:56,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:56,402 INFO ]: Finished difference Result 204 states and 291 transitions. [2018-06-22 11:56:56,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:56:56,402 INFO ]: Start accepts. Automaton has 28 states. Word has length 61 [2018-06-22 11:56:56,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:56,403 INFO ]: With dead ends: 204 [2018-06-22 11:56:56,403 INFO ]: Without dead ends: 194 [2018-06-22 11:56:56,403 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=2267, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:56:56,403 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-22 11:56:56,409 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 172. [2018-06-22 11:56:56,409 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 11:56:56,410 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 244 transitions. [2018-06-22 11:56:56,410 INFO ]: Start accepts. Automaton has 172 states and 244 transitions. Word has length 61 [2018-06-22 11:56:56,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:56,410 INFO ]: Abstraction has 172 states and 244 transitions. [2018-06-22 11:56:56,410 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:56:56,410 INFO ]: Start isEmpty. Operand 172 states and 244 transitions. [2018-06-22 11:56:56,413 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:56:56,413 INFO ]: Found error trace [2018-06-22 11:56:56,413 INFO ]: trace histogram [6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:56,413 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:56,414 INFO ]: Analyzing trace with hash 283900140, now seen corresponding path program 7 times [2018-06-22 11:56:56,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:56,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:56,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:56,414 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:56,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:56,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:56,740 INFO ]: Checked inductivity of 106 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:56:56,740 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:56,740 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:56,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:56,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:56,783 INFO ]: Computing forward predicates... [2018-06-22 11:56:56,941 INFO ]: Checked inductivity of 106 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-22 11:56:56,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:56,960 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2018-06-22 11:56:56,960 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:56:56,960 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:56:56,961 INFO ]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:56:56,961 INFO ]: Start difference. First operand 172 states and 244 transitions. Second operand 26 states. [2018-06-22 11:56:57,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:57,433 INFO ]: Finished difference Result 218 states and 304 transitions. [2018-06-22 11:56:57,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:56:57,434 INFO ]: Start accepts. Automaton has 26 states. Word has length 65 [2018-06-22 11:56:57,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:57,434 INFO ]: With dead ends: 218 [2018-06-22 11:56:57,434 INFO ]: Without dead ends: 194 [2018-06-22 11:56:57,435 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1896, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:56:57,435 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-22 11:56:57,441 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 152. [2018-06-22 11:56:57,442 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-22 11:56:57,442 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2018-06-22 11:56:57,442 INFO ]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 65 [2018-06-22 11:56:57,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:57,443 INFO ]: Abstraction has 152 states and 219 transitions. [2018-06-22 11:56:57,443 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:56:57,443 INFO ]: Start isEmpty. Operand 152 states and 219 transitions. [2018-06-22 11:56:57,444 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:56:57,444 INFO ]: Found error trace [2018-06-22 11:56:57,444 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:57,444 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:57,444 INFO ]: Analyzing trace with hash -1484058138, now seen corresponding path program 4 times [2018-06-22 11:56:57,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:57,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:57,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:57,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:57,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:57,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:57,606 INFO ]: Checked inductivity of 105 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:56:57,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:57,606 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:57,611 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:56:57,670 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:56:57,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:57,674 INFO ]: Computing forward predicates... [2018-06-22 11:56:57,837 INFO ]: Checked inductivity of 105 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:56:57,855 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:57,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 22 [2018-06-22 11:56:57,856 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:56:57,856 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:56:57,856 INFO ]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:57,856 INFO ]: Start difference. First operand 152 states and 219 transitions. Second operand 22 states. [2018-06-22 11:56:58,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:58,200 INFO ]: Finished difference Result 164 states and 237 transitions. [2018-06-22 11:56:58,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:56:58,200 INFO ]: Start accepts. Automaton has 22 states. Word has length 65 [2018-06-22 11:56:58,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:58,201 INFO ]: With dead ends: 164 [2018-06-22 11:56:58,201 INFO ]: Without dead ends: 158 [2018-06-22 11:56:58,201 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:56:58,201 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-22 11:56:58,204 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 140. [2018-06-22 11:56:58,204 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 11:56:58,205 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 204 transitions. [2018-06-22 11:56:58,205 INFO ]: Start accepts. Automaton has 140 states and 204 transitions. Word has length 65 [2018-06-22 11:56:58,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:58,205 INFO ]: Abstraction has 140 states and 204 transitions. [2018-06-22 11:56:58,205 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:56:58,205 INFO ]: Start isEmpty. Operand 140 states and 204 transitions. [2018-06-22 11:56:58,205 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:56:58,205 INFO ]: Found error trace [2018-06-22 11:56:58,205 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:58,206 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:58,206 INFO ]: Analyzing trace with hash 1655001756, now seen corresponding path program 5 times [2018-06-22 11:56:58,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:58,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:58,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:58,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:58,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:58,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,138 INFO ]: Checked inductivity of 108 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-22 11:56:59,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:59,138 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:59,144 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:56:59,184 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:56:59,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,187 INFO ]: Computing forward predicates... [2018-06-22 11:56:59,258 INFO ]: Checked inductivity of 108 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-22 11:56:59,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:59,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-06-22 11:56:59,278 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:56:59,278 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:56:59,278 INFO ]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:56:59,278 INFO ]: Start difference. First operand 140 states and 204 transitions. Second operand 20 states. [2018-06-22 11:56:59,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:59,516 INFO ]: Finished difference Result 154 states and 221 transitions. [2018-06-22 11:56:59,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:56:59,517 INFO ]: Start accepts. Automaton has 20 states. Word has length 65 [2018-06-22 11:56:59,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:59,518 INFO ]: With dead ends: 154 [2018-06-22 11:56:59,518 INFO ]: Without dead ends: 142 [2018-06-22 11:56:59,518 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:56:59,518 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 11:56:59,523 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 130. [2018-06-22 11:56:59,523 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 11:56:59,524 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2018-06-22 11:56:59,524 INFO ]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 65 [2018-06-22 11:56:59,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:59,524 INFO ]: Abstraction has 130 states and 187 transitions. [2018-06-22 11:56:59,524 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:56:59,524 INFO ]: Start isEmpty. Operand 130 states and 187 transitions. [2018-06-22 11:56:59,525 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:56:59,525 INFO ]: Found error trace [2018-06-22 11:56:59,525 INFO ]: trace histogram [6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:59,525 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:59,525 INFO ]: Analyzing trace with hash 469698899, now seen corresponding path program 5 times [2018-06-22 11:56:59,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:59,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:59,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:59,526 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:59,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:59,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,677 INFO ]: Checked inductivity of 118 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:56:59,677 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:59,694 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:56:59,699 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:56:59,738 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:56:59,738 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,741 INFO ]: Computing forward predicates... [2018-06-22 11:56:59,907 INFO ]: Checked inductivity of 118 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:56:59,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:59,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-22 11:56:59,926 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:56:59,926 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:56:59,926 INFO ]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:56:59,926 INFO ]: Start difference. First operand 130 states and 187 transitions. Second operand 20 states. [2018-06-22 11:57:00,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:00,134 INFO ]: Finished difference Result 148 states and 218 transitions. [2018-06-22 11:57:00,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:57:00,135 INFO ]: Start accepts. Automaton has 20 states. Word has length 69 [2018-06-22 11:57:00,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:00,136 INFO ]: With dead ends: 148 [2018-06-22 11:57:00,136 INFO ]: Without dead ends: 148 [2018-06-22 11:57:00,136 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:57:00,137 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 11:57:00,141 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 118. [2018-06-22 11:57:00,141 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:57:00,142 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 173 transitions. [2018-06-22 11:57:00,142 INFO ]: Start accepts. Automaton has 118 states and 173 transitions. Word has length 69 [2018-06-22 11:57:00,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:00,142 INFO ]: Abstraction has 118 states and 173 transitions. [2018-06-22 11:57:00,142 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:57:00,142 INFO ]: Start isEmpty. Operand 118 states and 173 transitions. [2018-06-22 11:57:00,142 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:57:00,142 INFO ]: Found error trace [2018-06-22 11:57:00,142 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:00,142 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:00,143 INFO ]: Analyzing trace with hash 456063518, now seen corresponding path program 6 times [2018-06-22 11:57:00,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:00,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:00,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:00,143 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:00,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:00,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:00,338 INFO ]: Checked inductivity of 127 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:57:00,338 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:00,338 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:00,345 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:00,386 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:57:00,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:00,389 INFO ]: Computing forward predicates... [2018-06-22 11:57:00,683 INFO ]: Checked inductivity of 127 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:57:00,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:00,702 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2018-06-22 11:57:00,702 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:57:00,702 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:57:00,702 INFO ]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:57:00,703 INFO ]: Start difference. First operand 118 states and 173 transitions. Second operand 30 states. [2018-06-22 11:57:01,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:01,454 INFO ]: Finished difference Result 278 states and 385 transitions. [2018-06-22 11:57:01,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:57:01,454 INFO ]: Start accepts. Automaton has 30 states. Word has length 69 [2018-06-22 11:57:01,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:01,455 INFO ]: With dead ends: 278 [2018-06-22 11:57:01,455 INFO ]: Without dead ends: 214 [2018-06-22 11:57:01,456 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=2509, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:57:01,456 INFO ]: Start minimizeSevpa. Operand 214 states. [2018-06-22 11:57:01,462 INFO ]: Finished minimizeSevpa. Reduced states from 214 to 150. [2018-06-22 11:57:01,462 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-22 11:57:01,463 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 210 transitions. [2018-06-22 11:57:01,463 INFO ]: Start accepts. Automaton has 150 states and 210 transitions. Word has length 69 [2018-06-22 11:57:01,463 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:01,463 INFO ]: Abstraction has 150 states and 210 transitions. [2018-06-22 11:57:01,463 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:57:01,463 INFO ]: Start isEmpty. Operand 150 states and 210 transitions. [2018-06-22 11:57:01,464 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:57:01,464 INFO ]: Found error trace [2018-06-22 11:57:01,464 INFO ]: trace histogram [7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:01,464 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:01,464 INFO ]: Analyzing trace with hash -45977424, now seen corresponding path program 8 times [2018-06-22 11:57:01,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:01,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:01,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:01,465 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:01,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:01,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:01,742 INFO ]: Checked inductivity of 142 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:57:01,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:01,742 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:01,748 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:01,793 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:01,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:01,796 INFO ]: Computing forward predicates... [2018-06-22 11:57:02,995 INFO ]: Checked inductivity of 142 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:57:03,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:03,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 25 [2018-06-22 11:57:03,014 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:57:03,014 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:57:03,014 INFO ]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:03,014 INFO ]: Start difference. First operand 150 states and 210 transitions. Second operand 25 states. [2018-06-22 11:57:03,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:03,371 INFO ]: Finished difference Result 182 states and 257 transitions. [2018-06-22 11:57:03,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:57:03,372 INFO ]: Start accepts. Automaton has 25 states. Word has length 73 [2018-06-22 11:57:03,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:03,372 INFO ]: With dead ends: 182 [2018-06-22 11:57:03,372 INFO ]: Without dead ends: 176 [2018-06-22 11:57:03,373 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:57:03,373 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 11:57:03,376 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 154. [2018-06-22 11:57:03,376 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 11:57:03,377 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2018-06-22 11:57:03,377 INFO ]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 73 [2018-06-22 11:57:03,377 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:03,377 INFO ]: Abstraction has 154 states and 214 transitions. [2018-06-22 11:57:03,377 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:57:03,377 INFO ]: Start isEmpty. Operand 154 states and 214 transitions. [2018-06-22 11:57:03,380 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:57:03,380 INFO ]: Found error trace [2018-06-22 11:57:03,380 INFO ]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:03,380 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:03,380 INFO ]: Analyzing trace with hash 1323323344, now seen corresponding path program 6 times [2018-06-22 11:57:03,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:03,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:03,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:03,380 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:03,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:03,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:03,610 INFO ]: Checked inductivity of 138 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 11:57:03,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:03,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:03,615 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:03,657 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:57:03,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:03,660 INFO ]: Computing forward predicates... [2018-06-22 11:57:03,875 INFO ]: Checked inductivity of 138 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 11:57:03,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:03,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2018-06-22 11:57:03,895 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:03,895 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:03,895 INFO ]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:03,895 INFO ]: Start difference. First operand 154 states and 214 transitions. Second operand 24 states. [2018-06-22 11:57:04,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:04,233 INFO ]: Finished difference Result 206 states and 290 transitions. [2018-06-22 11:57:04,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:57:04,233 INFO ]: Start accepts. Automaton has 24 states. Word has length 73 [2018-06-22 11:57:04,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:04,234 INFO ]: With dead ends: 206 [2018-06-22 11:57:04,234 INFO ]: Without dead ends: 204 [2018-06-22 11:57:04,234 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:57:04,234 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-22 11:57:04,238 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 182. [2018-06-22 11:57:04,238 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 11:57:04,239 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2018-06-22 11:57:04,239 INFO ]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 73 [2018-06-22 11:57:04,239 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:04,239 INFO ]: Abstraction has 182 states and 256 transitions. [2018-06-22 11:57:04,239 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:04,239 INFO ]: Start isEmpty. Operand 182 states and 256 transitions. [2018-06-22 11:57:04,240 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:57:04,240 INFO ]: Found error trace [2018-06-22 11:57:04,240 INFO ]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:04,240 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:04,240 INFO ]: Analyzing trace with hash 1282514037, now seen corresponding path program 3 times [2018-06-22 11:57:04,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:04,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:04,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:04,240 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:04,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:04,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:04,626 INFO ]: Checked inductivity of 138 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 11:57:04,626 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:04,626 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:04,632 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:04,674 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:57:04,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:04,677 INFO ]: Computing forward predicates... [2018-06-22 11:57:04,783 INFO ]: Checked inductivity of 138 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-22 11:57:04,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:04,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 24 [2018-06-22 11:57:04,802 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:04,802 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:04,802 INFO ]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:04,802 INFO ]: Start difference. First operand 182 states and 256 transitions. Second operand 24 states. [2018-06-22 11:57:05,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:05,183 INFO ]: Finished difference Result 252 states and 358 transitions. [2018-06-22 11:57:05,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:57:05,183 INFO ]: Start accepts. Automaton has 24 states. Word has length 73 [2018-06-22 11:57:05,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:05,184 INFO ]: With dead ends: 252 [2018-06-22 11:57:05,184 INFO ]: Without dead ends: 240 [2018-06-22 11:57:05,185 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:57:05,185 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-22 11:57:05,190 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 176. [2018-06-22 11:57:05,190 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-22 11:57:05,190 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 250 transitions. [2018-06-22 11:57:05,190 INFO ]: Start accepts. Automaton has 176 states and 250 transitions. Word has length 73 [2018-06-22 11:57:05,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:05,190 INFO ]: Abstraction has 176 states and 250 transitions. [2018-06-22 11:57:05,190 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:05,190 INFO ]: Start isEmpty. Operand 176 states and 250 transitions. [2018-06-22 11:57:05,191 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:57:05,191 INFO ]: Found error trace [2018-06-22 11:57:05,191 INFO ]: trace histogram [7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:05,192 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:05,192 INFO ]: Analyzing trace with hash 268791605, now seen corresponding path program 9 times [2018-06-22 11:57:05,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:05,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:05,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:05,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:05,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:05,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:05,395 INFO ]: Checked inductivity of 161 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-22 11:57:05,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:05,395 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:05,401 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:05,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:57:05,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:05,447 INFO ]: Computing forward predicates... [2018-06-22 11:57:05,784 INFO ]: Checked inductivity of 161 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 11:57:05,802 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:05,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-22 11:57:05,803 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:57:05,803 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:57:05,803 INFO ]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:57:05,803 INFO ]: Start difference. First operand 176 states and 250 transitions. Second operand 33 states. [2018-06-22 11:57:06,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:06,246 INFO ]: Finished difference Result 188 states and 262 transitions. [2018-06-22 11:57:06,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:57:06,246 INFO ]: Start accepts. Automaton has 33 states. Word has length 77 [2018-06-22 11:57:06,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:06,247 INFO ]: With dead ends: 188 [2018-06-22 11:57:06,247 INFO ]: Without dead ends: 176 [2018-06-22 11:57:06,247 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=2090, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:57:06,248 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 11:57:06,253 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-06-22 11:57:06,253 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-22 11:57:06,253 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2018-06-22 11:57:06,253 INFO ]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 77 [2018-06-22 11:57:06,253 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:06,253 INFO ]: Abstraction has 168 states and 241 transitions. [2018-06-22 11:57:06,253 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:57:06,254 INFO ]: Start isEmpty. Operand 168 states and 241 transitions. [2018-06-22 11:57:06,254 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:57:06,255 INFO ]: Found error trace [2018-06-22 11:57:06,255 INFO ]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:06,255 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:06,255 INFO ]: Analyzing trace with hash 867361071, now seen corresponding path program 5 times [2018-06-22 11:57:06,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:06,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:06,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:06,255 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:06,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:06,267 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:06,437 INFO ]: Checked inductivity of 161 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 11:57:06,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:06,438 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:06,443 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:06,487 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:57:06,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:06,490 INFO ]: Computing forward predicates... [2018-06-22 11:57:06,641 INFO ]: Checked inductivity of 161 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 11:57:06,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:06,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-22 11:57:06,660 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:57:06,660 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:57:06,660 INFO ]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:57:06,660 INFO ]: Start difference. First operand 168 states and 241 transitions. Second operand 28 states. [2018-06-22 11:57:07,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:07,378 INFO ]: Finished difference Result 180 states and 261 transitions. [2018-06-22 11:57:07,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:57:07,378 INFO ]: Start accepts. Automaton has 28 states. Word has length 77 [2018-06-22 11:57:07,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:07,379 INFO ]: With dead ends: 180 [2018-06-22 11:57:07,379 INFO ]: Without dead ends: 176 [2018-06-22 11:57:07,379 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=2438, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:57:07,379 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 11:57:07,384 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 148. [2018-06-22 11:57:07,384 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 11:57:07,385 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 212 transitions. [2018-06-22 11:57:07,385 INFO ]: Start accepts. Automaton has 148 states and 212 transitions. Word has length 77 [2018-06-22 11:57:07,385 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:07,385 INFO ]: Abstraction has 148 states and 212 transitions. [2018-06-22 11:57:07,385 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:57:07,385 INFO ]: Start isEmpty. Operand 148 states and 212 transitions. [2018-06-22 11:57:07,386 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:57:07,386 INFO ]: Found error trace [2018-06-22 11:57:07,386 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:07,386 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:07,386 INFO ]: Analyzing trace with hash -574973337, now seen corresponding path program 7 times [2018-06-22 11:57:07,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:07,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:07,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:07,387 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:07,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:07,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:07,733 INFO ]: Checked inductivity of 188 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:57:07,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:07,733 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:07,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:07,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:07,790 INFO ]: Computing forward predicates... [2018-06-22 11:57:08,038 INFO ]: Checked inductivity of 188 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:57:08,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:08,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2018-06-22 11:57:08,057 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:57:08,057 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:57:08,057 INFO ]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:57:08,058 INFO ]: Start difference. First operand 148 states and 212 transitions. Second operand 26 states. [2018-06-22 11:57:08,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:08,439 INFO ]: Finished difference Result 274 states and 394 transitions. [2018-06-22 11:57:08,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:57:08,439 INFO ]: Start accepts. Automaton has 26 states. Word has length 81 [2018-06-22 11:57:08,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:08,440 INFO ]: With dead ends: 274 [2018-06-22 11:57:08,440 INFO ]: Without dead ends: 266 [2018-06-22 11:57:08,440 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:57:08,440 INFO ]: Start minimizeSevpa. Operand 266 states. [2018-06-22 11:57:08,445 INFO ]: Finished minimizeSevpa. Reduced states from 266 to 174. [2018-06-22 11:57:08,445 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-22 11:57:08,445 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 242 transitions. [2018-06-22 11:57:08,445 INFO ]: Start accepts. Automaton has 174 states and 242 transitions. Word has length 81 [2018-06-22 11:57:08,445 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:08,445 INFO ]: Abstraction has 174 states and 242 transitions. [2018-06-22 11:57:08,445 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:57:08,445 INFO ]: Start isEmpty. Operand 174 states and 242 transitions. [2018-06-22 11:57:08,446 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:57:08,446 INFO ]: Found error trace [2018-06-22 11:57:08,446 INFO ]: trace histogram [7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:08,446 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:08,446 INFO ]: Analyzing trace with hash 1629364508, now seen corresponding path program 7 times [2018-06-22 11:57:08,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:08,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:08,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:08,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:08,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:08,453 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:09,194 INFO ]: Checked inductivity of 176 backedges. 41 proven. 34 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-22 11:57:09,194 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:09,194 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:09,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:09,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:09,243 INFO ]: Computing forward predicates... [2018-06-22 11:57:09,615 INFO ]: Checked inductivity of 176 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-06-22 11:57:09,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:09,634 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 27 [2018-06-22 11:57:09,634 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:57:09,634 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:57:09,634 INFO ]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:57:09,634 INFO ]: Start difference. First operand 174 states and 242 transitions. Second operand 27 states. [2018-06-22 11:57:10,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:10,121 INFO ]: Finished difference Result 218 states and 313 transitions. [2018-06-22 11:57:10,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:57:10,181 INFO ]: Start accepts. Automaton has 27 states. Word has length 81 [2018-06-22 11:57:10,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:10,181 INFO ]: With dead ends: 218 [2018-06-22 11:57:10,181 INFO ]: Without dead ends: 218 [2018-06-22 11:57:10,182 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=234, Invalid=1836, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:57:10,182 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-22 11:57:10,187 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 158. [2018-06-22 11:57:10,187 INFO ]: Start removeUnreachable. Operand 158 states. [2018-06-22 11:57:10,187 INFO ]: Finished removeUnreachable. Reduced from 158 states to 158 states and 221 transitions. [2018-06-22 11:57:10,187 INFO ]: Start accepts. Automaton has 158 states and 221 transitions. Word has length 81 [2018-06-22 11:57:10,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:10,188 INFO ]: Abstraction has 158 states and 221 transitions. [2018-06-22 11:57:10,188 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:57:10,188 INFO ]: Start isEmpty. Operand 158 states and 221 transitions. [2018-06-22 11:57:10,189 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:57:10,189 INFO ]: Found error trace [2018-06-22 11:57:10,189 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:10,189 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:10,189 INFO ]: Analyzing trace with hash -864010122, now seen corresponding path program 6 times [2018-06-22 11:57:10,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:10,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:10,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:10,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:10,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:10,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:10,421 INFO ]: Checked inductivity of 206 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-06-22 11:57:10,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:10,421 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:10,430 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:10,487 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:57:10,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:10,490 INFO ]: Computing forward predicates... [2018-06-22 11:57:10,829 INFO ]: Checked inductivity of 206 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-22 11:57:10,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:10,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 29 [2018-06-22 11:57:10,860 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:57:10,861 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:57:10,861 INFO ]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:57:10,861 INFO ]: Start difference. First operand 158 states and 221 transitions. Second operand 29 states. [2018-06-22 11:57:11,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:11,501 INFO ]: Finished difference Result 292 states and 386 transitions. [2018-06-22 11:57:11,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:57:11,502 INFO ]: Start accepts. Automaton has 29 states. Word has length 85 [2018-06-22 11:57:11,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:11,502 INFO ]: With dead ends: 292 [2018-06-22 11:57:11,502 INFO ]: Without dead ends: 206 [2018-06-22 11:57:11,503 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=2144, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:57:11,503 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-22 11:57:11,506 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 196. [2018-06-22 11:57:11,507 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-22 11:57:11,507 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2018-06-22 11:57:11,507 INFO ]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 85 [2018-06-22 11:57:11,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:11,507 INFO ]: Abstraction has 196 states and 265 transitions. [2018-06-22 11:57:11,507 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:57:11,507 INFO ]: Start isEmpty. Operand 196 states and 265 transitions. [2018-06-22 11:57:11,509 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:57:11,509 INFO ]: Found error trace [2018-06-22 11:57:11,509 INFO ]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:11,509 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:11,509 INFO ]: Analyzing trace with hash -1923965703, now seen corresponding path program 10 times [2018-06-22 11:57:11,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:11,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:11,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:11,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:11,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:11,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:11,921 INFO ]: Checked inductivity of 205 backedges. 42 proven. 45 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 11:57:11,921 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:11,921 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:11,926 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:11,972 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:11,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:11,974 INFO ]: Computing forward predicates... [2018-06-22 11:57:12,069 INFO ]: Checked inductivity of 205 backedges. 42 proven. 45 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 11:57:12,088 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:12,088 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2018-06-22 11:57:12,088 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:57:12,088 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:57:12,088 INFO ]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:57:12,089 INFO ]: Start difference. First operand 196 states and 265 transitions. Second operand 28 states. [2018-06-22 11:57:12,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:12,575 INFO ]: Finished difference Result 234 states and 322 transitions. [2018-06-22 11:57:12,575 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:57:12,575 INFO ]: Start accepts. Automaton has 28 states. Word has length 85 [2018-06-22 11:57:12,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:12,576 INFO ]: With dead ends: 234 [2018-06-22 11:57:12,576 INFO ]: Without dead ends: 228 [2018-06-22 11:57:12,576 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:57:12,576 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-22 11:57:12,580 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 202. [2018-06-22 11:57:12,580 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 11:57:12,580 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 272 transitions. [2018-06-22 11:57:12,581 INFO ]: Start accepts. Automaton has 202 states and 272 transitions. Word has length 85 [2018-06-22 11:57:12,581 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:12,581 INFO ]: Abstraction has 202 states and 272 transitions. [2018-06-22 11:57:12,581 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:57:12,581 INFO ]: Start isEmpty. Operand 202 states and 272 transitions. [2018-06-22 11:57:12,582 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:57:12,582 INFO ]: Found error trace [2018-06-22 11:57:12,582 INFO ]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:12,582 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:12,582 INFO ]: Analyzing trace with hash -1990818599, now seen corresponding path program 8 times [2018-06-22 11:57:12,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:12,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:12,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:12,583 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:12,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:12,594 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:57:12,647 WARN ]: Removed 1 from assertion stack [2018-06-22 11:57:12,647 WARN ]: Verification canceled [2018-06-22 11:57:12,652 WARN ]: Timeout [2018-06-22 11:57:12,652 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:57:12 BoogieIcfgContainer [2018-06-22 11:57:12,652 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:57:12,653 INFO ]: Toolchain (without parser) took 54546.73 ms. Allocated memory was 304.1 MB in the beginning and 777.0 MB in the end (delta: 472.9 MB). Free memory was 258.5 MB in the beginning and 663.5 MB in the end (delta: -405.0 MB). Peak memory consumption was 67.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:12,654 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:57:12,654 INFO ]: ChcToBoogie took 51.91 ms. Allocated memory is still 304.1 MB. Free memory was 258.5 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:12,654 INFO ]: Boogie Preprocessor took 46.89 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 255.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:57:12,655 INFO ]: RCFGBuilder took 378.96 ms. Allocated memory is still 304.1 MB. Free memory was 255.4 MB in the beginning and 243.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:12,656 INFO ]: TraceAbstraction took 54052.91 ms. Allocated memory was 304.1 MB in the beginning and 777.0 MB in the end (delta: 472.9 MB). Free memory was 243.5 MB in the beginning and 663.5 MB in the end (delta: -420.1 MB). Peak memory consumption was 52.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:12,658 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.91 ms. Allocated memory is still 304.1 MB. Free memory was 258.5 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.89 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 255.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 378.96 ms. Allocated memory is still 304.1 MB. Free memory was 255.4 MB in the beginning and 243.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54052.91 ms. Allocated memory was 304.1 MB in the beginning and 777.0 MB in the end (delta: 472.9 MB). Free memory was 243.5 MB in the beginning and 663.5 MB in the end (delta: -420.1 MB). Peak memory consumption was 52.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 7, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. TIMEOUT Result, 53.9s OverallTime, 60 OverallIterations, 8 TraceHistogramMax, 26.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2293 SDtfs, 704 SDslu, 18181 SDs, 0 SdLazy, 21977 SolverSat, 1820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3601 GetRequests, 2174 SyntacticMatches, 13 SemanticMatches, 1414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=59, 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: 0.5s AutomataMinimizationTime, 59 MinimizatonAttempts, 1268 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 4862 NumberOfCodeBlocks, 4844 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 4760 ConstructedInterpolants, 14 QuantifiedInterpolants, 721988 SizeOfPredicates, 367 NumberOfNonLiveVariables, 12911 ConjunctsInSsa, 1122 ConjunctsInUnsatCore, 102 InterpolantComputations, 16 PerfectInterpolantSequences, 5018/6378 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-57-12-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-57-12-671.csv Completed graceful shutdown