java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/id_build.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:33:33,052 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:33:33,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:33:33,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:33:33,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:33:33,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:33:33,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:33:33,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:33:33,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:33:33,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:33:33,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:33:33,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:33:33,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:33:33,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:33:33,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:33:33,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:33:33,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:33:33,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:33:33,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:33:33,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:33:33,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:33:33,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:33:33,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:33:33,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:33:33,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:33:33,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:33:33,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:33:33,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:33:33,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:33:33,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:33:33,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:33:33,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:33:33,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:33:33,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:33:33,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:33:33,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:33:33,118 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:33:33,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:33:33,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:33:33,136 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:33:33,137 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:33:33,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:33:33,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:33:33,138 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:33:33,138 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:33:33,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:33:33,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:33:33,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:33:33,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:33:33,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:33:33,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:33:33,140 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:33:33,140 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:33:33,140 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:33:33,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:33:33,140 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:33:33,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:33:33,141 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:33:33,142 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:33:33,142 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:33:33,188 INFO ]: Repository-Root is: /tmp [2018-06-26 21:33:33,204 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:33:33,209 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:33:33,211 INFO ]: Initializing SmtParser... [2018-06-26 21:33:33,211 INFO ]: SmtParser initialized [2018-06-26 21:33:33,212 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/id_build.c.smt2 [2018-06-26 21:33:33,213 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-26 21:33:33,303 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/id_build.c.smt2 unknown [2018-06-26 21:33:33,566 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/id_build.c.smt2 [2018-06-26 21:33:33,570 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:33:33,577 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:33:33,578 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:33:33,578 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:33:33,578 INFO ]: ChcToBoogie initialized [2018-06-26 21:33:33,581 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,633 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33 Unit [2018-06-26 21:33:33,633 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:33:33,633 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:33:33,634 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:33:33,634 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:33:33,655 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,655 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,665 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,665 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,678 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,680 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,681 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,682 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:33:33,683 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:33:33,683 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:33:33,683 INFO ]: RCFGBuilder initialized [2018-06-26 21:33:33,693 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:33:33,705 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:33:33,705 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:33:33,706 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:33:33,706 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:33:33,706 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:33:33,706 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:33:33,865 INFO ]: Using library mode [2018-06-26 21:33:33,866 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:33:33 BoogieIcfgContainer [2018-06-26 21:33:33,866 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:33:33,866 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:33:33,866 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:33:33,867 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:33:33,868 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:33:33" (1/1) ... [2018-06-26 21:33:33,883 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:33:33,884 INFO ]: Using Remove infeasible edges [2018-06-26 21:33:33,885 INFO ]: Using Maximize final states [2018-06-26 21:33:33,885 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:33:33,885 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:33:33,887 INFO ]: Using Remove sink states [2018-06-26 21:33:33,887 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:33:33,887 INFO ]: Using Use SBE [2018-06-26 21:33:33,912 WARN ]: expecting exponential blowup for input size 24 [2018-06-26 21:33:45,118 INFO ]: SBE split 2 edges [2018-06-26 21:33:45,127 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:33:45,129 INFO ]: 0 new accepting states [2018-06-26 21:33:45,187 INFO ]: Removed 5 edges and 2 locations by large block encoding [2018-06-26 21:33:45,189 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:33:45,193 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:33:45,194 INFO ]: 0 new accepting states [2018-06-26 21:33:45,194 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:33:45,194 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:33:45,207 INFO ]: Encoded RCFG 6 locations, 94 edges [2018-06-26 21:33:45,207 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:33:45 BasicIcfg [2018-06-26 21:33:45,207 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:33:45,208 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:33:45,208 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:33:45,211 INFO ]: TraceAbstraction initialized [2018-06-26 21:33:45,211 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:33:33" (1/4) ... [2018-06-26 21:33:45,212 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cb7bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:33:45, skipping insertion in model container [2018-06-26 21:33:45,212 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:33" (2/4) ... [2018-06-26 21:33:45,213 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cb7bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:33:45, skipping insertion in model container [2018-06-26 21:33:45,213 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:33:33" (3/4) ... [2018-06-26 21:33:45,213 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cb7bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:33:45, skipping insertion in model container [2018-06-26 21:33:45,213 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:33:45" (4/4) ... [2018-06-26 21:33:45,224 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:33:45,240 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:33:45,255 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:33:45,314 INFO ]: Using default assertion order modulation [2018-06-26 21:33:45,315 INFO ]: Interprodecural is true [2018-06-26 21:33:45,315 INFO ]: Hoare is false [2018-06-26 21:33:45,315 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:33:45,315 INFO ]: Backedges is TWOTRACK [2018-06-26 21:33:45,315 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:33:45,315 INFO ]: Difference is false [2018-06-26 21:33:45,315 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:33:45,315 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:33:45,325 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:33:45,339 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:33:45,339 INFO ]: Found error trace [2018-06-26 21:33:45,340 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:33:45,340 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:45,345 INFO ]: Analyzing trace with hash 38171203, now seen corresponding path program 1 times [2018-06-26 21:33:45,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:45,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:45,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:45,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:45,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:45,421 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:45,482 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:33:45,484 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:45,485 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:45,489 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:45,499 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:45,500 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:45,503 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:33:46,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:46,665 INFO ]: Finished difference Result 7 states and 139 transitions. [2018-06-26 21:33:46,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:46,679 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:33:46,679 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:46,689 INFO ]: With dead ends: 7 [2018-06-26 21:33:46,689 INFO ]: Without dead ends: 7 [2018-06-26 21:33:46,692 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:46,708 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:33:46,726 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:33:46,728 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:33:46,728 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2018-06-26 21:33:46,730 INFO ]: Start accepts. Automaton has 7 states and 139 transitions. Word has length 5 [2018-06-26 21:33:46,730 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:46,731 INFO ]: Abstraction has 7 states and 139 transitions. [2018-06-26 21:33:46,731 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:46,731 INFO ]: Start isEmpty. Operand 7 states and 139 transitions. [2018-06-26 21:33:46,731 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:33:46,731 INFO ]: Found error trace [2018-06-26 21:33:46,731 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:33:46,731 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:46,731 INFO ]: Analyzing trace with hash 38200994, now seen corresponding path program 1 times [2018-06-26 21:33:46,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:46,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:46,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:46,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:46,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:46,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:46,798 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:33:46,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:46,798 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:46,800 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:46,800 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:46,800 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:46,800 INFO ]: Start difference. First operand 7 states and 139 transitions. Second operand 3 states. [2018-06-26 21:33:48,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:48,028 INFO ]: Finished difference Result 9 states and 194 transitions. [2018-06-26 21:33:48,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:48,029 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:33:48,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:48,030 INFO ]: With dead ends: 9 [2018-06-26 21:33:48,030 INFO ]: Without dead ends: 9 [2018-06-26 21:33:48,031 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:48,031 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:33:48,035 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:33:48,035 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:33:48,036 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2018-06-26 21:33:48,036 INFO ]: Start accepts. Automaton has 9 states and 194 transitions. Word has length 5 [2018-06-26 21:33:48,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:48,036 INFO ]: Abstraction has 9 states and 194 transitions. [2018-06-26 21:33:48,036 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:48,036 INFO ]: Start isEmpty. Operand 9 states and 194 transitions. [2018-06-26 21:33:48,036 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:33:48,036 INFO ]: Found error trace [2018-06-26 21:33:48,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:33:48,036 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:48,036 INFO ]: Analyzing trace with hash 1183396825, now seen corresponding path program 1 times [2018-06-26 21:33:48,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:48,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:48,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:48,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:48,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:48,045 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:48,086 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:33:48,086 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:48,087 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:48,087 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:48,087 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:48,087 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:48,087 INFO ]: Start difference. First operand 9 states and 194 transitions. Second operand 3 states. [2018-06-26 21:33:48,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:48,408 INFO ]: Finished difference Result 13 states and 303 transitions. [2018-06-26 21:33:48,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:48,408 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:33:48,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:48,409 INFO ]: With dead ends: 13 [2018-06-26 21:33:48,409 INFO ]: Without dead ends: 13 [2018-06-26 21:33:48,410 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:48,410 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:33:48,414 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:33:48,414 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:33:48,415 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 303 transitions. [2018-06-26 21:33:48,415 INFO ]: Start accepts. Automaton has 13 states and 303 transitions. Word has length 6 [2018-06-26 21:33:48,415 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:48,415 INFO ]: Abstraction has 13 states and 303 transitions. [2018-06-26 21:33:48,415 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:48,416 INFO ]: Start isEmpty. Operand 13 states and 303 transitions. [2018-06-26 21:33:48,416 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:33:48,416 INFO ]: Found error trace [2018-06-26 21:33:48,416 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:48,416 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:48,416 INFO ]: Analyzing trace with hash -1991628016, now seen corresponding path program 1 times [2018-06-26 21:33:48,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:48,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:48,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:48,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:48,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:48,428 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:48,444 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:48,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:48,445 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:48,445 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:48,445 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:48,445 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:48,445 INFO ]: Start difference. First operand 13 states and 303 transitions. Second operand 3 states. [2018-06-26 21:33:48,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:48,710 INFO ]: Finished difference Result 13 states and 194 transitions. [2018-06-26 21:33:48,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:48,711 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 21:33:48,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:48,711 INFO ]: With dead ends: 13 [2018-06-26 21:33:48,712 INFO ]: Without dead ends: 13 [2018-06-26 21:33:48,712 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:48,712 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:33:48,717 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:33:48,717 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:33:48,718 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2018-06-26 21:33:48,718 INFO ]: Start accepts. Automaton has 13 states and 194 transitions. Word has length 7 [2018-06-26 21:33:48,718 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:48,718 INFO ]: Abstraction has 13 states and 194 transitions. [2018-06-26 21:33:48,718 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:48,718 INFO ]: Start isEmpty. Operand 13 states and 194 transitions. [2018-06-26 21:33:48,718 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:33:48,718 INFO ]: Found error trace [2018-06-26 21:33:48,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:48,718 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:48,719 INFO ]: Analyzing trace with hash -1962998865, now seen corresponding path program 1 times [2018-06-26 21:33:48,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:48,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:48,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:48,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:48,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:48,735 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:48,800 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:48,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:48,800 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:48,800 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:48,800 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:48,800 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:48,800 INFO ]: Start difference. First operand 13 states and 194 transitions. Second operand 3 states. [2018-06-26 21:33:49,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:49,049 INFO ]: Finished difference Result 13 states and 131 transitions. [2018-06-26 21:33:49,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:49,050 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 21:33:49,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:49,050 INFO ]: With dead ends: 13 [2018-06-26 21:33:49,050 INFO ]: Without dead ends: 13 [2018-06-26 21:33:49,051 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,051 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:33:49,053 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:33:49,053 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:33:49,054 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-06-26 21:33:49,054 INFO ]: Start accepts. Automaton has 13 states and 131 transitions. Word has length 7 [2018-06-26 21:33:49,054 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:49,054 INFO ]: Abstraction has 13 states and 131 transitions. [2018-06-26 21:33:49,054 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:49,054 INFO ]: Start isEmpty. Operand 13 states and 131 transitions. [2018-06-26 21:33:49,054 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:33:49,054 INFO ]: Found error trace [2018-06-26 21:33:49,054 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:49,055 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:49,055 INFO ]: Analyzing trace with hash -1886195033, now seen corresponding path program 1 times [2018-06-26 21:33:49,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:49,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:49,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:49,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,067 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:49,102 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:49,102 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:49,102 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:49,102 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:49,102 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:49,102 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,103 INFO ]: Start difference. First operand 13 states and 131 transitions. Second operand 3 states. [2018-06-26 21:33:49,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:49,233 INFO ]: Finished difference Result 13 states and 94 transitions. [2018-06-26 21:33:49,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:49,233 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:33:49,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:49,233 INFO ]: With dead ends: 13 [2018-06-26 21:33:49,233 INFO ]: Without dead ends: 13 [2018-06-26 21:33:49,234 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,234 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:33:49,236 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:33:49,236 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:33:49,237 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2018-06-26 21:33:49,237 INFO ]: Start accepts. Automaton has 13 states and 94 transitions. Word has length 8 [2018-06-26 21:33:49,237 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:49,237 INFO ]: Abstraction has 13 states and 94 transitions. [2018-06-26 21:33:49,237 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:49,237 INFO ]: Start isEmpty. Operand 13 states and 94 transitions. [2018-06-26 21:33:49,237 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:33:49,237 INFO ]: Found error trace [2018-06-26 21:33:49,237 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:49,237 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:49,238 INFO ]: Analyzing trace with hash -1556498036, now seen corresponding path program 1 times [2018-06-26 21:33:49,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:49,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:49,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:49,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,246 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:49,265 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 21:33:49,265 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:49,265 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:49,265 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:49,265 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:49,265 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,265 INFO ]: Start difference. First operand 13 states and 94 transitions. Second operand 3 states. [2018-06-26 21:33:49,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:49,522 INFO ]: Finished difference Result 21 states and 150 transitions. [2018-06-26 21:33:49,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:49,524 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:33:49,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:49,525 INFO ]: With dead ends: 21 [2018-06-26 21:33:49,525 INFO ]: Without dead ends: 21 [2018-06-26 21:33:49,525 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,525 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 21:33:49,529 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 21:33:49,529 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 21:33:49,530 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2018-06-26 21:33:49,530 INFO ]: Start accepts. Automaton has 21 states and 150 transitions. Word has length 8 [2018-06-26 21:33:49,530 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:49,530 INFO ]: Abstraction has 21 states and 150 transitions. [2018-06-26 21:33:49,530 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:49,530 INFO ]: Start isEmpty. Operand 21 states and 150 transitions. [2018-06-26 21:33:49,530 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:33:49,530 INFO ]: Found error trace [2018-06-26 21:33:49,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:49,531 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:49,531 INFO ]: Analyzing trace with hash -983915016, now seen corresponding path program 1 times [2018-06-26 21:33:49,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:49,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:49,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:49,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:49,578 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:49,578 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:49,578 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:49,578 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:49,578 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:49,578 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,578 INFO ]: Start difference. First operand 21 states and 150 transitions. Second operand 3 states. [2018-06-26 21:33:49,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:49,764 INFO ]: Finished difference Result 19 states and 83 transitions. [2018-06-26 21:33:49,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:49,764 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:33:49,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:49,764 INFO ]: With dead ends: 19 [2018-06-26 21:33:49,764 INFO ]: Without dead ends: 19 [2018-06-26 21:33:49,765 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,765 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 21:33:49,767 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 21:33:49,767 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 21:33:49,767 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 83 transitions. [2018-06-26 21:33:49,767 INFO ]: Start accepts. Automaton has 19 states and 83 transitions. Word has length 8 [2018-06-26 21:33:49,767 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:49,767 INFO ]: Abstraction has 19 states and 83 transitions. [2018-06-26 21:33:49,767 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:49,767 INFO ]: Start isEmpty. Operand 19 states and 83 transitions. [2018-06-26 21:33:49,768 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:33:49,768 INFO ]: Found error trace [2018-06-26 21:33:49,768 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:49,768 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:49,768 INFO ]: Analyzing trace with hash -296731624, now seen corresponding path program 1 times [2018-06-26 21:33:49,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:49,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:49,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:49,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,786 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:49,820 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 21:33:49,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:49,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:49,820 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:49,820 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:49,820 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:49,821 INFO ]: Start difference. First operand 19 states and 83 transitions. Second operand 3 states. [2018-06-26 21:33:50,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:50,079 INFO ]: Finished difference Result 29 states and 117 transitions. [2018-06-26 21:33:50,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:50,079 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:33:50,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:50,080 INFO ]: With dead ends: 29 [2018-06-26 21:33:50,080 INFO ]: Without dead ends: 19 [2018-06-26 21:33:50,080 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:50,080 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 21:33:50,082 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-26 21:33:50,082 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 21:33:50,083 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2018-06-26 21:33:50,083 INFO ]: Start accepts. Automaton has 18 states and 63 transitions. Word has length 10 [2018-06-26 21:33:50,083 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:50,083 INFO ]: Abstraction has 18 states and 63 transitions. [2018-06-26 21:33:50,083 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:50,083 INFO ]: Start isEmpty. Operand 18 states and 63 transitions. [2018-06-26 21:33:50,083 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 21:33:50,083 INFO ]: Found error trace [2018-06-26 21:33:50,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:50,084 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:50,084 INFO ]: Analyzing trace with hash -1314939605, now seen corresponding path program 1 times [2018-06-26 21:33:50,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:50,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:50,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:50,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:50,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:50,093 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:50,134 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 21:33:50,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:50,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:50,134 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:50,134 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:50,134 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:50,134 INFO ]: Start difference. First operand 18 states and 63 transitions. Second operand 3 states. [2018-06-26 21:33:50,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:50,245 INFO ]: Finished difference Result 15 states and 48 transitions. [2018-06-26 21:33:50,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:50,245 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 21:33:50,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:50,245 INFO ]: With dead ends: 15 [2018-06-26 21:33:50,245 INFO ]: Without dead ends: 0 [2018-06-26 21:33:50,245 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:50,245 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:33:50,245 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:33:50,245 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:33:50,245 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:33:50,245 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-06-26 21:33:50,245 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:50,245 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:33:50,245 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:50,245 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:33:50,245 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:33:50,248 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:33:50,249 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:33:50 BasicIcfg [2018-06-26 21:33:50,249 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:33:50,249 INFO ]: Toolchain (without parser) took 16678.55 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 260.6 MB in the beginning and 649.1 MB in the end (delta: -388.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-26 21:33:50,251 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:33:50,251 INFO ]: ChcToBoogie took 55.50 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:50,252 INFO ]: Boogie Preprocessor took 49.00 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:50,252 INFO ]: RCFGBuilder took 182.91 ms. Allocated memory is still 307.2 MB. Free memory was 256.6 MB in the beginning and 247.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:50,253 INFO ]: BlockEncodingV2 took 11340.96 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 247.6 MB in the beginning and 1.1 GB in the end (delta: -824.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-26 21:33:50,253 INFO ]: TraceAbstraction took 5040.53 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 649.1 MB in the end (delta: 422.6 MB). Peak memory consumption was 422.6 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:50,257 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 94 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.50 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.00 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 182.91 ms. Allocated memory is still 307.2 MB. Free memory was 256.6 MB in the beginning and 247.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 11340.96 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 247.6 MB in the beginning and 1.1 GB in the end (delta: -824.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. * TraceAbstraction took 5040.53 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 649.1 MB in the end (delta: 422.6 MB). Peak memory consumption was 422.6 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, 6 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 4 SDslu, 29 SDs, 0 SdLazy, 1326 SolverSat, 880 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 68/68 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/id_build.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-33-50-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/id_build.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-33-50-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/id_build.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-33-50-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/id_build.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-33-50-269.csv Received shutdown request...