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/llreve-bench/smt2/loop__digits10_inl.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:45:09,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:45:09,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:45:09,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:45:09,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:45:09,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:45:09,407 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:45:09,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:45:09,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:45:09,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:45:09,416 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:45:09,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:45:09,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:45:09,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:45:09,419 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:45:09,420 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:45:09,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:45:09,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:45:09,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:45:09,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:45:09,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:45:09,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:45:09,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:45:09,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:45:09,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:45:09,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:45:09,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:45:09,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:45:09,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:45:09,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:45:09,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:45:09,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:45:09,435 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:45:09,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:45:09,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:45:09,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:45:09,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:45:09,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:45:09,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:45:09,451 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:45:09,452 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:45:09,453 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:45:09,453 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:45:09,453 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:45:09,453 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:45:09,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:45:09,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:45:09,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:45:09,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:45:09,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:45:09,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:45:09,455 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:45:09,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:45:09,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:45:09,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:45:09,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:45:09,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:45:09,456 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:45:09,458 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:45:09,458 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:45:09,503 INFO ]: Repository-Root is: /tmp [2018-06-26 18:45:09,521 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:45:09,525 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:45:09,527 INFO ]: Initializing SmtParser... [2018-06-26 18:45:09,527 INFO ]: SmtParser initialized [2018-06-26 18:45:09,528 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-26 18:45:09,529 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 18:45:09,620 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3ae75770 [2018-06-26 18:45:10,143 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-26 18:45:10,148 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:45:10,154 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:45:10,154 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:45:10,154 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:45:10,155 INFO ]: ChcToBoogie initialized [2018-06-26 18:45:10,158 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,224 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10 Unit [2018-06-26 18:45:10,224 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:45:10,225 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:45:10,225 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:45:10,225 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:45:10,247 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,247 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,256 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,256 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,263 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,267 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,269 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,272 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:45:10,272 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:45:10,272 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:45:10,272 INFO ]: RCFGBuilder initialized [2018-06-26 18:45:10,273 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (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 18:45:10,298 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:45:10,298 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:45:10,298 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:45:10,298 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:45:10,298 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:45:10,298 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 18:45:10,968 INFO ]: Using library mode [2018-06-26 18:45:10,968 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:10 BoogieIcfgContainer [2018-06-26 18:45:10,968 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:45:10,969 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:45:10,969 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:45:10,970 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:45:10,970 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:10" (1/1) ... [2018-06-26 18:45:10,985 INFO ]: Initial Icfg 10 locations, 38 edges [2018-06-26 18:45:10,987 INFO ]: Using Remove infeasible edges [2018-06-26 18:45:10,987 INFO ]: Using Maximize final states [2018-06-26 18:45:10,988 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:45:10,988 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:45:10,989 INFO ]: Using Remove sink states [2018-06-26 18:45:10,990 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:45:10,990 INFO ]: Using Use SBE [2018-06-26 18:45:11,052 INFO ]: SBE split 9 edges [2018-06-26 18:45:11,059 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:45:11,062 INFO ]: 0 new accepting states [2018-06-26 18:45:11,080 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:45:11,082 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:45:11,087 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:45:11,087 INFO ]: 0 new accepting states [2018-06-26 18:45:11,088 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:45:11,088 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:45:11,092 INFO ]: Encoded RCFG 6 locations, 96 edges [2018-06-26 18:45:11,092 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:45:11 BasicIcfg [2018-06-26 18:45:11,092 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:45:11,093 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:45:11,093 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:45:11,097 INFO ]: TraceAbstraction initialized [2018-06-26 18:45:11,097 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:45:10" (1/4) ... [2018-06-26 18:45:11,098 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fbdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:45:11, skipping insertion in model container [2018-06-26 18:45:11,099 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:10" (2/4) ... [2018-06-26 18:45:11,099 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fbdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:45:11, skipping insertion in model container [2018-06-26 18:45:11,099 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:10" (3/4) ... [2018-06-26 18:45:11,099 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fbdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:45:11, skipping insertion in model container [2018-06-26 18:45:11,099 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:45:11" (4/4) ... [2018-06-26 18:45:11,102 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:45:11,111 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:45:11,117 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:45:11,153 INFO ]: Using default assertion order modulation [2018-06-26 18:45:11,153 INFO ]: Interprodecural is true [2018-06-26 18:45:11,153 INFO ]: Hoare is false [2018-06-26 18:45:11,153 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:45:11,153 INFO ]: Backedges is TWOTRACK [2018-06-26 18:45:11,153 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:45:11,153 INFO ]: Difference is false [2018-06-26 18:45:11,153 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:45:11,153 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:45:11,165 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:45:11,179 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:45:11,179 INFO ]: Found error trace [2018-06-26 18:45:11,180 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:45:11,180 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:11,185 INFO ]: Analyzing trace with hash 36600834, now seen corresponding path program 1 times [2018-06-26 18:45:11,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:11,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:11,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:11,226 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:11,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:11,270 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:11,340 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:11,343 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:11,343 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:11,345 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:11,364 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:11,364 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:11,367 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:45:12,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:12,684 INFO ]: Finished difference Result 7 states and 123 transitions. [2018-06-26 18:45:12,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:12,685 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:45:12,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:12,694 INFO ]: With dead ends: 7 [2018-06-26 18:45:12,694 INFO ]: Without dead ends: 7 [2018-06-26 18:45:12,696 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 18:45:12,711 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:45:12,728 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:45:12,730 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:45:12,731 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-06-26 18:45:12,733 INFO ]: Start accepts. Automaton has 7 states and 123 transitions. Word has length 5 [2018-06-26 18:45:12,734 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:12,734 INFO ]: Abstraction has 7 states and 123 transitions. [2018-06-26 18:45:12,734 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:12,734 INFO ]: Start isEmpty. Operand 7 states and 123 transitions. [2018-06-26 18:45:12,734 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:12,734 INFO ]: Found error trace [2018-06-26 18:45:12,734 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:12,735 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:12,735 INFO ]: Analyzing trace with hash 1131628621, now seen corresponding path program 1 times [2018-06-26 18:45:12,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:12,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:12,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:12,735 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:12,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:12,757 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:12,869 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:12,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:12,870 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:12,871 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:12,871 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:12,871 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:12,871 INFO ]: Start difference. First operand 7 states and 123 transitions. Second operand 3 states. [2018-06-26 18:45:13,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:13,774 INFO ]: Finished difference Result 9 states and 175 transitions. [2018-06-26 18:45:13,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:13,774 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:45:13,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:13,775 INFO ]: With dead ends: 9 [2018-06-26 18:45:13,775 INFO ]: Without dead ends: 7 [2018-06-26 18:45:13,776 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 18:45:13,776 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:45:13,778 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:45:13,779 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:45:13,779 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2018-06-26 18:45:13,779 INFO ]: Start accepts. Automaton has 7 states and 117 transitions. Word has length 6 [2018-06-26 18:45:13,779 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:13,780 INFO ]: Abstraction has 7 states and 117 transitions. [2018-06-26 18:45:13,780 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:13,780 INFO ]: Start isEmpty. Operand 7 states and 117 transitions. [2018-06-26 18:45:13,780 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:13,780 INFO ]: Found error trace [2018-06-26 18:45:13,780 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:13,780 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:13,780 INFO ]: Analyzing trace with hash 1131658412, now seen corresponding path program 1 times [2018-06-26 18:45:13,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:13,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:13,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:13,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:13,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:13,795 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:13,854 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:13,854 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:13,855 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:13,855 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:13,855 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:13,855 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:13,855 INFO ]: Start difference. First operand 7 states and 117 transitions. Second operand 3 states. [2018-06-26 18:45:14,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:14,159 INFO ]: Finished difference Result 9 states and 163 transitions. [2018-06-26 18:45:14,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:14,159 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:45:14,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:14,160 INFO ]: With dead ends: 9 [2018-06-26 18:45:14,160 INFO ]: Without dead ends: 7 [2018-06-26 18:45:14,160 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 18:45:14,160 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:45:14,162 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:45:14,162 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:45:14,163 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2018-06-26 18:45:14,163 INFO ]: Start accepts. Automaton has 7 states and 83 transitions. Word has length 6 [2018-06-26 18:45:14,163 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:14,163 INFO ]: Abstraction has 7 states and 83 transitions. [2018-06-26 18:45:14,163 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:14,163 INFO ]: Start isEmpty. Operand 7 states and 83 transitions. [2018-06-26 18:45:14,163 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:14,163 INFO ]: Found error trace [2018-06-26 18:45:14,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:14,163 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:14,164 INFO ]: Analyzing trace with hash 1131896740, now seen corresponding path program 1 times [2018-06-26 18:45:14,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:14,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:14,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:14,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:14,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:14,178 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:14,234 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:14,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:14,234 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:14,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:14,256 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:14,261 INFO ]: Computing forward predicates... [2018-06-26 18:45:14,288 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:14,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:14,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:45:14,315 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:45:14,315 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:45:14,315 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:45:14,315 INFO ]: Start difference. First operand 7 states and 83 transitions. Second operand 4 states. [2018-06-26 18:45:14,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:14,715 INFO ]: Finished difference Result 9 states and 161 transitions. [2018-06-26 18:45:14,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:45:14,715 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:45:14,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:14,715 INFO ]: With dead ends: 9 [2018-06-26 18:45:14,715 INFO ]: Without dead ends: 9 [2018-06-26 18:45:14,716 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:45:14,716 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:45:14,718 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:45:14,718 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:45:14,719 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2018-06-26 18:45:14,719 INFO ]: Start accepts. Automaton has 9 states and 161 transitions. Word has length 6 [2018-06-26 18:45:14,719 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:14,719 INFO ]: Abstraction has 9 states and 161 transitions. [2018-06-26 18:45:14,719 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:45:14,719 INFO ]: Start isEmpty. Operand 9 states and 161 transitions. [2018-06-26 18:45:14,720 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:14,720 INFO ]: Found error trace [2018-06-26 18:45:14,720 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:14,720 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:14,721 INFO ]: Analyzing trace with hash 1132135068, now seen corresponding path program 1 times [2018-06-26 18:45:14,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:14,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:14,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:14,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:14,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:14,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:14,753 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:14,753 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:14,753 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:14,753 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:14,753 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:14,753 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:14,753 INFO ]: Start difference. First operand 9 states and 161 transitions. Second operand 3 states. [2018-06-26 18:45:14,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:14,882 INFO ]: Finished difference Result 13 states and 309 transitions. [2018-06-26 18:45:14,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:14,883 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:45:14,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:14,884 INFO ]: With dead ends: 13 [2018-06-26 18:45:14,884 INFO ]: Without dead ends: 13 [2018-06-26 18:45:14,884 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 18:45:14,884 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:45:14,887 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-26 18:45:14,887 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:45:14,888 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2018-06-26 18:45:14,888 INFO ]: Start accepts. Automaton has 11 states and 235 transitions. Word has length 6 [2018-06-26 18:45:14,888 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:14,888 INFO ]: Abstraction has 11 states and 235 transitions. [2018-06-26 18:45:14,888 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:14,888 INFO ]: Start isEmpty. Operand 11 states and 235 transitions. [2018-06-26 18:45:14,888 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:14,888 INFO ]: Found error trace [2018-06-26 18:45:14,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:14,888 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:14,888 INFO ]: Analyzing trace with hash 1132164859, now seen corresponding path program 1 times [2018-06-26 18:45:14,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:14,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:14,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:14,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:14,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:14,899 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:14,927 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:14,927 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:14,927 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:14,927 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:14,927 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:14,927 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:14,927 INFO ]: Start difference. First operand 11 states and 235 transitions. Second operand 3 states. [2018-06-26 18:45:15,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:15,093 INFO ]: Finished difference Result 14 states and 352 transitions. [2018-06-26 18:45:15,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:15,094 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:45:15,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:15,095 INFO ]: With dead ends: 14 [2018-06-26 18:45:15,095 INFO ]: Without dead ends: 14 [2018-06-26 18:45:15,095 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 18:45:15,095 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:45:15,098 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-26 18:45:15,098 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:45:15,099 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2018-06-26 18:45:15,099 INFO ]: Start accepts. Automaton has 11 states and 235 transitions. Word has length 6 [2018-06-26 18:45:15,099 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:15,099 INFO ]: Abstraction has 11 states and 235 transitions. [2018-06-26 18:45:15,099 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:15,099 INFO ]: Start isEmpty. Operand 11 states and 235 transitions. [2018-06-26 18:45:15,099 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:45:15,099 INFO ]: Found error trace [2018-06-26 18:45:15,099 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:15,099 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:15,100 INFO ]: Analyzing trace with hash 772507508, now seen corresponding path program 1 times [2018-06-26 18:45:15,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:15,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:15,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:15,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,108 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:15,136 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:15,136 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:15,136 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:15,136 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:15,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:15,136 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:15,136 INFO ]: Start difference. First operand 11 states and 235 transitions. Second operand 3 states. [2018-06-26 18:45:15,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:15,305 INFO ]: Finished difference Result 15 states and 338 transitions. [2018-06-26 18:45:15,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:15,307 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:45:15,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:15,309 INFO ]: With dead ends: 15 [2018-06-26 18:45:15,309 INFO ]: Without dead ends: 15 [2018-06-26 18:45:15,310 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 18:45:15,310 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:45:15,318 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-26 18:45:15,318 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:45:15,318 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 267 transitions. [2018-06-26 18:45:15,318 INFO ]: Start accepts. Automaton has 12 states and 267 transitions. Word has length 7 [2018-06-26 18:45:15,319 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:15,319 INFO ]: Abstraction has 12 states and 267 transitions. [2018-06-26 18:45:15,319 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:15,319 INFO ]: Start isEmpty. Operand 12 states and 267 transitions. [2018-06-26 18:45:15,319 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:45:15,319 INFO ]: Found error trace [2018-06-26 18:45:15,319 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:15,319 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:15,319 INFO ]: Analyzing trace with hash 772596881, now seen corresponding path program 1 times [2018-06-26 18:45:15,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:15,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:15,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:15,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,343 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:15,373 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:15,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:15,373 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:15,373 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:15,373 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:15,373 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:15,374 INFO ]: Start difference. First operand 12 states and 267 transitions. Second operand 3 states. [2018-06-26 18:45:15,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:15,491 INFO ]: Finished difference Result 14 states and 179 transitions. [2018-06-26 18:45:15,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:15,492 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:45:15,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:15,492 INFO ]: With dead ends: 14 [2018-06-26 18:45:15,492 INFO ]: Without dead ends: 11 [2018-06-26 18:45:15,492 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 18:45:15,492 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:45:15,493 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:45:15,493 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:45:15,494 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2018-06-26 18:45:15,494 INFO ]: Start accepts. Automaton has 10 states and 43 transitions. Word has length 7 [2018-06-26 18:45:15,494 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:15,494 INFO ]: Abstraction has 10 states and 43 transitions. [2018-06-26 18:45:15,494 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:15,494 INFO ]: Start isEmpty. Operand 10 states and 43 transitions. [2018-06-26 18:45:15,494 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:45:15,494 INFO ]: Found error trace [2018-06-26 18:45:15,494 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:15,494 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:15,494 INFO ]: Analyzing trace with hash 757731172, now seen corresponding path program 1 times [2018-06-26 18:45:15,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:15,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:15,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:15,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,500 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:15,518 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:15,518 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:15,518 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:15,518 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:15,519 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:15,519 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:15,519 INFO ]: Start difference. First operand 10 states and 43 transitions. Second operand 3 states. [2018-06-26 18:45:15,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:15,553 INFO ]: Finished difference Result 11 states and 48 transitions. [2018-06-26 18:45:15,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:15,553 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:45:15,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:15,553 INFO ]: With dead ends: 11 [2018-06-26 18:45:15,553 INFO ]: Without dead ends: 11 [2018-06-26 18:45:15,553 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 18:45:15,553 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:45:15,554 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:45:15,554 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:45:15,555 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-06-26 18:45:15,555 INFO ]: Start accepts. Automaton has 11 states and 48 transitions. Word has length 7 [2018-06-26 18:45:15,555 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:15,555 INFO ]: Abstraction has 11 states and 48 transitions. [2018-06-26 18:45:15,555 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:15,555 INFO ]: Start isEmpty. Operand 11 states and 48 transitions. [2018-06-26 18:45:15,555 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:45:15,555 INFO ]: Found error trace [2018-06-26 18:45:15,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:15,555 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:15,555 INFO ]: Analyzing trace with hash 748495962, now seen corresponding path program 1 times [2018-06-26 18:45:15,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:15,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:15,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:15,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:15,572 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:15,647 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:15,647 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:15,647 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:15,647 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:15,647 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:15,647 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:15,648 INFO ]: Start difference. First operand 11 states and 48 transitions. Second operand 3 states. [2018-06-26 18:45:15,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:15,674 INFO ]: Finished difference Result 7 states and 27 transitions. [2018-06-26 18:45:15,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:15,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:45:15,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:15,675 INFO ]: With dead ends: 7 [2018-06-26 18:45:15,675 INFO ]: Without dead ends: 0 [2018-06-26 18:45:15,675 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 18:45:15,675 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:45:15,675 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:45:15,675 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:45:15,675 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:45:15,675 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-26 18:45:15,675 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:15,675 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:45:15,675 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:15,675 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:45:15,675 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:45:15,678 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:45:15,679 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:45:15 BasicIcfg [2018-06-26 18:45:15,679 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:45:15,680 INFO ]: Toolchain (without parser) took 5531.95 ms. Allocated memory was 309.3 MB in the beginning and 340.3 MB in the end (delta: 30.9 MB). Free memory was 255.7 MB in the beginning and 185.5 MB in the end (delta: 70.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:15,683 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:45:15,683 INFO ]: ChcToBoogie took 70.03 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:15,684 INFO ]: Boogie Preprocessor took 46.86 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 251.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 18:45:15,684 INFO ]: RCFGBuilder took 695.78 ms. Allocated memory is still 309.3 MB. Free memory was 251.6 MB in the beginning and 227.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:15,685 INFO ]: BlockEncodingV2 took 123.36 ms. Allocated memory is still 309.3 MB. Free memory was 227.6 MB in the beginning and 220.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:15,685 INFO ]: TraceAbstraction took 4585.96 ms. Allocated memory was 309.3 MB in the beginning and 340.3 MB in the end (delta: 30.9 MB). Free memory was 219.7 MB in the beginning and 185.5 MB in the end (delta: 34.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:15,689 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 38 edges - StatisticsResult: Encoded RCFG 6 locations, 96 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.03 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.86 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 695.78 ms. Allocated memory is still 309.3 MB. Free memory was 251.6 MB in the beginning and 227.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 123.36 ms. Allocated memory is still 309.3 MB. Free memory was 227.6 MB in the beginning and 220.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4585.96 ms. Allocated memory was 309.3 MB in the beginning and 340.3 MB in the end (delta: 30.9 MB). Free memory was 219.7 MB in the beginning and 185.5 MB in the end (delta: 34.1 MB). Peak memory consumption was 65.1 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.5s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 2 SDslu, 31 SDs, 0 SdLazy, 931 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 582 SizeOfPredicates, 2 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 16/18 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/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-45-15-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-45-15-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-45-15-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-45-15-704.csv Received shutdown request...