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/llreve-bench/smt2/faulty__add-horn!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:08:24,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:08:24,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:08:24,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:08:24,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:08:24,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:08:24,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:08:24,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:08:24,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:08:24,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:08:24,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:08:24,596 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:08:24,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:08:24,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:08:24,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:08:24,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:08:24,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:08:24,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:08:24,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:08:24,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:08:24,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:08:24,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:08:24,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:08:24,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:08:24,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:08:24,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:08:24,627 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:08:24,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:08:24,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:08:24,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:08:24,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:08:24,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:08:24,637 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:08:24,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:08:24,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:08:24,641 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:08:24,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:08:24,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:08:24,655 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:08:24,655 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:08:24,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:08:24,656 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:08:24,656 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:08:24,656 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:08:24,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:08:24,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:08:24,657 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:08:24,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:08:24,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:08:24,658 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:08:24,658 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:08:24,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:08:24,658 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:08:24,660 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:08:24,660 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:08:24,713 INFO ]: Repository-Root is: /tmp [2018-06-22 02:08:24,730 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:08:24,738 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:08:24,739 INFO ]: Initializing SmtParser... [2018-06-22 02:08:24,740 INFO ]: SmtParser initialized [2018-06-22 02:08:24,740 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-22 02:08:24,742 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 02:08:24,836 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2df7752c [2018-06-22 02:08:25,147 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-22 02:08:25,152 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:08:25,159 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:08:25,159 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:08:25,159 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:08:25,159 INFO ]: ChcToBoogie initialized [2018-06-22 02:08:25,162 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,235 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25 Unit [2018-06-22 02:08:25,235 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:08:25,236 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:08:25,236 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:08:25,236 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:08:25,258 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,258 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,266 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,266 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,289 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,293 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,295 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (1/1) ... [2018-06-22 02:08:25,303 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:08:25,304 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:08:25,304 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:08:25,304 INFO ]: RCFGBuilder initialized [2018-06-22 02:08:25,305 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (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 02:08:25,330 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:08:25,330 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:08:25,330 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:08:25,330 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:08:25,330 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:08:25,330 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 02:08:25,874 INFO ]: Using library mode [2018-06-22 02:08:25,875 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:08:25 BoogieIcfgContainer [2018-06-22 02:08:25,875 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:08:25,877 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:08:25,877 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:08:25,881 INFO ]: TraceAbstraction initialized [2018-06-22 02:08:25,881 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:08:25" (1/3) ... [2018-06-22 02:08:25,882 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7b0f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:08:25, skipping insertion in model container [2018-06-22 02:08:25,882 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:25" (2/3) ... [2018-06-22 02:08:25,882 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7b0f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:08:25, skipping insertion in model container [2018-06-22 02:08:25,882 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:08:25" (3/3) ... [2018-06-22 02:08:25,884 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:08:25,894 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:08:25,905 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:08:25,959 INFO ]: Using default assertion order modulation [2018-06-22 02:08:25,959 INFO ]: Interprodecural is true [2018-06-22 02:08:25,959 INFO ]: Hoare is false [2018-06-22 02:08:25,959 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:08:25,959 INFO ]: Backedges is TWOTRACK [2018-06-22 02:08:25,959 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:08:25,959 INFO ]: Difference is false [2018-06-22 02:08:25,959 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:08:25,959 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:08:25,974 INFO ]: Start isEmpty. Operand 33 states. [2018-06-22 02:08:25,987 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:08:25,987 INFO ]: Found error trace [2018-06-22 02:08:25,988 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:25,988 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:25,994 INFO ]: Analyzing trace with hash 871342129, now seen corresponding path program 1 times [2018-06-22 02:08:25,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:25,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:26,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:26,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:26,178 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:26,179 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:26,179 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:26,181 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:26,192 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:26,192 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:26,195 INFO ]: Start difference. First operand 33 states. Second operand 4 states. [2018-06-22 02:08:26,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:26,706 INFO ]: Finished difference Result 59 states and 123 transitions. [2018-06-22 02:08:26,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:26,707 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:08:26,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:26,720 INFO ]: With dead ends: 59 [2018-06-22 02:08:26,721 INFO ]: Without dead ends: 59 [2018-06-22 02:08:26,722 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:26,735 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 02:08:26,777 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-06-22 02:08:26,778 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 02:08:26,785 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 123 transitions. [2018-06-22 02:08:26,788 INFO ]: Start accepts. Automaton has 59 states and 123 transitions. Word has length 8 [2018-06-22 02:08:26,788 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:26,789 INFO ]: Abstraction has 59 states and 123 transitions. [2018-06-22 02:08:26,789 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:26,789 INFO ]: Start isEmpty. Operand 59 states and 123 transitions. [2018-06-22 02:08:26,793 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:08:26,793 INFO ]: Found error trace [2018-06-22 02:08:26,793 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:26,794 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:26,794 INFO ]: Analyzing trace with hash -244370113, now seen corresponding path program 1 times [2018-06-22 02:08:26,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:26,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:26,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:26,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:26,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:26,834 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:26,834 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:26,834 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:26,835 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:26,835 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:26,835 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:26,836 INFO ]: Start difference. First operand 59 states and 123 transitions. Second operand 4 states. [2018-06-22 02:08:27,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:27,367 INFO ]: Finished difference Result 87 states and 183 transitions. [2018-06-22 02:08:27,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:27,368 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:08:27,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:27,371 INFO ]: With dead ends: 87 [2018-06-22 02:08:27,371 INFO ]: Without dead ends: 87 [2018-06-22 02:08:27,372 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:27,373 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 02:08:27,386 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-22 02:08:27,386 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 02:08:27,389 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 183 transitions. [2018-06-22 02:08:27,389 INFO ]: Start accepts. Automaton has 87 states and 183 transitions. Word has length 9 [2018-06-22 02:08:27,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:27,390 INFO ]: Abstraction has 87 states and 183 transitions. [2018-06-22 02:08:27,390 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:27,390 INFO ]: Start isEmpty. Operand 87 states and 183 transitions. [2018-06-22 02:08:27,391 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:08:27,391 INFO ]: Found error trace [2018-06-22 02:08:27,391 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:27,391 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:27,391 INFO ]: Analyzing trace with hash -269930791, now seen corresponding path program 1 times [2018-06-22 02:08:27,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:27,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:27,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:27,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:27,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:27,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:27,422 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:27,422 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:27,422 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:27,422 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:27,422 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:27,422 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:27,422 INFO ]: Start difference. First operand 87 states and 183 transitions. Second operand 4 states. [2018-06-22 02:08:27,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:27,734 INFO ]: Finished difference Result 115 states and 243 transitions. [2018-06-22 02:08:27,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:27,734 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:08:27,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:27,739 INFO ]: With dead ends: 115 [2018-06-22 02:08:27,739 INFO ]: Without dead ends: 115 [2018-06-22 02:08:27,739 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:27,739 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 02:08:27,755 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-06-22 02:08:27,756 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 02:08:27,758 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 243 transitions. [2018-06-22 02:08:27,758 INFO ]: Start accepts. Automaton has 115 states and 243 transitions. Word has length 9 [2018-06-22 02:08:27,758 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:27,758 INFO ]: Abstraction has 115 states and 243 transitions. [2018-06-22 02:08:27,758 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:27,759 INFO ]: Start isEmpty. Operand 115 states and 243 transitions. [2018-06-22 02:08:27,761 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:08:27,761 INFO ]: Found error trace [2018-06-22 02:08:27,761 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:27,761 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:27,761 INFO ]: Analyzing trace with hash -2084598948, now seen corresponding path program 1 times [2018-06-22 02:08:27,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:27,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:27,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:27,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:27,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:27,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:27,914 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:27,914 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:27,914 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:08:27,914 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:27,914 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:27,914 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:27,915 INFO ]: Start difference. First operand 115 states and 243 transitions. Second operand 4 states. [2018-06-22 02:08:28,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:28,391 INFO ]: Finished difference Result 143 states and 303 transitions. [2018-06-22 02:08:28,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:28,392 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:08:28,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:28,396 INFO ]: With dead ends: 143 [2018-06-22 02:08:28,396 INFO ]: Without dead ends: 143 [2018-06-22 02:08:28,396 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:28,396 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 02:08:28,413 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-06-22 02:08:28,413 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 02:08:28,417 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 303 transitions. [2018-06-22 02:08:28,417 INFO ]: Start accepts. Automaton has 143 states and 303 transitions. Word has length 11 [2018-06-22 02:08:28,417 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:28,417 INFO ]: Abstraction has 143 states and 303 transitions. [2018-06-22 02:08:28,417 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:28,417 INFO ]: Start isEmpty. Operand 143 states and 303 transitions. [2018-06-22 02:08:28,420 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:28,420 INFO ]: Found error trace [2018-06-22 02:08:28,420 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:28,420 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:28,421 INFO ]: Analyzing trace with hash 297645782, now seen corresponding path program 1 times [2018-06-22 02:08:28,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:28,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:28,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:28,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:28,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:28,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:28,495 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:28,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:28,496 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:28,496 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:28,496 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:28,496 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:28,496 INFO ]: Start difference. First operand 143 states and 303 transitions. Second operand 3 states. [2018-06-22 02:08:28,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:28,606 INFO ]: Finished difference Result 178 states and 394 transitions. [2018-06-22 02:08:28,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:28,607 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:08:28,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:28,613 INFO ]: With dead ends: 178 [2018-06-22 02:08:28,614 INFO ]: Without dead ends: 178 [2018-06-22 02:08:28,614 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 02:08:28,614 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 02:08:28,635 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 148. [2018-06-22 02:08:28,635 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 02:08:28,639 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 308 transitions. [2018-06-22 02:08:28,639 INFO ]: Start accepts. Automaton has 148 states and 308 transitions. Word has length 12 [2018-06-22 02:08:28,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:28,639 INFO ]: Abstraction has 148 states and 308 transitions. [2018-06-22 02:08:28,639 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:28,639 INFO ]: Start isEmpty. Operand 148 states and 308 transitions. [2018-06-22 02:08:28,641 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:28,641 INFO ]: Found error trace [2018-06-22 02:08:28,641 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:28,641 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:28,641 INFO ]: Analyzing trace with hash -121334842, now seen corresponding path program 1 times [2018-06-22 02:08:28,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:28,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:28,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:28,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:28,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:28,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:28,820 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 8 [2018-06-22 02:08:28,821 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:28,821 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:28,821 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:28,821 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:28,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:28,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:28,821 INFO ]: Start difference. First operand 148 states and 308 transitions. Second operand 3 states. [2018-06-22 02:08:28,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:28,972 INFO ]: Finished difference Result 226 states and 512 transitions. [2018-06-22 02:08:28,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:28,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:08:28,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:28,982 INFO ]: With dead ends: 226 [2018-06-22 02:08:28,982 INFO ]: Without dead ends: 226 [2018-06-22 02:08:28,982 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:28,982 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-22 02:08:29,007 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 152. [2018-06-22 02:08:29,007 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-22 02:08:29,010 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 330 transitions. [2018-06-22 02:08:29,010 INFO ]: Start accepts. Automaton has 152 states and 330 transitions. Word has length 12 [2018-06-22 02:08:29,010 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:29,010 INFO ]: Abstraction has 152 states and 330 transitions. [2018-06-22 02:08:29,010 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:29,011 INFO ]: Start isEmpty. Operand 152 states and 330 transitions. [2018-06-22 02:08:29,013 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:29,013 INFO ]: Found error trace [2018-06-22 02:08:29,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:29,013 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:29,013 INFO ]: Analyzing trace with hash -130570052, now seen corresponding path program 1 times [2018-06-22 02:08:29,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:29,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:29,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:29,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:29,104 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:29,104 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:29,104 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:29,104 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:29,104 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:29,104 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:29,105 INFO ]: Start difference. First operand 152 states and 330 transitions. Second operand 3 states. [2018-06-22 02:08:29,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:29,226 INFO ]: Finished difference Result 200 states and 450 transitions. [2018-06-22 02:08:29,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:29,228 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:08:29,228 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:29,234 INFO ]: With dead ends: 200 [2018-06-22 02:08:29,234 INFO ]: Without dead ends: 200 [2018-06-22 02:08:29,235 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 02:08:29,235 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-22 02:08:29,266 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 150. [2018-06-22 02:08:29,266 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-22 02:08:29,276 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 317 transitions. [2018-06-22 02:08:29,276 INFO ]: Start accepts. Automaton has 150 states and 317 transitions. Word has length 12 [2018-06-22 02:08:29,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:29,276 INFO ]: Abstraction has 150 states and 317 transitions. [2018-06-22 02:08:29,276 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:29,276 INFO ]: Start isEmpty. Operand 150 states and 317 transitions. [2018-06-22 02:08:29,278 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:29,278 INFO ]: Found error trace [2018-06-22 02:08:29,278 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:29,278 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:29,278 INFO ]: Analyzing trace with hash 430811552, now seen corresponding path program 1 times [2018-06-22 02:08:29,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:29,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:29,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:29,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:29,393 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:29,393 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:29,393 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:29,393 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:29,393 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:29,394 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:29,394 INFO ]: Start difference. First operand 150 states and 317 transitions. Second operand 3 states. [2018-06-22 02:08:29,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:29,436 INFO ]: Finished difference Result 185 states and 422 transitions. [2018-06-22 02:08:29,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:29,437 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:08:29,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:29,449 INFO ]: With dead ends: 185 [2018-06-22 02:08:29,450 INFO ]: Without dead ends: 185 [2018-06-22 02:08:29,450 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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 02:08:29,450 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-22 02:08:29,466 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 155. [2018-06-22 02:08:29,466 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-22 02:08:29,469 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 322 transitions. [2018-06-22 02:08:29,469 INFO ]: Start accepts. Automaton has 155 states and 322 transitions. Word has length 12 [2018-06-22 02:08:29,469 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:29,469 INFO ]: Abstraction has 155 states and 322 transitions. [2018-06-22 02:08:29,469 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:29,469 INFO ]: Start isEmpty. Operand 155 states and 322 transitions. [2018-06-22 02:08:29,471 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:29,471 INFO ]: Found error trace [2018-06-22 02:08:29,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:29,472 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:29,472 INFO ]: Analyzing trace with hash 545328156, now seen corresponding path program 1 times [2018-06-22 02:08:29,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:29,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:29,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:29,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:29,553 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:29,553 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:29,553 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:29,553 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:29,553 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:29,553 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:29,554 INFO ]: Start difference. First operand 155 states and 322 transitions. Second operand 3 states. [2018-06-22 02:08:29,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:29,652 INFO ]: Finished difference Result 186 states and 419 transitions. [2018-06-22 02:08:29,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:29,653 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:08:29,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:29,656 INFO ]: With dead ends: 186 [2018-06-22 02:08:29,656 INFO ]: Without dead ends: 186 [2018-06-22 02:08:29,657 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 02:08:29,657 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 02:08:29,672 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 151. [2018-06-22 02:08:29,672 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 02:08:29,674 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 314 transitions. [2018-06-22 02:08:29,674 INFO ]: Start accepts. Automaton has 151 states and 314 transitions. Word has length 12 [2018-06-22 02:08:29,674 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:29,674 INFO ]: Abstraction has 151 states and 314 transitions. [2018-06-22 02:08:29,674 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:29,674 INFO ]: Start isEmpty. Operand 151 states and 314 transitions. [2018-06-22 02:08:29,679 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:08:29,679 INFO ]: Found error trace [2018-06-22 02:08:29,679 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:29,679 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:29,679 INFO ]: Analyzing trace with hash -134266193, now seen corresponding path program 1 times [2018-06-22 02:08:29,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:29,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:29,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:29,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:29,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:29,813 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:29,813 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:29,813 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 02:08:29,814 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:08:29,814 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:08:29,814 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:08:29,814 INFO ]: Start difference. First operand 151 states and 314 transitions. Second operand 6 states. [2018-06-22 02:08:31,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:31,477 INFO ]: Finished difference Result 312 states and 850 transitions. [2018-06-22 02:08:31,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:08:31,477 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-22 02:08:31,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:31,484 INFO ]: With dead ends: 312 [2018-06-22 02:08:31,484 INFO ]: Without dead ends: 276 [2018-06-22 02:08:31,485 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:08:31,485 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-22 02:08:31,512 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 161. [2018-06-22 02:08:31,512 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-22 02:08:31,513 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 349 transitions. [2018-06-22 02:08:31,513 INFO ]: Start accepts. Automaton has 161 states and 349 transitions. Word has length 20 [2018-06-22 02:08:31,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:31,514 INFO ]: Abstraction has 161 states and 349 transitions. [2018-06-22 02:08:31,514 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:08:31,514 INFO ]: Start isEmpty. Operand 161 states and 349 transitions. [2018-06-22 02:08:31,517 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:08:31,517 INFO ]: Found error trace [2018-06-22 02:08:31,517 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:31,517 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:31,518 INFO ]: Analyzing trace with hash 1890145955, now seen corresponding path program 1 times [2018-06-22 02:08:31,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:31,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:31,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:31,518 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:31,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:31,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:31,616 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:31,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:31,616 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 02:08:31,616 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:08:31,616 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:08:31,616 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:08:31,616 INFO ]: Start difference. First operand 161 states and 349 transitions. Second operand 6 states. [2018-06-22 02:08:31,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:31,914 INFO ]: Finished difference Result 250 states and 652 transitions. [2018-06-22 02:08:31,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:08:31,915 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-22 02:08:31,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:31,920 INFO ]: With dead ends: 250 [2018-06-22 02:08:31,920 INFO ]: Without dead ends: 250 [2018-06-22 02:08:31,920 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:08:31,920 INFO ]: Start minimizeSevpa. Operand 250 states. [2018-06-22 02:08:31,947 INFO ]: Finished minimizeSevpa. Reduced states from 250 to 169. [2018-06-22 02:08:31,947 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-22 02:08:31,949 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 388 transitions. [2018-06-22 02:08:31,950 INFO ]: Start accepts. Automaton has 169 states and 388 transitions. Word has length 20 [2018-06-22 02:08:31,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:31,951 INFO ]: Abstraction has 169 states and 388 transitions. [2018-06-22 02:08:31,951 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:08:31,951 INFO ]: Start isEmpty. Operand 169 states and 388 transitions. [2018-06-22 02:08:31,955 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:08:31,955 INFO ]: Found error trace [2018-06-22 02:08:31,955 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:31,957 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:31,958 INFO ]: Analyzing trace with hash 1758869927, now seen corresponding path program 1 times [2018-06-22 02:08:31,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:31,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:31,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:31,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:31,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:31,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:32,176 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:32,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:32,176 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 02:08:32,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:32,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:32,213 INFO ]: Computing forward predicates... [2018-06-22 02:08:32,241 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:32,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:32,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:08:32,265 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:08:32,266 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:08:32,266 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:32,266 INFO ]: Start difference. First operand 169 states and 388 transitions. Second operand 5 states. [2018-06-22 02:08:33,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:33,163 INFO ]: Finished difference Result 209 states and 545 transitions. [2018-06-22 02:08:33,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:08:33,163 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-22 02:08:33,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:33,168 INFO ]: With dead ends: 209 [2018-06-22 02:08:33,168 INFO ]: Without dead ends: 209 [2018-06-22 02:08:33,168 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 21 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 02:08:33,170 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-22 02:08:33,195 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 179. [2018-06-22 02:08:33,195 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-22 02:08:33,198 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 403 transitions. [2018-06-22 02:08:33,198 INFO ]: Start accepts. Automaton has 179 states and 403 transitions. Word has length 20 [2018-06-22 02:08:33,199 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:33,199 INFO ]: Abstraction has 179 states and 403 transitions. [2018-06-22 02:08:33,199 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:08:33,199 INFO ]: Start isEmpty. Operand 179 states and 403 transitions. [2018-06-22 02:08:33,203 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:08:33,203 INFO ]: Found error trace [2018-06-22 02:08:33,203 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:33,203 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:33,203 INFO ]: Analyzing trace with hash -263364573, now seen corresponding path program 1 times [2018-06-22 02:08:33,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:33,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:33,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:33,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:33,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:33,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:33,391 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:33,391 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:33,391 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) [2018-06-22 02:08:33,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:33,443 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:33,445 INFO ]: Computing forward predicates... [2018-06-22 02:08:33,454 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:08:33,487 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:33,487 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 02:08:33,488 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:08:33,488 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:08:33,488 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:08:33,488 INFO ]: Start difference. First operand 179 states and 403 transitions. Second operand 4 states. [2018-06-22 02:08:33,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:33,666 INFO ]: Finished difference Result 218 states and 594 transitions. [2018-06-22 02:08:33,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:33,666 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-22 02:08:33,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:33,669 INFO ]: With dead ends: 218 [2018-06-22 02:08:33,669 INFO ]: Without dead ends: 218 [2018-06-22 02:08:33,670 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 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 02:08:33,670 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-22 02:08:33,686 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 189. [2018-06-22 02:08:33,686 INFO ]: Start removeUnreachable. Operand 189 states. [2018-06-22 02:08:33,688 INFO ]: Finished removeUnreachable. Reduced from 189 states to 189 states and 433 transitions. [2018-06-22 02:08:33,688 INFO ]: Start accepts. Automaton has 189 states and 433 transitions. Word has length 20 [2018-06-22 02:08:33,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:33,688 INFO ]: Abstraction has 189 states and 433 transitions. [2018-06-22 02:08:33,688 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:08:33,688 INFO ]: Start isEmpty. Operand 189 states and 433 transitions. [2018-06-22 02:08:33,692 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:08:33,692 INFO ]: Found error trace [2018-06-22 02:08:33,692 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:33,692 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:33,692 INFO ]: Analyzing trace with hash -263632692, now seen corresponding path program 1 times [2018-06-22 02:08:33,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:33,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:33,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:33,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:33,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:33,700 INFO ]: Conjunction of SSA is sat [2018-06-22 02:08:33,701 INFO ]: Counterexample might be feasible [2018-06-22 02:08:33,717 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:08:33 BoogieIcfgContainer [2018-06-22 02:08:33,717 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:08:33,718 INFO ]: Toolchain (without parser) took 8565.55 ms. Allocated memory was 305.7 MB in the beginning and 368.1 MB in the end (delta: 62.4 MB). Free memory was 258.1 MB in the beginning and 320.9 MB in the end (delta: -62.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:08:33,719 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:08:33,720 INFO ]: ChcToBoogie took 76.67 ms. Allocated memory is still 305.7 MB. Free memory was 258.1 MB in the beginning and 256.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 02:08:33,720 INFO ]: Boogie Preprocessor took 67.18 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 254.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 02:08:33,721 INFO ]: RCFGBuilder took 571.25 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 235.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:08:33,721 INFO ]: TraceAbstraction took 7840.23 ms. Allocated memory was 305.7 MB in the beginning and 368.1 MB in the end (delta: 62.4 MB). Free memory was 235.1 MB in the beginning and 320.9 MB in the end (delta: -85.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:08:33,724 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 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.67 ms. Allocated memory is still 305.7 MB. Free memory was 258.1 MB in the beginning and 256.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 67.18 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 571.25 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 235.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7840.23 ms. Allocated memory was 305.7 MB in the beginning and 368.1 MB in the end (delta: 62.4 MB). Free memory was 235.1 MB in the beginning and 320.9 MB in the end (delta: -85.8 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 5) [L0] COND FALSE !(gotoSwitch == 3) [L0] COND FALSE !(gotoSwitch == 2) [L0] COND FALSE !(gotoSwitch == 1) [L0] assume (((!(hbv_False_5_Int == hbv_False_4_Int) && hbv_False_2_Int == 2) && hbv_False_3_Int == hbv_False_4_Int) && !(hbv_False_1_Int == 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int, hhv_INV_REC_f__1_2_Int := hbv_False_1_Int - 1, hbv_False_3_Int + 1, hbv_False_5_Int; [L0] havoc hbv_False_5_Int, hbv_False_2_Int, hbv_False_1_Int, hbv_False_4_Int, hbv_False_3_Int; [L0] assume !(hhv_INV_REC_f__1_0_Int == 0); [L0] CALL call gotoProc(5, hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND TRUE gotoSwitch == 5 [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int, hhv_INV_REC_f__1_2_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int; [L0] assume hhv_INV_REC_f__1_0_Int == 0 && hhv_INV_REC_f__1_2_Int == hhv_INV_REC_f__1_1_Int; [L0] hhv_INV_REC_f__1_PRE_0_Int, hhv_INV_REC_f__1_PRE_1_Int := hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int; [L0] assume ((((hhv_INV_REC_f__1_PRE_1_Int == hbv_INV_REC_f__1_PRE_3_Int + 1 && hhv_INV_REC_f__1_PRE_0_Int == hbv_INV_REC_f__1_PRE_1_Int - 1) && hbv_INV_REC_f__1_PRE_2_Int == 1) && hbv_INV_REC_f__1_PRE_1_Int == hbv_INV_REC_f__1_PRE_2_Int) && hbv_INV_REC_f__1_PRE_3_Int == hbv_INV_REC_f__1_PRE_4_Int) && !(hbv_INV_REC_f__1_PRE_1_Int == 0); [L0] RET call gotoProc(5, hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int, 0, 0, 0); [L0] hhv_INV_REC_f__1_PRE_0_Int, hhv_INV_REC_f__1_PRE_1_Int := hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int; [L0] assume ((((hhv_INV_REC_f__1_PRE_0_Int == hbv_INV_REC_f__1_PRE_1_Int - 1 && hhv_INV_REC_f__1_PRE_1_Int == hbv_INV_REC_f__1_PRE_3_Int + 1) && hbv_INV_REC_f__1_PRE_1_Int == hbv_INV_REC_f__1_PRE_2_Int) && hbv_INV_REC_f__1_PRE_2_Int == 2) && hbv_INV_REC_f__1_PRE_3_Int == hbv_INV_REC_f__1_PRE_4_Int) && !(hbv_INV_REC_f__1_PRE_1_Int == 0); [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. UNSAFE Result, 7.7s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1096 SDtfs, 864 SDslu, 1415 SDs, 0 SdLazy, 899 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=13, 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 474 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 4928 SizeOfPredicates, 6 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 28/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-08-33-735.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-08-33-735.csv Received shutdown request...