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/HOLA/09.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:56:21,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:56:21,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:56:21,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:56:21,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:56:21,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:56:21,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:56:21,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:56:21,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:56:21,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:56:21,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:56:21,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:56:21,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:56:21,047 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:56:21,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:56:21,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:56:21,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:56:21,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:56:21,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:56:21,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:56:21,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:56:21,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:56:21,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:56:21,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:56:21,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:56:21,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:56:21,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:56:21,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:56:21,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:56:21,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:56:21,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:56:21,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:56:21,077 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:56:21,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:56:21,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:56:21,078 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:56:21,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:56:21,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:56:21,095 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:56:21,095 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:56:21,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:56:21,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:56:21,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:56:21,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:56:21,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:56:21,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:56:21,097 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:56:21,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:56:21,098 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:56:21,098 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:56:21,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:56:21,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:56:21,098 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:56:21,100 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:56:21,100 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:56:21,158 INFO ]: Repository-Root is: /tmp [2018-06-22 00:56:21,174 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:56:21,180 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:56:21,181 INFO ]: Initializing SmtParser... [2018-06-22 00:56:21,182 INFO ]: SmtParser initialized [2018-06-22 00:56:21,182 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/09.c.smt2 [2018-06-22 00:56:21,184 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 00:56:21,269 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/09.c.smt2 unknown [2018-06-22 00:56:21,971 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/09.c.smt2 [2018-06-22 00:56:21,976 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:56:21,981 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:56:21,981 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:56:21,981 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:56:21,982 INFO ]: ChcToBoogie initialized [2018-06-22 00:56:21,985 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:56:21" (1/1) ... [2018-06-22 00:56:22,125 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22 Unit [2018-06-22 00:56:22,128 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:56:22,129 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:56:22,129 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:56:22,129 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:56:22,150 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,150 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,179 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,180 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,190 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,192 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,195 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (1/1) ... [2018-06-22 00:56:22,202 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:56:22,203 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:56:22,203 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:56:22,203 INFO ]: RCFGBuilder initialized [2018-06-22 00:56:22,204 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (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 00:56:22,218 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:56:22,218 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:56:22,218 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:56:22,218 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:56:22,218 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:56:22,218 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 00:56:23,623 INFO ]: Using library mode [2018-06-22 00:56:23,623 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:56:23 BoogieIcfgContainer [2018-06-22 00:56:23,623 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:56:23,625 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:56:23,625 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:56:23,628 INFO ]: TraceAbstraction initialized [2018-06-22 00:56:23,628 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:56:21" (1/3) ... [2018-06-22 00:56:23,629 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4f3ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:56:23, skipping insertion in model container [2018-06-22 00:56:23,629 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:56:22" (2/3) ... [2018-06-22 00:56:23,629 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4f3ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:56:23, skipping insertion in model container [2018-06-22 00:56:23,629 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:56:23" (3/3) ... [2018-06-22 00:56:23,631 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:56:23,640 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:56:23,647 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:56:23,717 INFO ]: Using default assertion order modulation [2018-06-22 00:56:23,718 INFO ]: Interprodecural is true [2018-06-22 00:56:23,718 INFO ]: Hoare is false [2018-06-22 00:56:23,718 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:56:23,718 INFO ]: Backedges is TWOTRACK [2018-06-22 00:56:23,718 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:56:23,718 INFO ]: Difference is false [2018-06-22 00:56:23,718 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:56:23,718 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:56:23,734 INFO ]: Start isEmpty. Operand 61 states. [2018-06-22 00:56:23,752 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:56:23,752 INFO ]: Found error trace [2018-06-22 00:56:23,753 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:23,753 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:23,757 INFO ]: Analyzing trace with hash -1682953120, now seen corresponding path program 1 times [2018-06-22 00:56:23,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:23,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:23,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:23,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:23,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:23,984 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:25,774 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:25,777 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:25,777 INFO ]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2018-06-22 00:56:25,779 INFO ]: Interpolant automaton has 38 states [2018-06-22 00:56:25,792 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 00:56:25,795 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 00:56:25,798 INFO ]: Start difference. First operand 61 states. Second operand 38 states. [2018-06-22 00:56:29,317 WARN ]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-22 00:56:30,203 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-06-22 00:56:31,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:31,103 INFO ]: Finished difference Result 220 states and 250 transitions. [2018-06-22 00:56:31,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 00:56:31,108 INFO ]: Start accepts. Automaton has 38 states. Word has length 44 [2018-06-22 00:56:31,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:31,122 INFO ]: With dead ends: 220 [2018-06-22 00:56:31,122 INFO ]: Without dead ends: 217 [2018-06-22 00:56:31,125 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1925, Invalid=4717, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 00:56:31,143 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-22 00:56:31,188 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 92. [2018-06-22 00:56:31,189 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 00:56:31,194 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-06-22 00:56:31,195 INFO ]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 44 [2018-06-22 00:56:31,196 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:31,196 INFO ]: Abstraction has 92 states and 104 transitions. [2018-06-22 00:56:31,196 INFO ]: Interpolant automaton has 38 states. [2018-06-22 00:56:31,196 INFO ]: Start isEmpty. Operand 92 states and 104 transitions. [2018-06-22 00:56:31,201 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 00:56:31,201 INFO ]: Found error trace [2018-06-22 00:56:31,201 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:31,201 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:31,202 INFO ]: Analyzing trace with hash -825010944, now seen corresponding path program 1 times [2018-06-22 00:56:31,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:31,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:31,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:31,203 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:31,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:31,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:32,369 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:32,369 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:32,369 INFO ]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2018-06-22 00:56:32,371 INFO ]: Interpolant automaton has 39 states [2018-06-22 00:56:32,371 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 00:56:32,371 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 00:56:32,371 INFO ]: Start difference. First operand 92 states and 104 transitions. Second operand 39 states. [2018-06-22 00:56:34,531 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-06-22 00:56:35,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:35,893 INFO ]: Finished difference Result 224 states and 254 transitions. [2018-06-22 00:56:35,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 00:56:35,894 INFO ]: Start accepts. Automaton has 39 states. Word has length 45 [2018-06-22 00:56:35,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:35,897 INFO ]: With dead ends: 224 [2018-06-22 00:56:35,897 INFO ]: Without dead ends: 221 [2018-06-22 00:56:35,899 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2013, Invalid=4959, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 00:56:35,900 INFO ]: Start minimizeSevpa. Operand 221 states. [2018-06-22 00:56:35,912 INFO ]: Finished minimizeSevpa. Reduced states from 221 to 94. [2018-06-22 00:56:35,912 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 00:56:35,913 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-06-22 00:56:35,913 INFO ]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 45 [2018-06-22 00:56:35,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:35,914 INFO ]: Abstraction has 94 states and 106 transitions. [2018-06-22 00:56:35,914 INFO ]: Interpolant automaton has 39 states. [2018-06-22 00:56:35,914 INFO ]: Start isEmpty. Operand 94 states and 106 transitions. [2018-06-22 00:56:35,916 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 00:56:35,916 INFO ]: Found error trace [2018-06-22 00:56:35,916 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:35,916 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:35,917 INFO ]: Analyzing trace with hash 2131142459, now seen corresponding path program 1 times [2018-06-22 00:56:35,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:35,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:35,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:35,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:35,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:35,958 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:36,497 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:36,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:36,497 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 00:56:36,498 INFO ]: Interpolant automaton has 7 states [2018-06-22 00:56:36,498 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 00:56:36,498 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 00:56:36,498 INFO ]: Start difference. First operand 94 states and 106 transitions. Second operand 7 states. [2018-06-22 00:56:36,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:36,923 INFO ]: Finished difference Result 138 states and 156 transitions. [2018-06-22 00:56:36,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 00:56:36,924 INFO ]: Start accepts. Automaton has 7 states. Word has length 49 [2018-06-22 00:56:36,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:36,925 INFO ]: With dead ends: 138 [2018-06-22 00:56:36,925 INFO ]: Without dead ends: 137 [2018-06-22 00:56:36,926 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:56:36,926 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 00:56:36,933 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 98. [2018-06-22 00:56:36,933 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 00:56:36,934 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-06-22 00:56:36,934 INFO ]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 49 [2018-06-22 00:56:36,934 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:36,934 INFO ]: Abstraction has 98 states and 110 transitions. [2018-06-22 00:56:36,934 INFO ]: Interpolant automaton has 7 states. [2018-06-22 00:56:36,934 INFO ]: Start isEmpty. Operand 98 states and 110 transitions. [2018-06-22 00:56:36,936 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 00:56:36,936 INFO ]: Found error trace [2018-06-22 00:56:36,936 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:36,936 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:36,936 INFO ]: Analyzing trace with hash -185227397, now seen corresponding path program 1 times [2018-06-22 00:56:36,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:36,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:36,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:36,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:36,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:36,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:37,166 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:37,166 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:37,166 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 00:56:37,166 INFO ]: Interpolant automaton has 7 states [2018-06-22 00:56:37,166 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 00:56:37,167 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 00:56:37,167 INFO ]: Start difference. First operand 98 states and 110 transitions. Second operand 7 states. [2018-06-22 00:56:37,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:37,228 INFO ]: Finished difference Result 93 states and 102 transitions. [2018-06-22 00:56:37,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 00:56:37,228 INFO ]: Start accepts. Automaton has 7 states. Word has length 49 [2018-06-22 00:56:37,228 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:37,229 INFO ]: With dead ends: 93 [2018-06-22 00:56:37,229 INFO ]: Without dead ends: 92 [2018-06-22 00:56:37,229 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:56:37,229 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 00:56:37,234 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-06-22 00:56:37,234 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 00:56:37,236 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-06-22 00:56:37,236 INFO ]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 49 [2018-06-22 00:56:37,236 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:37,236 INFO ]: Abstraction has 92 states and 100 transitions. [2018-06-22 00:56:37,236 INFO ]: Interpolant automaton has 7 states. [2018-06-22 00:56:37,236 INFO ]: Start isEmpty. Operand 92 states and 100 transitions. [2018-06-22 00:56:37,237 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 00:56:37,237 INFO ]: Found error trace [2018-06-22 00:56:37,238 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:37,238 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:37,238 INFO ]: Analyzing trace with hash 1931375254, now seen corresponding path program 1 times [2018-06-22 00:56:37,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:37,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:37,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:37,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:37,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:37,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:37,494 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:37,494 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:37,494 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:56:37,494 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:56:37,494 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:56:37,494 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:56:37,494 INFO ]: Start difference. First operand 92 states and 100 transitions. Second operand 8 states. [2018-06-22 00:56:37,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:37,577 INFO ]: Finished difference Result 115 states and 125 transitions. [2018-06-22 00:56:37,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 00:56:37,578 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-22 00:56:37,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:37,578 INFO ]: With dead ends: 115 [2018-06-22 00:56:37,578 INFO ]: Without dead ends: 114 [2018-06-22 00:56:37,579 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-06-22 00:56:37,579 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-22 00:56:37,588 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-06-22 00:56:37,588 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 00:56:37,589 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-06-22 00:56:37,589 INFO ]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2018-06-22 00:56:37,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:37,590 INFO ]: Abstraction has 97 states and 106 transitions. [2018-06-22 00:56:37,590 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:56:37,590 INFO ]: Start isEmpty. Operand 97 states and 106 transitions. [2018-06-22 00:56:37,591 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 00:56:37,591 INFO ]: Found error trace [2018-06-22 00:56:37,591 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:37,591 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:37,591 INFO ]: Analyzing trace with hash 1602734678, now seen corresponding path program 1 times [2018-06-22 00:56:37,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:37,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:37,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:37,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:37,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:37,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:37,734 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:37,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:37,734 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:56:37,734 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:56:37,735 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:56:37,735 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:56:37,735 INFO ]: Start difference. First operand 97 states and 106 transitions. Second operand 8 states. [2018-06-22 00:56:37,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:37,823 INFO ]: Finished difference Result 91 states and 97 transitions. [2018-06-22 00:56:37,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 00:56:37,824 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-22 00:56:37,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:37,824 INFO ]: With dead ends: 91 [2018-06-22 00:56:37,824 INFO ]: Without dead ends: 75 [2018-06-22 00:56:37,825 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:56:37,825 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 00:56:37,828 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-22 00:56:37,828 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 00:56:37,829 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-06-22 00:56:37,829 INFO ]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 50 [2018-06-22 00:56:37,829 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:37,829 INFO ]: Abstraction has 75 states and 79 transitions. [2018-06-22 00:56:37,829 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:56:37,829 INFO ]: Start isEmpty. Operand 75 states and 79 transitions. [2018-06-22 00:56:37,830 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 00:56:37,830 INFO ]: Found error trace [2018-06-22 00:56:37,830 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:37,830 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:37,830 INFO ]: Analyzing trace with hash -354374348, now seen corresponding path program 1 times [2018-06-22 00:56:37,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:37,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:37,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:37,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:37,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:37,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:38,275 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:38,276 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:38,276 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:56:38,276 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:56:38,276 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:56:38,276 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:56:38,276 INFO ]: Start difference. First operand 75 states and 79 transitions. Second operand 8 states. [2018-06-22 00:56:38,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:38,400 INFO ]: Finished difference Result 126 states and 134 transitions. [2018-06-22 00:56:38,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 00:56:38,400 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-22 00:56:38,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:38,401 INFO ]: With dead ends: 126 [2018-06-22 00:56:38,401 INFO ]: Without dead ends: 125 [2018-06-22 00:56:38,401 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-06-22 00:56:38,401 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 00:56:38,405 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 80. [2018-06-22 00:56:38,405 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 00:56:38,406 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-06-22 00:56:38,406 INFO ]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 50 [2018-06-22 00:56:38,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:38,406 INFO ]: Abstraction has 80 states and 85 transitions. [2018-06-22 00:56:38,406 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:56:38,406 INFO ]: Start isEmpty. Operand 80 states and 85 transitions. [2018-06-22 00:56:38,407 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 00:56:38,407 INFO ]: Found error trace [2018-06-22 00:56:38,407 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:38,407 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:38,407 INFO ]: Analyzing trace with hash -347839244, now seen corresponding path program 1 times [2018-06-22 00:56:38,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:38,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:38,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:38,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:38,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:38,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:38,655 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:38,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:38,656 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:56:38,656 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:56:38,657 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:56:38,657 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:56:38,657 INFO ]: Start difference. First operand 80 states and 85 transitions. Second operand 8 states. [2018-06-22 00:56:38,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:38,705 INFO ]: Finished difference Result 74 states and 76 transitions. [2018-06-22 00:56:38,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 00:56:38,706 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-22 00:56:38,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:38,706 INFO ]: With dead ends: 74 [2018-06-22 00:56:38,706 INFO ]: Without dead ends: 53 [2018-06-22 00:56:38,707 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:56:38,707 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 00:56:38,709 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-22 00:56:38,709 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 00:56:38,710 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-06-22 00:56:38,710 INFO ]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-06-22 00:56:38,711 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:38,711 INFO ]: Abstraction has 53 states and 54 transitions. [2018-06-22 00:56:38,711 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:56:38,711 INFO ]: Start isEmpty. Operand 53 states and 54 transitions. [2018-06-22 00:56:38,711 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 00:56:38,712 INFO ]: Found error trace [2018-06-22 00:56:38,712 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:56:38,712 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:38,712 INFO ]: Analyzing trace with hash 832857770, now seen corresponding path program 1 times [2018-06-22 00:56:38,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:38,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:38,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:38,712 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:38,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:38,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:39,176 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:39,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:39,200 INFO ]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-06-22 00:56:39,201 INFO ]: Interpolant automaton has 29 states [2018-06-22 00:56:39,201 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 00:56:39,201 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:56:39,201 INFO ]: Start difference. First operand 53 states and 54 transitions. Second operand 29 states. [2018-06-22 00:56:40,583 WARN ]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-06-22 00:56:40,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:40,905 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-22 00:56:40,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 00:56:40,905 INFO ]: Start accepts. Automaton has 29 states. Word has length 50 [2018-06-22 00:56:40,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:40,905 INFO ]: With dead ends: 39 [2018-06-22 00:56:40,905 INFO ]: Without dead ends: 0 [2018-06-22 00:56:40,906 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=809, Invalid=2161, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 00:56:40,906 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:56:40,906 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:56:40,906 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:56:40,906 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:56:40,906 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-06-22 00:56:40,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:40,906 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:56:40,906 INFO ]: Interpolant automaton has 29 states. [2018-06-22 00:56:40,906 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:56:40,906 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:56:40,910 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:56:40 BoogieIcfgContainer [2018-06-22 00:56:40,910 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:56:40,911 INFO ]: Toolchain (without parser) took 18934.87 ms. Allocated memory was 303.0 MB in the beginning and 591.4 MB in the end (delta: 288.4 MB). Free memory was 213.0 MB in the beginning and 463.0 MB in the end (delta: -250.0 MB). Peak memory consumption was 38.4 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:40,912 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:56:40,912 INFO ]: ChcToBoogie took 146.80 ms. Allocated memory is still 303.0 MB. Free memory was 211.0 MB in the beginning and 209.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:40,912 INFO ]: Boogie Preprocessor took 73.54 ms. Allocated memory is still 303.0 MB. Free memory was 209.0 MB in the beginning and 205.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:40,913 INFO ]: RCFGBuilder took 1420.54 ms. Allocated memory was 303.0 MB in the beginning and 323.5 MB in the end (delta: 20.4 MB). Free memory was 205.1 MB in the beginning and 231.7 MB in the end (delta: -26.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:40,913 INFO ]: TraceAbstraction took 17285.50 ms. Allocated memory was 323.5 MB in the beginning and 591.4 MB in the end (delta: 267.9 MB). Free memory was 231.7 MB in the beginning and 463.0 MB in the end (delta: -231.4 MB). Peak memory consumption was 36.5 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:40,922 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 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 146.80 ms. Allocated memory is still 303.0 MB. Free memory was 211.0 MB in the beginning and 209.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 73.54 ms. Allocated memory is still 303.0 MB. Free memory was 209.0 MB in the beginning and 205.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1420.54 ms. Allocated memory was 303.0 MB in the beginning and 323.5 MB in the end (delta: 20.4 MB). Free memory was 205.1 MB in the beginning and 231.7 MB in the end (delta: -26.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 17285.50 ms. Allocated memory was 323.5 MB in the beginning and 591.4 MB in the end (delta: 267.9 MB). Free memory was 231.7 MB in the beginning and 463.0 MB in the end (delta: -231.4 MB). Peak memory consumption was 36.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. SAFE Result, 17.2s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 5305 SDslu, 6107 SDs, 0 SdLazy, 2399 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, 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, 9 MinimizatonAttempts, 353 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 437 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 37354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 26/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/09.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-56-40-940.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/09.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-56-40-940.csv Received shutdown request...