java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:19:26,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:19:26,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:19:26,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:19:26,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:19:26,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:19:26,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:19:26,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:19:26,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:19:26,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:19:26,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:19:26,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:19:26,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:19:26,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:19:26,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:19:26,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:19:26,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:19:26,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:19:26,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:19:26,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:19:26,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:19:26,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:19:26,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:19:26,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:19:26,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:19:26,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:19:26,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:19:26,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:19:26,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:19:26,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:19:26,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:19:26,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:19:26,162 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:19:26,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:19:26,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:19:26,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:19:26,190 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:19:26,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:19:26,191 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:19:26,192 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:19:26,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:19:26,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:19:26,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:19:26,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:19:26,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:19:26,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:19:26,194 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:19:26,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:19:26,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:19:26,194 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:19:26,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:19:26,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:19:26,196 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:19:26,197 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:19:26,197 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:19:26,242 INFO ]: Repository-Root is: /tmp [2018-06-22 01:19:26,257 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:19:26,264 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:19:26,266 INFO ]: Initializing SmtParser... [2018-06-22 01:19:26,266 INFO ]: SmtParser initialized [2018-06-22 01:19:26,267 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 [2018-06-22 01:19:26,268 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:19:26,362 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 unknown [2018-06-22 01:19:26,594 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 [2018-06-22 01:19:26,599 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:19:26,605 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:19:26,606 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:19:26,606 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:19:26,606 INFO ]: ChcToBoogie initialized [2018-06-22 01:19:26,609 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,670 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26 Unit [2018-06-22 01:19:26,670 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:19:26,671 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:19:26,671 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:19:26,671 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:19:26,690 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,690 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,697 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,697 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,703 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,717 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,718 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (1/1) ... [2018-06-22 01:19:26,720 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:19:26,720 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:19:26,721 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:19:26,721 INFO ]: RCFGBuilder initialized [2018-06-22 01:19:26,721 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:19:26,745 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:19:26,745 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:19:26,745 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:19:26,745 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:19:26,745 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:19:26,745 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:19:27,117 INFO ]: Using library mode [2018-06-22 01:19:27,118 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:27 BoogieIcfgContainer [2018-06-22 01:19:27,118 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:19:27,119 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:19:27,120 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:19:27,122 INFO ]: TraceAbstraction initialized [2018-06-22 01:19:27,123 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:26" (1/3) ... [2018-06-22 01:19:27,123 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5823b844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:19:27, skipping insertion in model container [2018-06-22 01:19:27,124 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:26" (2/3) ... [2018-06-22 01:19:27,124 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5823b844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:19:27, skipping insertion in model container [2018-06-22 01:19:27,124 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:27" (3/3) ... [2018-06-22 01:19:27,126 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:19:27,134 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:19:27,143 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:19:27,195 INFO ]: Using default assertion order modulation [2018-06-22 01:19:27,196 INFO ]: Interprodecural is true [2018-06-22 01:19:27,196 INFO ]: Hoare is false [2018-06-22 01:19:27,196 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:19:27,196 INFO ]: Backedges is TWOTRACK [2018-06-22 01:19:27,196 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:19:27,196 INFO ]: Difference is false [2018-06-22 01:19:27,196 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:19:27,196 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:19:27,217 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:19:27,226 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:19:27,226 INFO ]: Found error trace [2018-06-22 01:19:27,227 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:19:27,227 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:27,230 INFO ]: Analyzing trace with hash -1202381275, now seen corresponding path program 1 times [2018-06-22 01:19:27,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:27,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:27,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:27,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:27,325 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:27,327 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:27,327 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:19:27,328 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:19:27,338 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:19:27,339 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:19:27,341 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:19:27,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:27,359 INFO ]: Finished difference Result 10 states and 22 transitions. [2018-06-22 01:19:27,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:19:27,360 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:19:27,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:27,371 INFO ]: With dead ends: 10 [2018-06-22 01:19:27,371 INFO ]: Without dead ends: 10 [2018-06-22 01:19:27,373 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:19:27,388 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:19:27,403 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:19:27,404 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:19:27,404 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-06-22 01:19:27,405 INFO ]: Start accepts. Automaton has 10 states and 22 transitions. Word has length 6 [2018-06-22 01:19:27,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:27,406 INFO ]: Abstraction has 10 states and 22 transitions. [2018-06-22 01:19:27,406 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:19:27,406 INFO ]: Start isEmpty. Operand 10 states and 22 transitions. [2018-06-22 01:19:27,406 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:27,406 INFO ]: Found error trace [2018-06-22 01:19:27,406 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:27,406 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:27,406 INFO ]: Analyzing trace with hash 1369142917, now seen corresponding path program 1 times [2018-06-22 01:19:27,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:27,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:27,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:27,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:27,481 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:27,481 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:27,481 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:27,482 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:27,482 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:27,482 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,483 INFO ]: Start difference. First operand 10 states and 22 transitions. Second operand 3 states. [2018-06-22 01:19:27,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:27,596 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-22 01:19:27,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:27,596 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:27,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:27,598 INFO ]: With dead ends: 14 [2018-06-22 01:19:27,599 INFO ]: Without dead ends: 14 [2018-06-22 01:19:27,599 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,599 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:19:27,602 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:19:27,602 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:27,602 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-06-22 01:19:27,602 INFO ]: Start accepts. Automaton has 11 states and 26 transitions. Word has length 7 [2018-06-22 01:19:27,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:27,603 INFO ]: Abstraction has 11 states and 26 transitions. [2018-06-22 01:19:27,603 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:27,603 INFO ]: Start isEmpty. Operand 11 states and 26 transitions. [2018-06-22 01:19:27,604 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:27,604 INFO ]: Found error trace [2018-06-22 01:19:27,604 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:27,604 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:27,604 INFO ]: Analyzing trace with hash 1386391906, now seen corresponding path program 1 times [2018-06-22 01:19:27,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:27,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:27,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:27,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:27,635 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:27,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:27,635 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:27,635 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:27,636 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:27,636 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,636 INFO ]: Start difference. First operand 11 states and 26 transitions. Second operand 3 states. [2018-06-22 01:19:27,653 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:27,653 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-22 01:19:27,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:27,653 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:27,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:27,654 INFO ]: With dead ends: 12 [2018-06-22 01:19:27,654 INFO ]: Without dead ends: 12 [2018-06-22 01:19:27,654 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,654 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:19:27,656 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:19:27,656 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:27,656 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-22 01:19:27,656 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 7 [2018-06-22 01:19:27,656 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:27,656 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-22 01:19:27,656 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:27,656 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-22 01:19:27,657 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:27,657 INFO ]: Found error trace [2018-06-22 01:19:27,657 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:27,657 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:27,657 INFO ]: Analyzing trace with hash 1388238948, now seen corresponding path program 1 times [2018-06-22 01:19:27,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:27,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:27,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:27,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,664 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:27,714 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:27,714 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:27,714 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:27,714 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:27,714 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:27,714 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,714 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 3 states. [2018-06-22 01:19:27,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:27,776 INFO ]: Finished difference Result 13 states and 28 transitions. [2018-06-22 01:19:27,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:27,776 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:27,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:27,777 INFO ]: With dead ends: 13 [2018-06-22 01:19:27,777 INFO ]: Without dead ends: 13 [2018-06-22 01:19:27,777 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,777 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:19:27,780 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-22 01:19:27,780 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:27,781 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-22 01:19:27,781 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 7 [2018-06-22 01:19:27,781 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:27,781 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-22 01:19:27,781 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:27,781 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-22 01:19:27,781 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:27,781 INFO ]: Found error trace [2018-06-22 01:19:27,781 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:27,781 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:27,782 INFO ]: Analyzing trace with hash -517985755, now seen corresponding path program 1 times [2018-06-22 01:19:27,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:27,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:27,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:27,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:27,870 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:27,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:27,870 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:27,870 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:27,871 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:27,871 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,871 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 3 states. [2018-06-22 01:19:27,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:27,961 INFO ]: Finished difference Result 15 states and 28 transitions. [2018-06-22 01:19:27,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:27,963 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:27,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:27,963 INFO ]: With dead ends: 15 [2018-06-22 01:19:27,963 INFO ]: Without dead ends: 15 [2018-06-22 01:19:27,964 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:27,964 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:19:27,967 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:19:27,967 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:27,968 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-06-22 01:19:27,968 INFO ]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 8 [2018-06-22 01:19:27,968 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:27,968 INFO ]: Abstraction has 12 states and 24 transitions. [2018-06-22 01:19:27,968 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:27,968 INFO ]: Start isEmpty. Operand 12 states and 24 transitions. [2018-06-22 01:19:27,968 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:27,968 INFO ]: Found error trace [2018-06-22 01:19:27,968 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:27,968 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:27,969 INFO ]: Analyzing trace with hash -518432620, now seen corresponding path program 1 times [2018-06-22 01:19:27,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:27,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:27,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:27,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:27,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:28,044 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:28,044 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:28,044 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:28,045 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:28,045 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:28,045 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:28,045 INFO ]: Start difference. First operand 12 states and 24 transitions. Second operand 3 states. [2018-06-22 01:19:28,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:28,068 INFO ]: Finished difference Result 15 states and 26 transitions. [2018-06-22 01:19:28,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:28,068 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:28,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:28,069 INFO ]: With dead ends: 15 [2018-06-22 01:19:28,069 INFO ]: Without dead ends: 15 [2018-06-22 01:19:28,069 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 01:19:28,069 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:19:28,071 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:19:28,071 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:28,071 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2018-06-22 01:19:28,071 INFO ]: Start accepts. Automaton has 12 states and 22 transitions. Word has length 8 [2018-06-22 01:19:28,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:28,071 INFO ]: Abstraction has 12 states and 22 transitions. [2018-06-22 01:19:28,071 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:28,071 INFO ]: Start isEmpty. Operand 12 states and 22 transitions. [2018-06-22 01:19:28,072 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:28,072 INFO ]: Found error trace [2018-06-22 01:19:28,072 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:28,072 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:28,072 INFO ]: Analyzing trace with hash -502583808, now seen corresponding path program 1 times [2018-06-22 01:19:28,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:28,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:28,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:28,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,081 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:28,154 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:28,154 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:28,154 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:19:28,154 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:19:28,154 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:19:28,154 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:28,154 INFO ]: Start difference. First operand 12 states and 22 transitions. Second operand 4 states. [2018-06-22 01:19:28,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:28,298 INFO ]: Finished difference Result 17 states and 28 transitions. [2018-06-22 01:19:28,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:19:28,298 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:19:28,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:28,299 INFO ]: With dead ends: 17 [2018-06-22 01:19:28,299 INFO ]: Without dead ends: 17 [2018-06-22 01:19:28,299 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 01:19:28,299 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:19:28,301 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-22 01:19:28,301 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:28,301 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2018-06-22 01:19:28,302 INFO ]: Start accepts. Automaton has 12 states and 22 transitions. Word has length 8 [2018-06-22 01:19:28,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:28,302 INFO ]: Abstraction has 12 states and 22 transitions. [2018-06-22 01:19:28,302 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:19:28,302 INFO ]: Start isEmpty. Operand 12 states and 22 transitions. [2018-06-22 01:19:28,302 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:28,302 INFO ]: Found error trace [2018-06-22 01:19:28,302 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:28,302 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:28,302 INFO ]: Analyzing trace with hash -513666060, now seen corresponding path program 1 times [2018-06-22 01:19:28,302 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:28,302 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:28,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:28,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:28,356 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:28,356 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:28,356 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:28,357 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:28,357 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:28,357 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:28,357 INFO ]: Start difference. First operand 12 states and 22 transitions. Second operand 3 states. [2018-06-22 01:19:28,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:28,369 INFO ]: Finished difference Result 16 states and 25 transitions. [2018-06-22 01:19:28,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:28,369 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:28,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:28,370 INFO ]: With dead ends: 16 [2018-06-22 01:19:28,370 INFO ]: Without dead ends: 16 [2018-06-22 01:19:28,370 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:28,370 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:19:28,372 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:19:28,372 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:28,372 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-22 01:19:28,372 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-22 01:19:28,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:28,372 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-22 01:19:28,372 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:28,372 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-22 01:19:28,373 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:28,373 INFO ]: Found error trace [2018-06-22 01:19:28,373 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:28,373 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:28,373 INFO ]: Analyzing trace with hash 26593725, now seen corresponding path program 1 times [2018-06-22 01:19:28,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:28,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:28,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:28,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:28,450 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:28,450 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:19:28,450 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 01:19:28,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:28,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:28,496 INFO ]: Computing forward predicates... [2018-06-22 01:19:28,763 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:28,799 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:19:28,799 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-22 01:19:28,799 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:19:28,800 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:19:28,800 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:19:28,800 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 6 states. [2018-06-22 01:19:28,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:28,891 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-22 01:19:28,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:19:28,891 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 01:19:28,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:28,892 INFO ]: With dead ends: 17 [2018-06-22 01:19:28,892 INFO ]: Without dead ends: 15 [2018-06-22 01:19:28,892 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:19:28,892 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:19:28,893 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:19:28,893 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:28,894 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-22 01:19:28,894 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 8 [2018-06-22 01:19:28,894 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:28,894 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-22 01:19:28,894 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:19:28,894 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-22 01:19:28,894 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:28,894 INFO ]: Found error trace [2018-06-22 01:19:28,894 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:28,895 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:28,895 INFO ]: Analyzing trace with hash 83852027, now seen corresponding path program 1 times [2018-06-22 01:19:28,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:28,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:28,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:28,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:28,915 INFO ]: Conjunction of SSA is sat [2018-06-22 01:19:28,917 INFO ]: Counterexample might be feasible [2018-06-22 01:19:28,934 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:19:28 BoogieIcfgContainer [2018-06-22 01:19:28,934 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:19:28,936 INFO ]: Toolchain (without parser) took 2336.82 ms. Allocated memory was 310.4 MB in the beginning and 326.6 MB in the end (delta: 16.3 MB). Free memory was 263.9 MB in the beginning and 292.4 MB in the end (delta: -28.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:19:28,939 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 310.4 MB. Free memory is still 276.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:19:28,939 INFO ]: ChcToBoogie took 64.69 ms. Allocated memory is still 310.4 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:28,939 INFO ]: Boogie Preprocessor took 49.22 ms. Allocated memory is still 310.4 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:28,940 INFO ]: RCFGBuilder took 397.52 ms. Allocated memory is still 310.4 MB. Free memory was 259.9 MB in the beginning and 247.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:28,940 INFO ]: TraceAbstraction took 1814.90 ms. Allocated memory was 310.4 MB in the beginning and 326.6 MB in the end (delta: 16.3 MB). Free memory was 246.9 MB in the beginning and 292.4 MB in the end (delta: -45.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:19:28,943 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 310.4 MB. Free memory is still 276.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.69 ms. Allocated memory is still 310.4 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.22 ms. Allocated memory is still 310.4 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 397.52 ms. Allocated memory is still 310.4 MB. Free memory was 259.9 MB in the beginning and 247.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1814.90 ms. Allocated memory was 310.4 MB in the beginning and 326.6 MB in the end (delta: 16.3 MB). Free memory was 246.9 MB in the beginning and 292.4 MB in the end (delta: -45.5 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] assume (((((((!(hbv_False_2_Int == 0) && hbv_False_1_Int + -2 == 0) && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_3_Int == hbv_False_6_Int) && !(hbv_False_7_Int == hbv_False_6_Int)) && !(hbv_False_1_Int == 0)) && hbv_False_2_Int == hbv_False_1_Int) && hbv_False_3_Int + 1 == hbv_False_4_Int) && !(hbv_False_1_Int + -1 == 0); [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int, hhv_REC_f__2_Int := hbv_False_5_Int, hbv_False_4_Int, hbv_False_7_Int; [L0] havoc hbv_False_2_Int, hbv_False_5_Int, hbv_False_1_Int, hbv_False_6_Int, hbv_False_4_Int, hbv_False_7_Int, hbv_False_3_Int; [L0] assume (!(hhv_REC_f__0_Int == 0) && hhv_REC_f__0_Int + -1 == hbv_REC_f__1_Int) && hhv_REC_f__1_Int + 1 == hbv_REC_f__2_Int; [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int, hhv_REC_f__2_Int := hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int; [L0] havoc hbv_REC_f__1_Int, hbv_REC_f__2_Int; [L0] assume hhv_REC_f__2_Int == hhv_REC_f__1_Int && hhv_REC_f__0_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, 12 locations, 1 error locations. UNSAFE Result, 1.7s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 47 SDslu, 129 SDs, 0 SdLazy, 68 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 761 SizeOfPredicates, 1 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 3/4 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/002c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-19-28-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-19-28-954.csv Received shutdown request...