java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:55:15,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:55:15,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:55:15,678 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:55:15,678 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:55:15,679 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:55:15,680 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:55:15,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:55:15,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:55:15,687 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:55:15,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:55:15,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:55:15,689 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:55:15,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:55:15,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:55:15,695 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:55:15,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:55:15,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:55:15,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:55:15,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:55:15,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:55:15,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:55:15,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:55:15,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:55:15,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:55:15,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:55:15,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:55:15,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:55:15,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:55:15,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:55:15,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:55:15,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:55:15,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:55:15,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:55:15,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:55:15,733 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:55:15,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:55:15,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:55:15,748 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:55:15,748 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:55:15,749 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:55:15,749 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:55:15,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:55:15,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:55:15,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:55:15,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:55:15,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:55:15,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:55:15,751 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:55:15,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:55:15,751 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:55:15,751 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:55:15,751 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:55:15,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:55:15,752 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:55:15,753 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:55:15,753 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:55:15,803 INFO ]: Repository-Root is: /tmp [2018-06-22 11:55:15,818 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:55:15,825 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:55:15,827 INFO ]: Initializing SmtParser... [2018-06-22 11:55:15,827 INFO ]: SmtParser initialized [2018-06-22 11:55:15,828 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-22 11:55:15,830 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:55:15,922 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@7f46bb8b [2018-06-22 11:55:16,192 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__add-horn!.smt2 [2018-06-22 11:55:16,197 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:55:16,202 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:55:16,202 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:55:16,202 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:55:16,203 INFO ]: ChcToBoogie initialized [2018-06-22 11:55:16,206 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,261 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16 Unit [2018-06-22 11:55:16,261 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:55:16,262 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:55:16,262 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:55:16,262 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:55:16,288 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,288 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,306 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,306 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,312 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,325 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,327 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (1/1) ... [2018-06-22 11:55:16,329 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:55:16,330 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:55:16,330 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:55:16,330 INFO ]: RCFGBuilder initialized [2018-06-22 11:55:16,331 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (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 11:55:16,348 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:55:16,348 INFO ]: Found specification of procedure False [2018-06-22 11:55:16,348 INFO ]: Found implementation of procedure False [2018-06-22 11:55:16,348 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 11:55:16,348 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 11:55:16,348 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 11:55:16,348 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 11:55:16,348 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 11:55:16,348 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 11:55:16,348 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 11:55:16,348 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 11:55:16,348 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 11:55:16,348 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 11:55:16,348 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 11:55:16,348 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 11:55:16,348 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 11:55:16,348 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 11:55:16,348 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 11:55:16,348 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 11:55:16,349 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 11:55:16,349 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 11:55:16,349 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:55:16,349 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:55:16,349 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:55:16,818 INFO ]: Using library mode [2018-06-22 11:55:16,819 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:16 BoogieIcfgContainer [2018-06-22 11:55:16,819 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:55:16,820 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:55:16,820 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:55:16,823 INFO ]: TraceAbstraction initialized [2018-06-22 11:55:16,824 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:16" (1/3) ... [2018-06-22 11:55:16,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14904f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:55:16, skipping insertion in model container [2018-06-22 11:55:16,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:16" (2/3) ... [2018-06-22 11:55:16,828 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14904f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:55:16, skipping insertion in model container [2018-06-22 11:55:16,828 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:16" (3/3) ... [2018-06-22 11:55:16,829 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:55:16,839 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:55:16,848 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:55:16,887 INFO ]: Using default assertion order modulation [2018-06-22 11:55:16,888 INFO ]: Interprodecural is true [2018-06-22 11:55:16,888 INFO ]: Hoare is false [2018-06-22 11:55:16,888 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:55:16,888 INFO ]: Backedges is TWOTRACK [2018-06-22 11:55:16,888 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:55:16,888 INFO ]: Difference is false [2018-06-22 11:55:16,888 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:55:16,888 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:55:16,912 INFO ]: Start isEmpty. Operand 59 states. [2018-06-22 11:55:16,926 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:55:16,926 INFO ]: Found error trace [2018-06-22 11:55:16,927 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:55:16,927 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:16,930 INFO ]: Analyzing trace with hash 197398908, now seen corresponding path program 1 times [2018-06-22 11:55:16,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:16,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:16,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:16,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:16,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:16,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:17,011 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:17,013 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:17,013 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:55:17,015 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:55:17,031 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:55:17,032 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:55:17,034 INFO ]: Start difference. First operand 59 states. Second operand 2 states. [2018-06-22 11:55:17,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:17,066 INFO ]: Finished difference Result 56 states and 103 transitions. [2018-06-22 11:55:17,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:55:17,067 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:55:17,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:17,087 INFO ]: With dead ends: 56 [2018-06-22 11:55:17,087 INFO ]: Without dead ends: 56 [2018-06-22 11:55:17,089 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 11:55:17,104 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:55:17,141 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:55:17,142 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:55:17,145 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 103 transitions. [2018-06-22 11:55:17,147 INFO ]: Start accepts. Automaton has 56 states and 103 transitions. Word has length 5 [2018-06-22 11:55:17,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:17,147 INFO ]: Abstraction has 56 states and 103 transitions. [2018-06-22 11:55:17,147 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:55:17,147 INFO ]: Start isEmpty. Operand 56 states and 103 transitions. [2018-06-22 11:55:17,152 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:17,152 INFO ]: Found error trace [2018-06-22 11:55:17,152 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:17,152 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:17,152 INFO ]: Analyzing trace with hash 1636655825, now seen corresponding path program 1 times [2018-06-22 11:55:17,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:17,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:17,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:17,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:17,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:17,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:17,515 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:17,515 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:17,515 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:55:17,517 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:55:17,517 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:55:17,517 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:17,518 INFO ]: Start difference. First operand 56 states and 103 transitions. Second operand 5 states. [2018-06-22 11:55:17,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:17,803 INFO ]: Finished difference Result 63 states and 111 transitions. [2018-06-22 11:55:17,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:55:17,803 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:55:17,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:17,806 INFO ]: With dead ends: 63 [2018-06-22 11:55:17,806 INFO ]: Without dead ends: 56 [2018-06-22 11:55:17,807 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:17,807 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:55:17,821 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-06-22 11:55:17,821 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:55:17,825 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-06-22 11:55:17,825 INFO ]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 13 [2018-06-22 11:55:17,825 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:17,825 INFO ]: Abstraction has 54 states and 97 transitions. [2018-06-22 11:55:17,825 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:55:17,825 INFO ]: Start isEmpty. Operand 54 states and 97 transitions. [2018-06-22 11:55:17,828 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:17,828 INFO ]: Found error trace [2018-06-22 11:55:17,828 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:17,828 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:17,829 INFO ]: Analyzing trace with hash 1488879668, now seen corresponding path program 1 times [2018-06-22 11:55:17,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:17,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:17,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:17,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:17,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:17,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:17,939 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:17,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:17,939 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:17,939 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:17,939 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:17,939 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:17,939 INFO ]: Start difference. First operand 54 states and 97 transitions. Second operand 4 states. [2018-06-22 11:55:17,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:17,990 INFO ]: Finished difference Result 58 states and 101 transitions. [2018-06-22 11:55:17,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:17,990 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:17,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:17,993 INFO ]: With dead ends: 58 [2018-06-22 11:55:17,993 INFO ]: Without dead ends: 58 [2018-06-22 11:55:17,993 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:17,993 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:55:18,010 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 11:55:18,010 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:55:18,011 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 99 transitions. [2018-06-22 11:55:18,011 INFO ]: Start accepts. Automaton has 56 states and 99 transitions. Word has length 13 [2018-06-22 11:55:18,011 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:18,011 INFO ]: Abstraction has 56 states and 99 transitions. [2018-06-22 11:55:18,011 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:18,011 INFO ]: Start isEmpty. Operand 56 states and 99 transitions. [2018-06-22 11:55:18,014 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:18,014 INFO ]: Found error trace [2018-06-22 11:55:18,014 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:18,014 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:18,014 INFO ]: Analyzing trace with hash -1425461356, now seen corresponding path program 1 times [2018-06-22 11:55:18,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:18,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:18,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:18,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:18,063 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:18,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:18,063 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:18,063 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:18,064 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:18,064 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,064 INFO ]: Start difference. First operand 56 states and 99 transitions. Second operand 4 states. [2018-06-22 11:55:18,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:18,205 INFO ]: Finished difference Result 60 states and 107 transitions. [2018-06-22 11:55:18,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:18,207 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:18,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:18,208 INFO ]: With dead ends: 60 [2018-06-22 11:55:18,208 INFO ]: Without dead ends: 60 [2018-06-22 11:55:18,209 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,209 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:55:18,219 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 11:55:18,220 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:55:18,221 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-06-22 11:55:18,221 INFO ]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 13 [2018-06-22 11:55:18,222 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:18,222 INFO ]: Abstraction has 58 states and 105 transitions. [2018-06-22 11:55:18,222 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:18,222 INFO ]: Start isEmpty. Operand 58 states and 105 transitions. [2018-06-22 11:55:18,223 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:18,224 INFO ]: Found error trace [2018-06-22 11:55:18,224 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:18,224 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:18,224 INFO ]: Analyzing trace with hash 176430430, now seen corresponding path program 1 times [2018-06-22 11:55:18,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:18,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:18,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:18,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:18,312 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:18,312 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:18,312 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:18,312 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:18,312 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:18,312 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,313 INFO ]: Start difference. First operand 58 states and 105 transitions. Second operand 4 states. [2018-06-22 11:55:18,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:18,424 INFO ]: Finished difference Result 60 states and 106 transitions. [2018-06-22 11:55:18,431 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:18,432 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:18,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:18,433 INFO ]: With dead ends: 60 [2018-06-22 11:55:18,433 INFO ]: Without dead ends: 60 [2018-06-22 11:55:18,433 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,433 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:55:18,440 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 11:55:18,440 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:55:18,442 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 104 transitions. [2018-06-22 11:55:18,442 INFO ]: Start accepts. Automaton has 58 states and 104 transitions. Word has length 13 [2018-06-22 11:55:18,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:18,442 INFO ]: Abstraction has 58 states and 104 transitions. [2018-06-22 11:55:18,442 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:18,443 INFO ]: Start isEmpty. Operand 58 states and 104 transitions. [2018-06-22 11:55:18,448 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:18,448 INFO ]: Found error trace [2018-06-22 11:55:18,448 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:18,448 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:18,448 INFO ]: Analyzing trace with hash -277983987, now seen corresponding path program 1 times [2018-06-22 11:55:18,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:18,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:18,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:18,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,455 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:18,478 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:18,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:18,478 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:18,478 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:18,478 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:18,478 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,478 INFO ]: Start difference. First operand 58 states and 104 transitions. Second operand 4 states. [2018-06-22 11:55:18,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:18,531 INFO ]: Finished difference Result 63 states and 111 transitions. [2018-06-22 11:55:18,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:18,531 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:18,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:18,533 INFO ]: With dead ends: 63 [2018-06-22 11:55:18,533 INFO ]: Without dead ends: 63 [2018-06-22 11:55:18,533 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,533 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:55:18,540 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-06-22 11:55:18,540 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:55:18,542 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 109 transitions. [2018-06-22 11:55:18,542 INFO ]: Start accepts. Automaton has 61 states and 109 transitions. Word has length 13 [2018-06-22 11:55:18,542 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:18,542 INFO ]: Abstraction has 61 states and 109 transitions. [2018-06-22 11:55:18,542 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:18,542 INFO ]: Start isEmpty. Operand 61 states and 109 transitions. [2018-06-22 11:55:18,543 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:18,543 INFO ]: Found error trace [2018-06-22 11:55:18,543 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:18,543 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:18,544 INFO ]: Analyzing trace with hash 165344484, now seen corresponding path program 1 times [2018-06-22 11:55:18,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:18,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:18,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:18,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:18,570 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:18,570 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:18,570 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:18,570 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:18,571 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:18,571 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,571 INFO ]: Start difference. First operand 61 states and 109 transitions. Second operand 4 states. [2018-06-22 11:55:18,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:18,620 INFO ]: Finished difference Result 61 states and 108 transitions. [2018-06-22 11:55:18,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:18,621 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:18,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:18,622 INFO ]: With dead ends: 61 [2018-06-22 11:55:18,622 INFO ]: Without dead ends: 60 [2018-06-22 11:55:18,622 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,622 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:55:18,629 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-06-22 11:55:18,629 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:55:18,630 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2018-06-22 11:55:18,631 INFO ]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 13 [2018-06-22 11:55:18,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:18,631 INFO ]: Abstraction has 57 states and 101 transitions. [2018-06-22 11:55:18,631 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:18,631 INFO ]: Start isEmpty. Operand 57 states and 101 transitions. [2018-06-22 11:55:18,632 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:18,632 INFO ]: Found error trace [2018-06-22 11:55:18,632 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:18,632 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:18,632 INFO ]: Analyzing trace with hash -1945758647, now seen corresponding path program 1 times [2018-06-22 11:55:18,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:18,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:18,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:18,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:18,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:18,821 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:55:18,821 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:18,821 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:18,821 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:18,822 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:18,822 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:18,822 INFO ]: Start difference. First operand 57 states and 101 transitions. Second operand 4 states. [2018-06-22 11:55:19,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:19,095 INFO ]: Finished difference Result 59 states and 103 transitions. [2018-06-22 11:55:19,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:19,096 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:55:19,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:19,097 INFO ]: With dead ends: 59 [2018-06-22 11:55:19,097 INFO ]: Without dead ends: 54 [2018-06-22 11:55:19,097 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:19,097 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:55:19,105 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 11:55:19,105 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:55:19,109 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-06-22 11:55:19,109 INFO ]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 21 [2018-06-22 11:55:19,109 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:19,109 INFO ]: Abstraction has 52 states and 90 transitions. [2018-06-22 11:55:19,109 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:19,109 INFO ]: Start isEmpty. Operand 52 states and 90 transitions. [2018-06-22 11:55:19,110 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:19,110 INFO ]: Found error trace [2018-06-22 11:55:19,110 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:19,110 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:19,111 INFO ]: Analyzing trace with hash 1577409160, now seen corresponding path program 1 times [2018-06-22 11:55:19,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:19,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:19,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:19,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:19,403 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:19,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:19,403 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:55:19,403 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:55:19,403 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:55:19,403 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:19,404 INFO ]: Start difference. First operand 52 states and 90 transitions. Second operand 6 states. [2018-06-22 11:55:19,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:19,640 INFO ]: Finished difference Result 59 states and 101 transitions. [2018-06-22 11:55:19,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:55:19,640 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:55:19,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:19,641 INFO ]: With dead ends: 59 [2018-06-22 11:55:19,641 INFO ]: Without dead ends: 55 [2018-06-22 11:55:19,642 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:55:19,642 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:55:19,652 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-06-22 11:55:19,652 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:55:19,653 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-06-22 11:55:19,653 INFO ]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 21 [2018-06-22 11:55:19,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:19,653 INFO ]: Abstraction has 52 states and 89 transitions. [2018-06-22 11:55:19,653 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:55:19,654 INFO ]: Start isEmpty. Operand 52 states and 89 transitions. [2018-06-22 11:55:19,655 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:19,655 INFO ]: Found error trace [2018-06-22 11:55:19,655 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:19,655 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:19,655 INFO ]: Analyzing trace with hash 1692423167, now seen corresponding path program 1 times [2018-06-22 11:55:19,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:19,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:19,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:19,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:19,695 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:55:19,695 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:19,695 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:55:19,695 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:55:19,695 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:55:19,695 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:19,696 INFO ]: Start difference. First operand 52 states and 89 transitions. Second operand 5 states. [2018-06-22 11:55:19,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:19,789 INFO ]: Finished difference Result 63 states and 113 transitions. [2018-06-22 11:55:19,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:55:19,789 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:55:19,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:19,790 INFO ]: With dead ends: 63 [2018-06-22 11:55:19,790 INFO ]: Without dead ends: 63 [2018-06-22 11:55:19,790 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:19,791 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:55:19,798 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-06-22 11:55:19,798 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:55:19,799 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 111 transitions. [2018-06-22 11:55:19,799 INFO ]: Start accepts. Automaton has 61 states and 111 transitions. Word has length 21 [2018-06-22 11:55:19,799 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:19,799 INFO ]: Abstraction has 61 states and 111 transitions. [2018-06-22 11:55:19,799 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:55:19,799 INFO ]: Start isEmpty. Operand 61 states and 111 transitions. [2018-06-22 11:55:19,800 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:19,800 INFO ]: Found error trace [2018-06-22 11:55:19,800 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:19,801 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:19,801 INFO ]: Analyzing trace with hash -1260641403, now seen corresponding path program 1 times [2018-06-22 11:55:19,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:19,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:19,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:19,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:19,859 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:19,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:19,859 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:55:19,860 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:55:19,860 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:55:19,860 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:19,860 INFO ]: Start difference. First operand 61 states and 111 transitions. Second operand 6 states. [2018-06-22 11:55:19,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:19,968 INFO ]: Finished difference Result 66 states and 117 transitions. [2018-06-22 11:55:19,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:55:19,969 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:55:19,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:19,970 INFO ]: With dead ends: 66 [2018-06-22 11:55:19,970 INFO ]: Without dead ends: 59 [2018-06-22 11:55:19,970 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:55:19,971 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:55:19,978 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-06-22 11:55:19,978 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:55:19,979 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2018-06-22 11:55:19,979 INFO ]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 21 [2018-06-22 11:55:19,979 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:19,979 INFO ]: Abstraction has 59 states and 104 transitions. [2018-06-22 11:55:19,980 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:55:19,980 INFO ]: Start isEmpty. Operand 59 states and 104 transitions. [2018-06-22 11:55:19,980 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:19,980 INFO ]: Found error trace [2018-06-22 11:55:19,980 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:19,981 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:19,981 INFO ]: Analyzing trace with hash 568499145, now seen corresponding path program 1 times [2018-06-22 11:55:19,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:19,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:19,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:19,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:19,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:20,034 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:55:20,034 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:20,034 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:55:20,034 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:55:20,034 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:55:20,034 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:20,035 INFO ]: Start difference. First operand 59 states and 104 transitions. Second operand 5 states. [2018-06-22 11:55:20,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:20,101 INFO ]: Finished difference Result 59 states and 102 transitions. [2018-06-22 11:55:20,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:55:20,101 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:55:20,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:20,102 INFO ]: With dead ends: 59 [2018-06-22 11:55:20,102 INFO ]: Without dead ends: 58 [2018-06-22 11:55:20,102 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:20,102 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:55:20,106 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-06-22 11:55:20,106 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:55:20,107 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-06-22 11:55:20,107 INFO ]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 21 [2018-06-22 11:55:20,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:20,108 INFO ]: Abstraction has 58 states and 100 transitions. [2018-06-22 11:55:20,108 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:55:20,108 INFO ]: Start isEmpty. Operand 58 states and 100 transitions. [2018-06-22 11:55:20,109 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:20,109 INFO ]: Found error trace [2018-06-22 11:55:20,109 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:20,109 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:20,109 INFO ]: Analyzing trace with hash 73729915, now seen corresponding path program 1 times [2018-06-22 11:55:20,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:20,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:20,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:20,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:20,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:20,117 INFO ]: Conjunction of SSA is sat [2018-06-22 11:55:20,118 INFO ]: Counterexample might be feasible [2018-06-22 11:55:20,133 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:55:20 BoogieIcfgContainer [2018-06-22 11:55:20,134 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:55:20,134 INFO ]: Toolchain (without parser) took 3937.23 ms. Allocated memory was 309.9 MB in the beginning and 327.2 MB in the end (delta: 17.3 MB). Free memory was 262.2 MB in the beginning and 206.5 MB in the end (delta: 55.7 MB). Peak memory consumption was 73.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:20,135 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:55:20,138 INFO ]: ChcToBoogie took 59.18 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:20,138 INFO ]: Boogie Preprocessor took 67.27 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 258.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:20,139 INFO ]: RCFGBuilder took 489.12 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 240.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:20,139 INFO ]: TraceAbstraction took 3313.18 ms. Allocated memory was 309.9 MB in the beginning and 327.2 MB in the end (delta: 17.3 MB). Free memory was 240.3 MB in the beginning and 206.5 MB in the end (delta: 33.8 MB). Peak memory consumption was 51.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:20,145 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.9 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.18 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 260.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 67.27 ms. Allocated memory is still 309.9 MB. Free memory was 260.3 MB in the beginning and 258.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 489.12 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 240.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3313.18 ms. Allocated memory was 309.9 MB in the beginning and 327.2 MB in the end (delta: 17.3 MB). Free memory was 240.3 MB in the beginning and 206.5 MB in the end (delta: 33.8 MB). Peak memory consumption was 51.1 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 False(); [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] CALL call INV_REC_f__1(hbv_False_1_Int - 1, hbv_False_3_Int + 1, hbv_False_5_Int); [L0] assume !(hhv_INV_REC_f__1_0_Int == 0); [L0] CALL call INV_REC_f__1(hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_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] CALL call INV_REC_f__1_PRE(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 INV_REC_f__1_PRE(hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int); [L0] RET call INV_REC_f__1(hhv_INV_REC_f__1_0_Int - 1, hhv_INV_REC_f__1_1_Int + 1, hhv_INV_REC_f__1_2_Int); [L0] CALL call INV_REC_f__1_PRE(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 INV_REC_f__1_PRE(hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int); [L0] RET call INV_REC_f__1(hbv_False_1_Int - 1, hbv_False_3_Int + 1, hbv_False_5_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 59 locations, 1 error locations. UNSAFE Result, 3.2s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1105 SDtfs, 18 SDslu, 2219 SDs, 0 SdLazy, 281 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=6, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 20 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 6016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 18/18 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_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-55-20-161.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__add-horn!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-55-20-161.csv Received shutdown request...