java -Xss4m -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-14921ce [2018-06-25 09:49:56,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:49:56,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:49:56,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:49:56,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:49:56,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:49:57,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:49:57,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:49:57,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:49:57,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:49:57,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:49:57,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:49:57,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:49:57,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:49:57,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:49:57,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:49:57,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:49:57,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:49:57,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:49:57,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:49:57,031 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:49:57,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:49:57,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:49:57,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:49:57,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:49:57,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:49:57,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:49:57,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:49:57,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:49:57,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:49:57,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:49:57,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:49:57,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:49:57,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:49:57,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:49:57,050 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:49:57,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:49:57,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:49:57,076 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:49:57,076 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:49:57,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:49:57,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:49:57,077 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:49:57,077 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:49:57,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:49:57,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:49:57,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:49:57,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:49:57,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:49:57,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:49:57,080 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:49:57,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:49:57,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:49:57,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:49:57,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:49:57,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:49:57,081 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:49:57,083 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:49:57,083 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:49:57,124 INFO ]: Repository-Root is: /tmp [2018-06-25 09:49:57,135 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:49:57,139 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:49:57,140 INFO ]: Initializing SmtParser... [2018-06-25 09:49:57,140 INFO ]: SmtParser initialized [2018-06-25 09:49:57,141 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-25 09:49:57,142 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-25 09:49:57,232 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@594f916b [2018-06-25 09:49:57,488 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-25 09:49:57,493 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:49:57,499 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:49:57,500 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:49:57,500 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:49:57,500 INFO ]: ChcToBoogie initialized [2018-06-25 09:49:57,503 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,578 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57 Unit [2018-06-25 09:49:57,578 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:49:57,579 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:49:57,579 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:49:57,579 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:49:57,601 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,601 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,608 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,608 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,630 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,634 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,636 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (1/1) ... [2018-06-25 09:49:57,647 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:49:57,648 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:49:57,648 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:49:57,648 INFO ]: RCFGBuilder initialized [2018-06-25 09:49:57,649 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (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-25 09:49:57,663 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:49:57,663 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:49:57,664 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:49:57,664 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:49:57,664 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:49:57,664 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-25 09:49:58,360 INFO ]: Using library mode [2018-06-25 09:49:58,361 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:49:58 BoogieIcfgContainer [2018-06-25 09:49:58,361 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:49:58,362 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:49:58,362 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:49:58,365 INFO ]: TraceAbstraction initialized [2018-06-25 09:49:58,366 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:49:57" (1/3) ... [2018-06-25 09:49:58,369 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53082ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:49:58, skipping insertion in model container [2018-06-25 09:49:58,369 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:49:57" (2/3) ... [2018-06-25 09:49:58,370 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53082ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:49:58, skipping insertion in model container [2018-06-25 09:49:58,370 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:49:58" (3/3) ... [2018-06-25 09:49:58,371 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:49:58,381 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:49:58,392 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:49:58,433 INFO ]: Using default assertion order modulation [2018-06-25 09:49:58,433 INFO ]: Interprodecural is true [2018-06-25 09:49:58,434 INFO ]: Hoare is false [2018-06-25 09:49:58,434 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:49:58,434 INFO ]: Backedges is TWOTRACK [2018-06-25 09:49:58,434 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:49:58,434 INFO ]: Difference is false [2018-06-25 09:49:58,434 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:49:58,434 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:49:58,449 INFO ]: Start isEmpty. Operand 33 states. [2018-06-25 09:49:58,462 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:49:58,462 INFO ]: Found error trace [2018-06-25 09:49:58,463 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:58,463 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:58,468 INFO ]: Analyzing trace with hash -55213047, now seen corresponding path program 1 times [2018-06-25 09:49:58,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:58,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:58,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:58,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:58,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:58,547 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:58,624 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:58,626 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:58,626 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:58,627 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:58,637 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:58,638 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:58,640 INFO ]: Start difference. First operand 33 states. Second operand 4 states. [2018-06-25 09:49:59,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:59,146 INFO ]: Finished difference Result 59 states and 123 transitions. [2018-06-25 09:49:59,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:59,147 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:49:59,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:59,160 INFO ]: With dead ends: 59 [2018-06-25 09:49:59,160 INFO ]: Without dead ends: 59 [2018-06-25 09:49:59,162 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-25 09:49:59,176 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:49:59,215 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-06-25 09:49:59,217 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-25 09:49:59,222 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 123 transitions. [2018-06-25 09:49:59,224 INFO ]: Start accepts. Automaton has 59 states and 123 transitions. Word has length 8 [2018-06-25 09:49:59,227 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:59,228 INFO ]: Abstraction has 59 states and 123 transitions. [2018-06-25 09:49:59,228 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:59,228 INFO ]: Start isEmpty. Operand 59 states and 123 transitions. [2018-06-25 09:49:59,230 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:49:59,230 INFO ]: Found error trace [2018-06-25 09:49:59,230 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:59,230 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:59,230 INFO ]: Analyzing trace with hash 878643724, now seen corresponding path program 1 times [2018-06-25 09:49:59,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:59,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:59,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:59,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:59,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:59,236 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:59,263 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:59,263 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:59,263 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:59,264 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:59,264 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:59,264 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:59,265 INFO ]: Start difference. First operand 59 states and 123 transitions. Second operand 4 states. [2018-06-25 09:49:59,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:49:59,809 INFO ]: Finished difference Result 87 states and 183 transitions. [2018-06-25 09:49:59,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:49:59,810 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:49:59,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:49:59,814 INFO ]: With dead ends: 87 [2018-06-25 09:49:59,815 INFO ]: Without dead ends: 87 [2018-06-25 09:49:59,818 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-25 09:49:59,818 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 09:49:59,832 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-25 09:49:59,832 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-25 09:49:59,835 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 183 transitions. [2018-06-25 09:49:59,836 INFO ]: Start accepts. Automaton has 87 states and 183 transitions. Word has length 9 [2018-06-25 09:49:59,836 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:49:59,836 INFO ]: Abstraction has 87 states and 183 transitions. [2018-06-25 09:49:59,836 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:49:59,836 INFO ]: Start isEmpty. Operand 87 states and 183 transitions. [2018-06-25 09:49:59,837 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:49:59,837 INFO ]: Found error trace [2018-06-25 09:49:59,837 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:49:59,837 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:49:59,837 INFO ]: Analyzing trace with hash 857432532, now seen corresponding path program 1 times [2018-06-25 09:49:59,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:49:59,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:49:59,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:59,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:49:59,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:49:59,846 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:49:59,901 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:49:59,901 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:49:59,901 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:49:59,901 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:49:59,902 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:49:59,902 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:49:59,902 INFO ]: Start difference. First operand 87 states and 183 transitions. Second operand 4 states. [2018-06-25 09:50:00,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:00,376 INFO ]: Finished difference Result 115 states and 243 transitions. [2018-06-25 09:50:00,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:00,377 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:50:00,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:00,387 INFO ]: With dead ends: 115 [2018-06-25 09:50:00,387 INFO ]: Without dead ends: 115 [2018-06-25 09:50:00,387 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-25 09:50:00,388 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-25 09:50:00,402 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-06-25 09:50:00,402 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-25 09:50:00,405 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 243 transitions. [2018-06-25 09:50:00,406 INFO ]: Start accepts. Automaton has 115 states and 243 transitions. Word has length 9 [2018-06-25 09:50:00,406 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:00,406 INFO ]: Abstraction has 115 states and 243 transitions. [2018-06-25 09:50:00,406 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:00,406 INFO ]: Start isEmpty. Operand 115 states and 243 transitions. [2018-06-25 09:50:00,408 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:00,408 INFO ]: Found error trace [2018-06-25 09:50:00,408 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:00,408 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:00,408 INFO ]: Analyzing trace with hash -1021068172, now seen corresponding path program 1 times [2018-06-25 09:50:00,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:00,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:00,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:00,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:00,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:00,420 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:00,453 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:00,453 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:00,454 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:00,454 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:00,454 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:00,454 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:00,454 INFO ]: Start difference. First operand 115 states and 243 transitions. Second operand 4 states. [2018-06-25 09:50:00,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:00,770 INFO ]: Finished difference Result 143 states and 303 transitions. [2018-06-25 09:50:00,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:00,770 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:50:00,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:00,774 INFO ]: With dead ends: 143 [2018-06-25 09:50:00,774 INFO ]: Without dead ends: 143 [2018-06-25 09:50:00,774 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-25 09:50:00,774 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-25 09:50:00,790 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-06-25 09:50:00,790 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-25 09:50:00,794 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 303 transitions. [2018-06-25 09:50:00,794 INFO ]: Start accepts. Automaton has 143 states and 303 transitions. Word has length 11 [2018-06-25 09:50:00,794 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:00,794 INFO ]: Abstraction has 143 states and 303 transitions. [2018-06-25 09:50:00,794 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:00,794 INFO ]: Start isEmpty. Operand 143 states and 303 transitions. [2018-06-25 09:50:00,797 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:00,797 INFO ]: Found error trace [2018-06-25 09:50:00,797 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:00,797 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:00,797 INFO ]: Analyzing trace with hash -265759537, now seen corresponding path program 1 times [2018-06-25 09:50:00,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:00,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:00,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:00,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:00,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:00,809 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:00,831 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:00,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:00,831 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:00,831 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:00,831 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:00,831 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:00,831 INFO ]: Start difference. First operand 143 states and 303 transitions. Second operand 3 states. [2018-06-25 09:50:00,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:00,910 INFO ]: Finished difference Result 163 states and 379 transitions. [2018-06-25 09:50:00,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:00,912 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 09:50:00,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:00,922 INFO ]: With dead ends: 163 [2018-06-25 09:50:00,922 INFO ]: Without dead ends: 163 [2018-06-25 09:50:00,924 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-25 09:50:00,924 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-25 09:50:00,961 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 148. [2018-06-25 09:50:00,962 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-25 09:50:00,965 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 328 transitions. [2018-06-25 09:50:00,965 INFO ]: Start accepts. Automaton has 148 states and 328 transitions. Word has length 12 [2018-06-25 09:50:00,965 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:00,965 INFO ]: Abstraction has 148 states and 328 transitions. [2018-06-25 09:50:00,965 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:00,965 INFO ]: Start isEmpty. Operand 148 states and 328 transitions. [2018-06-25 09:50:00,968 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:00,968 INFO ]: Found error trace [2018-06-25 09:50:00,968 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:00,968 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:00,968 INFO ]: Analyzing trace with hash -266087238, now seen corresponding path program 1 times [2018-06-25 09:50:00,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:00,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:00,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:00,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:00,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:00,979 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:01,001 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:01,001 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:01,001 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:01,002 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:01,002 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:01,002 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:01,002 INFO ]: Start difference. First operand 148 states and 328 transitions. Second operand 3 states. [2018-06-25 09:50:01,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:01,019 INFO ]: Finished difference Result 183 states and 434 transitions. [2018-06-25 09:50:01,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:01,022 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 09:50:01,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:01,027 INFO ]: With dead ends: 183 [2018-06-25 09:50:01,027 INFO ]: Without dead ends: 183 [2018-06-25 09:50:01,027 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-25 09:50:01,027 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-25 09:50:01,063 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 153. [2018-06-25 09:50:01,063 INFO ]: Start removeUnreachable. Operand 153 states. [2018-06-25 09:50:01,066 INFO ]: Finished removeUnreachable. Reduced from 153 states to 153 states and 333 transitions. [2018-06-25 09:50:01,066 INFO ]: Start accepts. Automaton has 153 states and 333 transitions. Word has length 12 [2018-06-25 09:50:01,067 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:01,067 INFO ]: Abstraction has 153 states and 333 transitions. [2018-06-25 09:50:01,067 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:01,067 INFO ]: Start isEmpty. Operand 153 states and 333 transitions. [2018-06-25 09:50:01,069 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:01,069 INFO ]: Found error trace [2018-06-25 09:50:01,069 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:01,069 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:01,069 INFO ]: Analyzing trace with hash -540939004, now seen corresponding path program 1 times [2018-06-25 09:50:01,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:01,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:01,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:01,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:01,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:01,077 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:01,140 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:01,140 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:01,140 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:01,140 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:01,140 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:01,140 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:01,140 INFO ]: Start difference. First operand 153 states and 333 transitions. Second operand 3 states. [2018-06-25 09:50:01,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:01,339 INFO ]: Finished difference Result 232 states and 541 transitions. [2018-06-25 09:50:01,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:01,341 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 09:50:01,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:01,346 INFO ]: With dead ends: 232 [2018-06-25 09:50:01,346 INFO ]: Without dead ends: 232 [2018-06-25 09:50:01,347 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-25 09:50:01,347 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-25 09:50:01,378 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 157. [2018-06-25 09:50:01,378 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-25 09:50:01,385 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 355 transitions. [2018-06-25 09:50:01,385 INFO ]: Start accepts. Automaton has 157 states and 355 transitions. Word has length 12 [2018-06-25 09:50:01,386 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:01,386 INFO ]: Abstraction has 157 states and 355 transitions. [2018-06-25 09:50:01,386 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:01,386 INFO ]: Start isEmpty. Operand 157 states and 355 transitions. [2018-06-25 09:50:01,387 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:01,387 INFO ]: Found error trace [2018-06-25 09:50:01,387 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:01,387 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:01,387 INFO ]: Analyzing trace with hash -537244920, now seen corresponding path program 1 times [2018-06-25 09:50:01,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:01,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:01,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:01,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:01,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:01,413 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:01,690 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-06-25 09:50:01,701 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:01,701 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:01,701 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:01,701 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:01,702 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:01,702 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:01,702 INFO ]: Start difference. First operand 157 states and 355 transitions. Second operand 4 states. [2018-06-25 09:50:02,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:02,213 INFO ]: Finished difference Result 237 states and 546 transitions. [2018-06-25 09:50:02,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:02,214 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-25 09:50:02,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:02,218 INFO ]: With dead ends: 237 [2018-06-25 09:50:02,218 INFO ]: Without dead ends: 232 [2018-06-25 09:50:02,218 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:02,219 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-25 09:50:02,236 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 157. [2018-06-25 09:50:02,236 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-25 09:50:02,240 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 350 transitions. [2018-06-25 09:50:02,241 INFO ]: Start accepts. Automaton has 157 states and 350 transitions. Word has length 12 [2018-06-25 09:50:02,241 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:02,241 INFO ]: Abstraction has 157 states and 350 transitions. [2018-06-25 09:50:02,241 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:02,241 INFO ]: Start isEmpty. Operand 157 states and 350 transitions. [2018-06-25 09:50:02,242 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:02,242 INFO ]: Found error trace [2018-06-25 09:50:02,242 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:02,242 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:02,242 INFO ]: Analyzing trace with hash -380603842, now seen corresponding path program 1 times [2018-06-25 09:50:02,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:02,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:02,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:02,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,253 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:02,328 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:02,329 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:02,329 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:02,329 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:02,329 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:02,329 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:02,329 INFO ]: Start difference. First operand 157 states and 350 transitions. Second operand 3 states. [2018-06-25 09:50:02,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:02,434 INFO ]: Finished difference Result 186 states and 435 transitions. [2018-06-25 09:50:02,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:02,435 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 09:50:02,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:02,437 INFO ]: With dead ends: 186 [2018-06-25 09:50:02,437 INFO ]: Without dead ends: 186 [2018-06-25 09:50:02,437 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-25 09:50:02,438 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-25 09:50:02,450 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 151. [2018-06-25 09:50:02,450 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-25 09:50:02,455 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 329 transitions. [2018-06-25 09:50:02,455 INFO ]: Start accepts. Automaton has 151 states and 329 transitions. Word has length 12 [2018-06-25 09:50:02,455 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:02,455 INFO ]: Abstraction has 151 states and 329 transitions. [2018-06-25 09:50:02,455 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:02,455 INFO ]: Start isEmpty. Operand 151 states and 329 transitions. [2018-06-25 09:50:02,457 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:02,457 INFO ]: Found error trace [2018-06-25 09:50:02,457 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:02,457 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:02,458 INFO ]: Analyzing trace with hash 107134410, now seen corresponding path program 1 times [2018-06-25 09:50:02,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:02,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:02,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:02,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:02,522 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:02,523 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:02,523 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:02,523 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:02,523 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:02,523 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:02,523 INFO ]: Start difference. First operand 151 states and 329 transitions. Second operand 3 states. [2018-06-25 09:50:02,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:02,559 INFO ]: Finished difference Result 186 states and 420 transitions. [2018-06-25 09:50:02,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:02,560 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 09:50:02,560 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:02,562 INFO ]: With dead ends: 186 [2018-06-25 09:50:02,562 INFO ]: Without dead ends: 186 [2018-06-25 09:50:02,562 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-25 09:50:02,563 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-25 09:50:02,575 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 156. [2018-06-25 09:50:02,575 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-25 09:50:02,578 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 334 transitions. [2018-06-25 09:50:02,578 INFO ]: Start accepts. Automaton has 156 states and 334 transitions. Word has length 12 [2018-06-25 09:50:02,578 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:02,578 INFO ]: Abstraction has 156 states and 334 transitions. [2018-06-25 09:50:02,578 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:02,578 INFO ]: Start isEmpty. Operand 156 states and 334 transitions. [2018-06-25 09:50:02,592 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:50:02,592 INFO ]: Found error trace [2018-06-25 09:50:02,592 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:02,592 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:02,592 INFO ]: Analyzing trace with hash 24723279, now seen corresponding path program 1 times [2018-06-25 09:50:02,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:02,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:02,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:02,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,606 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:02,673 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:02,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:02,674 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:50:02,674 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:02,674 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:02,674 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:02,674 INFO ]: Start difference. First operand 156 states and 334 transitions. Second operand 5 states. [2018-06-25 09:50:02,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:02,830 INFO ]: Finished difference Result 191 states and 438 transitions. [2018-06-25 09:50:02,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:02,830 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-25 09:50:02,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:02,832 INFO ]: With dead ends: 191 [2018-06-25 09:50:02,832 INFO ]: Without dead ends: 187 [2018-06-25 09:50:02,833 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:02,833 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-25 09:50:02,842 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 157. [2018-06-25 09:50:02,842 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-25 09:50:02,844 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 337 transitions. [2018-06-25 09:50:02,844 INFO ]: Start accepts. Automaton has 157 states and 337 transitions. Word has length 20 [2018-06-25 09:50:02,844 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:02,844 INFO ]: Abstraction has 157 states and 337 transitions. [2018-06-25 09:50:02,844 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:02,844 INFO ]: Start isEmpty. Operand 157 states and 337 transitions. [2018-06-25 09:50:02,849 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:50:02,849 INFO ]: Found error trace [2018-06-25 09:50:02,849 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:02,849 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:02,849 INFO ]: Analyzing trace with hash 1384840019, now seen corresponding path program 1 times [2018-06-25 09:50:02,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:02,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:02,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:02,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:02,912 INFO ]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:50:02,912 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:02,912 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:02,913 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:02,913 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:02,913 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:02,913 INFO ]: Start difference. First operand 157 states and 337 transitions. Second operand 3 states. [2018-06-25 09:50:02,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:02,973 INFO ]: Finished difference Result 177 states and 398 transitions. [2018-06-25 09:50:02,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:02,976 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-25 09:50:02,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:02,979 INFO ]: With dead ends: 177 [2018-06-25 09:50:02,979 INFO ]: Without dead ends: 177 [2018-06-25 09:50:02,979 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-25 09:50:02,979 INFO ]: Start minimizeSevpa. Operand 177 states. [2018-06-25 09:50:02,992 INFO ]: Finished minimizeSevpa. Reduced states from 177 to 162. [2018-06-25 09:50:02,992 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-25 09:50:02,994 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2018-06-25 09:50:02,994 INFO ]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 20 [2018-06-25 09:50:02,994 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:02,994 INFO ]: Abstraction has 162 states and 347 transitions. [2018-06-25 09:50:02,994 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:02,994 INFO ]: Start isEmpty. Operand 162 states and 347 transitions. [2018-06-25 09:50:02,998 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:02,998 INFO ]: Found error trace [2018-06-25 09:50:02,998 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:02,998 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:02,999 INFO ]: Analyzing trace with hash 1683836137, now seen corresponding path program 1 times [2018-06-25 09:50:02,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:02,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:02,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:02,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:02,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:03,006 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:03,059 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:03,060 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:03,060 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-25 09:50:03,066 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:03,085 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:03,091 INFO ]: Computing forward predicates... [2018-06-25 09:50:03,131 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:03,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:03,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 09:50:03,165 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:03,165 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:03,165 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:03,165 INFO ]: Start difference. First operand 162 states and 347 transitions. Second operand 5 states. [2018-06-25 09:50:04,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:04,459 INFO ]: Finished difference Result 259 states and 688 transitions. [2018-06-25 09:50:04,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:50:04,459 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-25 09:50:04,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:04,462 INFO ]: With dead ends: 259 [2018-06-25 09:50:04,462 INFO ]: Without dead ends: 227 [2018-06-25 09:50:04,463 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:04,463 INFO ]: Start minimizeSevpa. Operand 227 states. [2018-06-25 09:50:04,490 INFO ]: Finished minimizeSevpa. Reduced states from 227 to 178. [2018-06-25 09:50:04,490 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-25 09:50:04,492 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 391 transitions. [2018-06-25 09:50:04,492 INFO ]: Start accepts. Automaton has 178 states and 391 transitions. Word has length 21 [2018-06-25 09:50:04,492 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:04,492 INFO ]: Abstraction has 178 states and 391 transitions. [2018-06-25 09:50:04,492 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:04,492 INFO ]: Start isEmpty. Operand 178 states and 391 transitions. [2018-06-25 09:50:04,496 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:04,496 INFO ]: Found error trace [2018-06-25 09:50:04,496 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:04,496 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:04,496 INFO ]: Analyzing trace with hash -255496634, now seen corresponding path program 1 times [2018-06-25 09:50:04,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:04,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:04,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:04,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:04,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:04,503 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:04,636 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:04,636 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:04,636 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:04,636 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:04,636 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:04,636 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:04,636 INFO ]: Start difference. First operand 178 states and 391 transitions. Second operand 4 states. [2018-06-25 09:50:05,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:05,016 INFO ]: Finished difference Result 225 states and 487 transitions. [2018-06-25 09:50:05,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:05,016 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 09:50:05,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:05,018 INFO ]: With dead ends: 225 [2018-06-25 09:50:05,018 INFO ]: Without dead ends: 176 [2018-06-25 09:50:05,018 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-25 09:50:05,018 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-25 09:50:05,028 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-06-25 09:50:05,029 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-25 09:50:05,030 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 367 transitions. [2018-06-25 09:50:05,031 INFO ]: Start accepts. Automaton has 176 states and 367 transitions. Word has length 21 [2018-06-25 09:50:05,031 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:05,031 INFO ]: Abstraction has 176 states and 367 transitions. [2018-06-25 09:50:05,031 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:05,031 INFO ]: Start isEmpty. Operand 176 states and 367 transitions. [2018-06-25 09:50:05,033 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:05,033 INFO ]: Found error trace [2018-06-25 09:50:05,033 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:05,034 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:05,034 INFO ]: Analyzing trace with hash -467918625, now seen corresponding path program 1 times [2018-06-25 09:50:05,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:05,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:05,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:05,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:05,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:05,042 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:05,111 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:05,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:05,111 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:50:05,111 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:05,111 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:05,111 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:05,111 INFO ]: Start difference. First operand 176 states and 367 transitions. Second operand 6 states. [2018-06-25 09:50:05,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:05,945 INFO ]: Finished difference Result 279 states and 725 transitions. [2018-06-25 09:50:05,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:50:05,945 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-25 09:50:05,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:05,948 INFO ]: With dead ends: 279 [2018-06-25 09:50:05,948 INFO ]: Without dead ends: 279 [2018-06-25 09:50:05,948 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:05,949 INFO ]: Start minimizeSevpa. Operand 279 states. [2018-06-25 09:50:05,970 INFO ]: Finished minimizeSevpa. Reduced states from 279 to 178. [2018-06-25 09:50:05,970 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-25 09:50:05,972 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 368 transitions. [2018-06-25 09:50:05,972 INFO ]: Start accepts. Automaton has 178 states and 368 transitions. Word has length 21 [2018-06-25 09:50:05,972 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:05,972 INFO ]: Abstraction has 178 states and 368 transitions. [2018-06-25 09:50:05,972 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:05,972 INFO ]: Start isEmpty. Operand 178 states and 368 transitions. [2018-06-25 09:50:05,976 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:05,976 INFO ]: Found error trace [2018-06-25 09:50:05,976 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:05,977 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:05,977 INFO ]: Analyzing trace with hash -1943136545, now seen corresponding path program 1 times [2018-06-25 09:50:05,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:05,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:05,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:05,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:05,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:05,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:06,032 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:06,032 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:06,032 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:06,032 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:06,032 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:06,032 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:06,033 INFO ]: Start difference. First operand 178 states and 368 transitions. Second operand 3 states. [2018-06-25 09:50:06,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:06,112 INFO ]: Finished difference Result 215 states and 472 transitions. [2018-06-25 09:50:06,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:06,112 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-25 09:50:06,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:06,114 INFO ]: With dead ends: 215 [2018-06-25 09:50:06,114 INFO ]: Without dead ends: 215 [2018-06-25 09:50:06,114 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-25 09:50:06,115 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-25 09:50:06,125 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 172. [2018-06-25 09:50:06,125 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-25 09:50:06,126 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 351 transitions. [2018-06-25 09:50:06,126 INFO ]: Start accepts. Automaton has 172 states and 351 transitions. Word has length 21 [2018-06-25 09:50:06,127 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:06,127 INFO ]: Abstraction has 172 states and 351 transitions. [2018-06-25 09:50:06,127 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:06,127 INFO ]: Start isEmpty. Operand 172 states and 351 transitions. [2018-06-25 09:50:06,129 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:06,129 INFO ]: Found error trace [2018-06-25 09:50:06,129 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:06,129 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:06,129 INFO ]: Analyzing trace with hash 269690335, now seen corresponding path program 1 times [2018-06-25 09:50:06,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:06,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:06,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:06,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,137 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:06,294 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:06,294 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:06,294 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:50:06,294 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:06,294 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:06,294 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:06,294 INFO ]: Start difference. First operand 172 states and 351 transitions. Second operand 6 states. [2018-06-25 09:50:07,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:07,351 INFO ]: Finished difference Result 258 states and 659 transitions. [2018-06-25 09:50:07,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:50:07,351 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-25 09:50:07,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:07,354 INFO ]: With dead ends: 258 [2018-06-25 09:50:07,354 INFO ]: Without dead ends: 258 [2018-06-25 09:50:07,355 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:07,355 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-25 09:50:07,372 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 178. [2018-06-25 09:50:07,372 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-25 09:50:07,373 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 378 transitions. [2018-06-25 09:50:07,373 INFO ]: Start accepts. Automaton has 178 states and 378 transitions. Word has length 21 [2018-06-25 09:50:07,374 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:07,374 INFO ]: Abstraction has 178 states and 378 transitions. [2018-06-25 09:50:07,374 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:07,374 INFO ]: Start isEmpty. Operand 178 states and 378 transitions. [2018-06-25 09:50:07,376 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:07,376 INFO ]: Found error trace [2018-06-25 09:50:07,376 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:07,376 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:07,376 INFO ]: Analyzing trace with hash -51403803, now seen corresponding path program 1 times [2018-06-25 09:50:07,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:07,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:07,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:07,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,385 INFO ]: Conjunction of SSA is sat [2018-06-25 09:50:07,387 INFO ]: Counterexample might be feasible [2018-06-25 09:50:07,406 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:50:07 BoogieIcfgContainer [2018-06-25 09:50:07,406 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:50:07,407 INFO ]: Toolchain (without parser) took 9914.08 ms. Allocated memory was 309.3 MB in the beginning and 362.8 MB in the end (delta: 53.5 MB). Free memory was 261.7 MB in the beginning and 247.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 67.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:07,408 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:50:07,408 INFO ]: ChcToBoogie took 78.63 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:07,409 INFO ]: Boogie Preprocessor took 68.28 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:07,409 INFO ]: RCFGBuilder took 713.42 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 237.7 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:07,411 INFO ]: TraceAbstraction took 9044.51 ms. Allocated memory was 309.3 MB in the beginning and 362.8 MB in the end (delta: 53.5 MB). Free memory was 237.7 MB in the beginning and 247.6 MB in the end (delta: -9.9 MB). Peak memory consumption was 43.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:07,414 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 78.63 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 68.28 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 713.42 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 237.7 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 9044.51 ms. Allocated memory was 309.3 MB in the beginning and 362.8 MB in the end (delta: 53.5 MB). Free memory was 237.7 MB in the beginning and 247.6 MB in the end (delta: -9.9 MB). Peak memory consumption was 43.6 MB. 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_1_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_3_Int; [L0] assume !(hhv_INV_REC_f__1_0_Int == 0); [L0] CALL call gotoProc(3, 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 FALSE !(gotoSwitch == 5) [L0] COND TRUE gotoSwitch == 3 [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(3, 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, 8.9s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1322 SDtfs, 1046 SDslu, 1674 SDs, 0 SdLazy, 1074 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred 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.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 578 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 6836 SizeOfPredicates, 2 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 45/47 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-25_09-50-07-431.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-25_09-50-07-431.csv Received shutdown request...