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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:20:33,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:20:33,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:20:33,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:20:33,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:20:33,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:20:33,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:20:33,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:20:33,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:20:33,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:20:33,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:20:33,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:20:33,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:20:33,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:20:33,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:20:33,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:20:33,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:20:33,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:20:33,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:20:33,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:20:33,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:20:33,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:20:33,710 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:20:33,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:20:33,711 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:20:33,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:20:33,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:20:33,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:20:33,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:20:33,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:20:33,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:20:33,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:20:33,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:20:33,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:20:33,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:20:33,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:20:33,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:20:33,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:20:33,745 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:20:33,745 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:20:33,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:20:33,746 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:20:33,746 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:20:33,746 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:20:33,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:20:33,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:20:33,748 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:20:33,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:20:33,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:20:33,748 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:20:33,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:20:33,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:20:33,749 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:20:33,750 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:20:33,750 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:20:33,805 INFO ]: Repository-Root is: /tmp [2018-06-22 01:20:33,821 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:20:33,826 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:20:33,827 INFO ]: Initializing SmtParser... [2018-06-22 01:20:33,827 INFO ]: SmtParser initialized [2018-06-22 01:20:33,828 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 [2018-06-22 01:20:33,829 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 01:20:33,920 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 unknown [2018-06-22 01:20:34,094 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004b-horn.smt2 [2018-06-22 01:20:34,104 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:20:34,110 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:20:34,111 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:20:34,111 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:20:34,111 INFO ]: ChcToBoogie initialized [2018-06-22 01:20:34,115 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,175 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34 Unit [2018-06-22 01:20:34,175 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:20:34,176 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:20:34,176 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:20:34,176 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:20:34,196 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,196 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,201 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,202 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,204 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,206 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,208 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (1/1) ... [2018-06-22 01:20:34,209 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:20:34,210 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:20:34,210 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:20:34,210 INFO ]: RCFGBuilder initialized [2018-06-22 01:20:34,211 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (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 01:20:34,223 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:20:34,223 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:20:34,223 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:20:34,223 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:20:34,223 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:20:34,223 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 01:20:34,442 INFO ]: Using library mode [2018-06-22 01:20:34,442 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:20:34 BoogieIcfgContainer [2018-06-22 01:20:34,442 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:20:34,443 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:20:34,443 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:20:34,455 INFO ]: TraceAbstraction initialized [2018-06-22 01:20:34,455 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:20:34" (1/3) ... [2018-06-22 01:20:34,456 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b36f173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:20:34, skipping insertion in model container [2018-06-22 01:20:34,456 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:34" (2/3) ... [2018-06-22 01:20:34,456 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b36f173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:20:34, skipping insertion in model container [2018-06-22 01:20:34,456 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:20:34" (3/3) ... [2018-06-22 01:20:34,458 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:20:34,467 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:20:34,475 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:20:34,520 INFO ]: Using default assertion order modulation [2018-06-22 01:20:34,521 INFO ]: Interprodecural is true [2018-06-22 01:20:34,521 INFO ]: Hoare is false [2018-06-22 01:20:34,521 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:20:34,521 INFO ]: Backedges is TWOTRACK [2018-06-22 01:20:34,521 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:20:34,521 INFO ]: Difference is false [2018-06-22 01:20:34,521 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:20:34,521 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:20:34,540 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:20:34,549 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:20:34,549 INFO ]: Found error trace [2018-06-22 01:20:34,550 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:34,550 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:34,555 INFO ]: Analyzing trace with hash -204902306, now seen corresponding path program 1 times [2018-06-22 01:20:34,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:34,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:34,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:34,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:34,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:34,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:34,718 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:34,720 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:20:34,721 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:20:34,722 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:20:34,736 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:20:34,736 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:34,738 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:20:34,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:34,795 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 01:20:34,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:20:34,796 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:20:34,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:34,804 INFO ]: With dead ends: 9 [2018-06-22 01:20:34,804 INFO ]: Without dead ends: 9 [2018-06-22 01:20:34,808 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:34,822 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:20:34,847 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:20:34,848 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:20:34,849 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:20:34,850 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 01:20:34,850 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:34,850 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:20:34,850 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:20:34,850 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:20:34,851 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:20:34,851 INFO ]: Found error trace [2018-06-22 01:20:34,851 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:34,851 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:34,851 INFO ]: Analyzing trace with hash -2054566951, now seen corresponding path program 1 times [2018-06-22 01:20:34,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:34,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:34,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:34,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:34,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:34,881 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:35,019 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:35,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:35,019 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) [2018-06-22 01:20:35,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:35,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:35,097 INFO ]: Computing forward predicates... [2018-06-22 01:20:35,186 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:35,206 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:35,206 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 01:20:35,207 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:20:35,207 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:20:35,208 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:20:35,208 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2018-06-22 01:20:35,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:35,521 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-22 01:20:35,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:20:35,521 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 01:20:35,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:35,522 INFO ]: With dead ends: 12 [2018-06-22 01:20:35,522 INFO ]: Without dead ends: 12 [2018-06-22 01:20:35,523 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:20:35,523 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:20:35,524 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:20:35,524 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:20:35,525 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-22 01:20:35,525 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-22 01:20:35,525 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:35,525 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-22 01:20:35,525 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:20:35,525 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-22 01:20:35,526 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:20:35,526 INFO ]: Found error trace [2018-06-22 01:20:35,526 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:35,526 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:35,527 INFO ]: Analyzing trace with hash -2049025825, now seen corresponding path program 1 times [2018-06-22 01:20:35,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:35,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:35,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:35,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:35,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:35,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:35,857 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-22 01:20:35,930 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:35,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:35,930 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 01:20:35,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:35,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:35,964 INFO ]: Computing forward predicates... [2018-06-22 01:20:36,044 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:36,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:36,063 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 01:20:36,063 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:20:36,063 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:20:36,063 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:20:36,063 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 6 states. [2018-06-22 01:20:36,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:36,155 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-22 01:20:36,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:20:36,155 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 01:20:36,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:36,155 INFO ]: With dead ends: 13 [2018-06-22 01:20:36,155 INFO ]: Without dead ends: 13 [2018-06-22 01:20:36,156 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:20:36,156 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:20:36,158 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:20:36,158 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:20:36,158 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-06-22 01:20:36,158 INFO ]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-06-22 01:20:36,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:36,158 INFO ]: Abstraction has 13 states and 23 transitions. [2018-06-22 01:20:36,158 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:20:36,158 INFO ]: Start isEmpty. Operand 13 states and 23 transitions. [2018-06-22 01:20:36,159 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:20:36,159 INFO ]: Found error trace [2018-06-22 01:20:36,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:36,159 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:36,159 INFO ]: Analyzing trace with hash 907146104, now seen corresponding path program 1 times [2018-06-22 01:20:36,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:36,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:36,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:36,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:36,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:36,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:36,509 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-06-22 01:20:36,538 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:36,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:36,538 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 01:20:36,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:36,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:36,581 INFO ]: Computing forward predicates... [2018-06-22 01:20:36,962 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:36,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:36,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:20:36,996 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:20:36,996 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:20:36,996 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:20:36,996 INFO ]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-06-22 01:20:37,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:37,262 INFO ]: Finished difference Result 14 states and 26 transitions. [2018-06-22 01:20:37,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:20:37,263 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:20:37,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:37,263 INFO ]: With dead ends: 14 [2018-06-22 01:20:37,263 INFO ]: Without dead ends: 14 [2018-06-22 01:20:37,265 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:20:37,265 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:20:37,266 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:20:37,266 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:20:37,266 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-06-22 01:20:37,266 INFO ]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 9 [2018-06-22 01:20:37,267 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:37,267 INFO ]: Abstraction has 14 states and 26 transitions. [2018-06-22 01:20:37,267 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:20:37,267 INFO ]: Start isEmpty. Operand 14 states and 26 transitions. [2018-06-22 01:20:37,267 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:20:37,267 INFO ]: Found error trace [2018-06-22 01:20:37,267 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:37,267 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:37,267 INFO ]: Analyzing trace with hash 912687230, now seen corresponding path program 2 times [2018-06-22 01:20:37,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:37,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:37,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:37,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:37,320 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:37,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:20:37,320 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:20:37,320 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:20:37,320 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:20:37,320 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:20:37,320 INFO ]: Start difference. First operand 14 states and 26 transitions. Second operand 4 states. [2018-06-22 01:20:37,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:37,347 INFO ]: Finished difference Result 18 states and 36 transitions. [2018-06-22 01:20:37,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:20:37,348 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:20:37,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:37,348 INFO ]: With dead ends: 18 [2018-06-22 01:20:37,348 INFO ]: Without dead ends: 14 [2018-06-22 01:20:37,348 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:20:37,348 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:20:37,350 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:20:37,350 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:20:37,350 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-22 01:20:37,350 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 9 [2018-06-22 01:20:37,350 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:37,350 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-22 01:20:37,350 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:20:37,350 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-22 01:20:37,351 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:20:37,351 INFO ]: Found error trace [2018-06-22 01:20:37,351 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:37,351 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:37,351 INFO ]: Analyzing trace with hash 1329649023, now seen corresponding path program 2 times [2018-06-22 01:20:37,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:37,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:37,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:37,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:37,408 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:37,408 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:20:37,408 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:20:37,408 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:20:37,409 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:20:37,409 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:20:37,409 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 4 states. [2018-06-22 01:20:37,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:37,424 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-22 01:20:37,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:20:37,425 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:20:37,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:37,425 INFO ]: With dead ends: 16 [2018-06-22 01:20:37,425 INFO ]: Without dead ends: 11 [2018-06-22 01:20:37,425 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:20:37,425 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:20:37,426 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:20:37,426 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:20:37,427 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-22 01:20:37,427 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 10 [2018-06-22 01:20:37,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:37,427 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-22 01:20:37,427 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:20:37,427 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-22 01:20:37,427 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:20:37,427 INFO ]: Found error trace [2018-06-22 01:20:37,427 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:37,427 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:37,427 INFO ]: Analyzing trace with hash -1940804609, now seen corresponding path program 3 times [2018-06-22 01:20:37,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:37,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:37,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,428 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:37,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:37,546 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:37,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:37,546 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 01:20:37,554 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:37,591 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:20:37,592 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:37,594 INFO ]: Computing forward predicates... [2018-06-22 01:20:37,613 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:37,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:37,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:20:37,638 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:20:37,639 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:20:37,639 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:20:37,639 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-06-22 01:20:37,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:37,704 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-22 01:20:37,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:20:37,706 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:20:37,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:37,706 INFO ]: With dead ends: 12 [2018-06-22 01:20:37,706 INFO ]: Without dead ends: 12 [2018-06-22 01:20:37,707 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 2 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 01:20:37,707 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:20:37,708 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:20:37,708 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:20:37,708 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-22 01:20:37,708 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-22 01:20:37,708 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:37,708 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-22 01:20:37,708 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:20:37,708 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-22 01:20:37,708 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:20:37,708 INFO ]: Found error trace [2018-06-22 01:20:37,708 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:37,708 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:37,709 INFO ]: Analyzing trace with hash -32963496, now seen corresponding path program 4 times [2018-06-22 01:20:37,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:37,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:37,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,709 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:37,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:37,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:38,035 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:38,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:38,035 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:38,041 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:38,061 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:38,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:38,063 INFO ]: Computing forward predicates... [2018-06-22 01:20:38,139 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:38,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:38,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:20:38,162 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:20:38,162 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:20:38,162 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:20:38,162 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-06-22 01:20:38,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:38,486 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-22 01:20:38,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:20:38,486 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:20:38,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:38,486 INFO ]: With dead ends: 13 [2018-06-22 01:20:38,486 INFO ]: Without dead ends: 13 [2018-06-22 01:20:38,487 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:20:38,487 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:20:38,488 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:20:38,488 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:20:38,488 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-22 01:20:38,488 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-22 01:20:38,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:38,488 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-22 01:20:38,488 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:20:38,489 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-22 01:20:38,489 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:20:38,489 INFO ]: Found error trace [2018-06-22 01:20:38,489 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:38,489 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:38,489 INFO ]: Analyzing trace with hash -1019431137, now seen corresponding path program 5 times [2018-06-22 01:20:38,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:38,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:38,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:38,490 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:38,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:38,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:38,872 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:20:39,046 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:20:39,094 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:39,094 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:39,094 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 01:20:39,112 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:20:39,189 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:20:39,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:39,192 INFO ]: Computing forward predicates... [2018-06-22 01:20:39,544 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:39,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:39,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:20:39,573 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:20:39,573 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:20:39,573 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:20:39,574 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 14 states. [2018-06-22 01:20:39,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:39,791 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-22 01:20:39,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:20:39,791 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 01:20:39,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:39,791 INFO ]: With dead ends: 14 [2018-06-22 01:20:39,792 INFO ]: Without dead ends: 14 [2018-06-22 01:20:39,792 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:20:39,792 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:20:39,794 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:20:39,794 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:20:39,794 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-22 01:20:39,794 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-22 01:20:39,794 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:39,794 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-22 01:20:39,794 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:20:39,794 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-22 01:20:39,795 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:20:39,795 INFO ]: Found error trace [2018-06-22 01:20:39,795 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:39,795 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:39,795 INFO ]: Analyzing trace with hash -1535156936, now seen corresponding path program 6 times [2018-06-22 01:20:39,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:39,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:39,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:39,796 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:39,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:39,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:40,101 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:40,101 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:40,101 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 01:20:40,112 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:20:40,140 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:20:40,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:40,143 INFO ]: Computing forward predicates... [2018-06-22 01:20:42,265 WARN ]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 01:20:51,725 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV1_2_Int_26 Int) (v_gotoProc_hhv_INV1_2_Int_26 Int)) (let ((.cse1 (+ (* 3 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 1)) (.cse0 (+ v_gotoProc_hbv_INV1_2_Int_26 2))) (and (<= .cse0 c_gotoProc_hhv_INV1_3_Int) (<= .cse1 v_gotoProc_hhv_INV1_2_Int_26) (<= v_gotoProc_hhv_INV1_2_Int_26 .cse1) (<= c_gotoProc_hhv_INV1_3_Int .cse0) (not (= (* 3 v_gotoProc_hhv_INV1_2_Int_26) (+ (* 6 c_gotoProc_hhv_INV1_1_Int) (* 2 c_gotoProc_hhv_INV1_2_Int) (* 2 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_5_Int (* 3 v_gotoProc_hbv_INV1_2_Int_26) 7)))))) is different from true [2018-06-22 01:20:51,730 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 6 not checked. [2018-06-22 01:20:51,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:51,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:20:51,750 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:20:51,750 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:20:51,751 INFO ]: CoverageRelationStatistics Valid=32, Invalid=169, Unknown=13, NotChecked=26, Total=240 [2018-06-22 01:20:51,751 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 16 states. [2018-06-22 01:20:56,542 WARN ]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-22 01:20:57,223 WARN ]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-22 01:21:00,160 WARN ]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-06-22 01:21:00,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:00,344 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-22 01:21:00,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:21:00,344 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:21:00,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:00,345 INFO ]: With dead ends: 15 [2018-06-22 01:21:00,345 INFO ]: Without dead ends: 15 [2018-06-22 01:21:00,345 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=47, Invalid=285, Unknown=14, NotChecked=34, Total=380 [2018-06-22 01:21:00,345 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:21:00,347 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:21:00,347 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:21:00,347 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-22 01:21:00,347 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-22 01:21:00,347 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:00,347 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-22 01:21:00,347 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:21:00,347 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-22 01:21:00,348 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:21:00,348 INFO ]: Found error trace [2018-06-22 01:21:00,348 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:00,348 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:00,348 INFO ]: Analyzing trace with hash -342787521, now seen corresponding path program 7 times [2018-06-22 01:21:00,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:00,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:00,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:00,349 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:00,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:00,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:00,516 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:00,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:00,517 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) [2018-06-22 01:21:00,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:00,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:00,576 INFO ]: Computing forward predicates... [2018-06-22 01:21:00,606 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:00,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:00,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:21:00,630 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:21:00,630 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:21:00,630 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:21:00,630 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-06-22 01:21:00,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:00,732 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-22 01:21:00,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:21:00,732 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 01:21:00,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:00,733 INFO ]: With dead ends: 16 [2018-06-22 01:21:00,733 INFO ]: Without dead ends: 16 [2018-06-22 01:21:00,733 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:21:00,733 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:21:00,734 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:21:00,734 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:21:00,734 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-22 01:21:00,734 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-22 01:21:00,734 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:00,734 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-22 01:21:00,734 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:21:00,734 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-22 01:21:00,735 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:21:00,735 INFO ]: Found error trace [2018-06-22 01:21:00,735 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:00,735 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:00,735 INFO ]: Analyzing trace with hash -2034041320, now seen corresponding path program 8 times [2018-06-22 01:21:00,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:00,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:00,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:00,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:00,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:00,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:01,757 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:01,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:01,757 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 01:21:01,763 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:21:01,821 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:21:01,821 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:01,827 INFO ]: Computing forward predicates... [2018-06-22 01:21:02,490 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:02,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:02,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 01:21:02,510 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:21:02,510 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:21:02,510 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:21:02,510 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 20 states. [2018-06-22 01:21:02,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:02,881 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-22 01:21:02,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:21:02,881 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-22 01:21:02,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:02,881 INFO ]: With dead ends: 17 [2018-06-22 01:21:02,881 INFO ]: Without dead ends: 17 [2018-06-22 01:21:02,882 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:21:02,882 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:21:02,883 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:21:02,883 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:21:02,883 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-22 01:21:02,883 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-22 01:21:02,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:02,883 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-22 01:21:02,883 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:21:02,883 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-22 01:21:02,884 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:21:02,884 INFO ]: Found error trace [2018-06-22 01:21:02,884 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:02,884 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:02,884 INFO ]: Analyzing trace with hash 1371665759, now seen corresponding path program 9 times [2018-06-22 01:21:02,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:02,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:02,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:02,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:02,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:02,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:03,221 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:03,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:03,221 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:21:03,228 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:21:03,268 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:21:03,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:03,274 INFO ]: Computing forward predicates... [2018-06-22 01:21:03,726 WARN ]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 01:21:13,447 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV1_5_Int_48 Int) (v_gotoProc_hhv_INV1_2_Int_47 Int)) (let ((.cse1 (+ (* 2 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int)) (.cse0 (+ v_gotoProc_hhv_INV1_2_Int_47 1)) (.cse3 (+ c_gotoProc_hhv_INV1_4_Int c_gotoProc_hhv_INV1_3_Int c_gotoProc_hhv_INV1_5_Int)) (.cse2 (+ v_gotoProc_hhv_INV1_5_Int_48 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (not (= (+ (* 4 c_gotoProc_hhv_INV1_1_Int) (* 2 c_gotoProc_hhv_INV1_2_Int) (* 3 v_gotoProc_hhv_INV1_5_Int_48) 2) (+ (* 2 c_gotoProc_hhv_INV1_4_Int) (* 2 c_gotoProc_hhv_INV1_5_Int) (* 3 v_gotoProc_hhv_INV1_2_Int_47)))) (<= .cse2 .cse3) (<= .cse3 .cse2)))) is different from true [2018-06-22 01:21:13,888 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV1_5_Int_48 Int) (v_gotoProc_hhv_INV1_2_Int_47 Int)) (let ((.cse2 (+ (* 3 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 1)) (.cse1 (+ (* 2 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_3_Int c_gotoProc_hhv_INV1_5_Int)) (.cse0 (+ v_gotoProc_hhv_INV1_5_Int_48 1))) (and (<= .cse0 .cse1) (<= v_gotoProc_hhv_INV1_2_Int_47 .cse2) (<= .cse2 v_gotoProc_hhv_INV1_2_Int_47) (<= .cse1 .cse0) (not (= (+ (* 6 c_gotoProc_hhv_INV1_1_Int) (* 2 c_gotoProc_hhv_INV1_2_Int) (* 3 v_gotoProc_hhv_INV1_5_Int_48) 4) (+ (* 4 c_gotoProc_hhv_INV1_4_Int) (* 3 v_gotoProc_hhv_INV1_2_Int_47) (* 2 c_gotoProc_hhv_INV1_5_Int))))))) is different from true [2018-06-22 01:21:14,367 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV1_5_Int_48 Int) (v_gotoProc_hhv_INV1_2_Int_47 Int)) (let ((.cse0 (+ (* 4 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 4)) (.cse1 (+ (* 3 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_3_Int c_gotoProc_hhv_INV1_5_Int 1))) (and (<= v_gotoProc_hhv_INV1_2_Int_47 .cse0) (<= .cse0 v_gotoProc_hhv_INV1_2_Int_47) (<= .cse1 v_gotoProc_hhv_INV1_5_Int_48) (<= v_gotoProc_hhv_INV1_5_Int_48 .cse1) (not (= (+ (* 8 c_gotoProc_hhv_INV1_1_Int) (* 2 c_gotoProc_hhv_INV1_2_Int) (* 3 v_gotoProc_hhv_INV1_5_Int_48) 6) (+ (* 6 c_gotoProc_hhv_INV1_4_Int) (* 3 v_gotoProc_hhv_INV1_2_Int_47) (* 2 c_gotoProc_hhv_INV1_5_Int))))))) is different from true [2018-06-22 01:21:14,691 WARN ]: unable to prove that (exists ((v_gotoProc_hhv_INV1_5_Int_48 Int) (v_gotoProc_hhv_INV1_2_Int_47 Int)) (let ((.cse1 (+ (* 5 c_gotoProc_hhv_INV1_1_Int) c_gotoProc_hhv_INV1_2_Int c_gotoProc_hhv_INV1_0_Int 8)) (.cse0 (+ (* 4 c_gotoProc_hhv_INV1_4_Int) c_gotoProc_hhv_INV1_3_Int c_gotoProc_hhv_INV1_5_Int 4))) (and (not (= (+ (* 8 c_gotoProc_hhv_INV1_4_Int) (* 2 c_gotoProc_hhv_INV1_5_Int) (* 3 v_gotoProc_hhv_INV1_2_Int_47)) (+ (* 10 c_gotoProc_hhv_INV1_1_Int) (* 2 c_gotoProc_hhv_INV1_2_Int) (* 3 v_gotoProc_hhv_INV1_5_Int_48) 8))) (<= v_gotoProc_hhv_INV1_5_Int_48 .cse0) (<= .cse1 v_gotoProc_hhv_INV1_2_Int_47) (<= v_gotoProc_hhv_INV1_2_Int_47 .cse1) (<= .cse0 v_gotoProc_hhv_INV1_5_Int_48)))) is different from true [2018-06-22 01:21:21,715 WARN ]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-22 01:21:21,718 INFO ]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2018-06-22 01:21:21,738 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:21,738 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 01:21:21,738 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:21:21,738 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:21:21,738 INFO ]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=16, NotChecked=140, Total=462 [2018-06-22 01:21:21,738 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 22 states. [2018-06-22 01:21:52,070 WARN ]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 59 Received shutdown request... [2018-06-22 01:21:53,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:21:53,527 WARN ]: Verification canceled [2018-06-22 01:21:53,532 WARN ]: Timeout [2018-06-22 01:21:53,532 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:21:53 BoogieIcfgContainer [2018-06-22 01:21:53,532 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:21:53,533 INFO ]: Toolchain (without parser) took 79427.88 ms. Allocated memory was 307.8 MB in the beginning and 401.1 MB in the end (delta: 93.3 MB). Free memory was 264.1 MB in the beginning and 360.6 MB in the end (delta: -96.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:21:53,534 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:21:53,534 INFO ]: ChcToBoogie took 64.70 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:21:53,534 INFO ]: Boogie Preprocessor took 33.50 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:21:53,535 INFO ]: RCFGBuilder took 232.41 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 252.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:21:53,535 INFO ]: TraceAbstraction took 79088.78 ms. Allocated memory was 307.8 MB in the beginning and 401.1 MB in the end (delta: 93.3 MB). Free memory was 252.2 MB in the beginning and 360.6 MB in the end (delta: -108.4 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:21:53,537 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.70 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.50 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 232.41 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 252.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 79088.78 ms. Allocated memory was 307.8 MB in the beginning and 401.1 MB in the end (delta: 93.3 MB). Free memory was 252.2 MB in the beginning and 360.6 MB in the end (delta: -108.4 MB). There was no memory consumed. 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 constructing difference of abstraction (17states) and interpolant automaton (currently 11 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 79.0s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 42.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 8 SDslu, 380 SDs, 0 SdLazy, 734 SolverSat, 43 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 54.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=12, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 235 ConstructedInterpolants, 14 QuantifiedInterpolants, 33823 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1872 ConjunctsInSsa, 863 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 9/341 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/004b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-21-53-550.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-21-53-550.csv Completed graceful shutdown