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/simple.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:55:29,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:55:29,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:55:29,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:55:29,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:55:29,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:55:29,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:55:29,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:55:29,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:55:29,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:55:29,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:55:29,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:55:29,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:55:29,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:55:29,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:55:29,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:55:29,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:55:29,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:55:29,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:55:29,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:55:29,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:55:29,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:55:29,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:55:29,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:55:29,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:55:29,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:55:29,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:55:29,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:55:29,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:55:29,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:55:29,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:55:29,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:55:29,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:55:29,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:55:29,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:55:29,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:55:29,625 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:55:29,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:55:29,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:55:29,649 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:55:29,649 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:55:29,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:55:29,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:55:29,652 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:55:29,652 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:55:29,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:55:29,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:55:29,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:55:29,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:55:29,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:55:29,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:55:29,653 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:55:29,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:55:29,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:55:29,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:55:29,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:55:29,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:55:29,654 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:55:29,656 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:55:29,657 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:55:29,704 INFO ]: Repository-Root is: /tmp [2018-06-26 21:55:29,720 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:55:29,726 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:55:29,728 INFO ]: Initializing SmtParser... [2018-06-26 21:55:29,728 INFO ]: SmtParser initialized [2018-06-26 21:55:29,729 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple.c.smt2 [2018-06-26 21:55:29,730 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:55:29,817 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple.c.smt2 unknown [2018-06-26 21:55:30,010 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple.c.smt2 [2018-06-26 21:55:30,015 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:55:30,022 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:55:30,023 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:55:30,023 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:55:30,023 INFO ]: ChcToBoogie initialized [2018-06-26 21:55:30,027 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,085 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30 Unit [2018-06-26 21:55:30,085 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:55:30,085 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:55:30,085 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:55:30,085 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:55:30,104 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,104 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,108 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,108 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,111 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,112 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,113 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,115 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:55:30,115 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:55:30,115 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:55:30,115 INFO ]: RCFGBuilder initialized [2018-06-26 21:55:30,116 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (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:55:30,130 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:55:30,130 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:55:30,130 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:55:30,130 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:55:30,130 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:55:30,130 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:55:30,331 INFO ]: Using library mode [2018-06-26 21:55:30,331 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:55:30 BoogieIcfgContainer [2018-06-26 21:55:30,331 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:55:30,332 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:55:30,332 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:55:30,333 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:55:30,333 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:55:30" (1/1) ... [2018-06-26 21:55:30,349 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:55:30,351 INFO ]: Using Remove infeasible edges [2018-06-26 21:55:30,351 INFO ]: Using Maximize final states [2018-06-26 21:55:30,352 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:55:30,352 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:55:30,355 INFO ]: Using Remove sink states [2018-06-26 21:55:30,356 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:55:30,356 INFO ]: Using Use SBE [2018-06-26 21:55:30,365 WARN ]: expecting exponential blowup for input size 18 [2018-06-26 21:55:32,387 INFO ]: SBE split 1 edges [2018-06-26 21:55:32,418 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:55:32,420 INFO ]: 0 new accepting states [2018-06-26 21:55:32,462 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:55:32,464 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:55:32,504 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:55:32,504 INFO ]: 0 new accepting states [2018-06-26 21:55:32,513 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:55:32,513 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:55:32,588 INFO ]: Encoded RCFG 6 locations, 333 edges [2018-06-26 21:55:32,588 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:55:32 BasicIcfg [2018-06-26 21:55:32,588 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:55:32,589 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:55:32,589 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:55:32,592 INFO ]: TraceAbstraction initialized [2018-06-26 21:55:32,592 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:55:30" (1/4) ... [2018-06-26 21:55:32,596 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:55:32, skipping insertion in model container [2018-06-26 21:55:32,596 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:55:30" (2/4) ... [2018-06-26 21:55:32,596 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:55:32, skipping insertion in model container [2018-06-26 21:55:32,596 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:55:30" (3/4) ... [2018-06-26 21:55:32,596 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:55:32, skipping insertion in model container [2018-06-26 21:55:32,596 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:55:32" (4/4) ... [2018-06-26 21:55:32,598 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:55:32,604 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:55:32,612 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:55:32,654 INFO ]: Using default assertion order modulation [2018-06-26 21:55:32,655 INFO ]: Interprodecural is true [2018-06-26 21:55:32,655 INFO ]: Hoare is false [2018-06-26 21:55:32,655 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:55:32,655 INFO ]: Backedges is TWOTRACK [2018-06-26 21:55:32,655 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:55:32,655 INFO ]: Difference is false [2018-06-26 21:55:32,655 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:55:32,655 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:55:32,665 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:55:32,677 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:55:32,678 INFO ]: Found error trace [2018-06-26 21:55:32,678 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:55:32,679 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:32,683 INFO ]: Analyzing trace with hash 45489218, now seen corresponding path program 1 times [2018-06-26 21:55:32,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:32,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:32,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:32,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:32,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:32,754 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:32,800 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:55:32,801 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:32,801 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:32,803 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:32,813 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:32,814 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:32,816 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:55:34,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:34,752 INFO ]: Finished difference Result 7 states and 535 transitions. [2018-06-26 21:55:34,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:34,754 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:55:34,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:34,765 INFO ]: With dead ends: 7 [2018-06-26 21:55:34,765 INFO ]: Without dead ends: 7 [2018-06-26 21:55:34,767 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:55:34,784 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:55:34,806 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:55:34,807 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:55:34,809 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 535 transitions. [2018-06-26 21:55:34,810 INFO ]: Start accepts. Automaton has 7 states and 535 transitions. Word has length 5 [2018-06-26 21:55:34,811 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:34,811 INFO ]: Abstraction has 7 states and 535 transitions. [2018-06-26 21:55:34,811 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:34,811 INFO ]: Start isEmpty. Operand 7 states and 535 transitions. [2018-06-26 21:55:34,812 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:55:34,812 INFO ]: Found error trace [2018-06-26 21:55:34,812 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:55:34,812 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:34,812 INFO ]: Analyzing trace with hash 1400860554, now seen corresponding path program 1 times [2018-06-26 21:55:34,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:34,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:34,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:34,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:34,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:34,821 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:34,847 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:55:34,848 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:34,848 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:34,849 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:34,849 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:34,849 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:34,850 INFO ]: Start difference. First operand 7 states and 535 transitions. Second operand 3 states. [2018-06-26 21:55:35,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:35,757 INFO ]: Finished difference Result 9 states and 813 transitions. [2018-06-26 21:55:35,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:35,758 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:55:35,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:35,759 INFO ]: With dead ends: 9 [2018-06-26 21:55:35,759 INFO ]: Without dead ends: 9 [2018-06-26 21:55:35,760 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:55:35,760 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:55:35,772 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:55:35,772 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:55:35,773 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 813 transitions. [2018-06-26 21:55:35,774 INFO ]: Start accepts. Automaton has 9 states and 813 transitions. Word has length 6 [2018-06-26 21:55:35,774 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:35,774 INFO ]: Abstraction has 9 states and 813 transitions. [2018-06-26 21:55:35,774 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:35,774 INFO ]: Start isEmpty. Operand 9 states and 813 transitions. [2018-06-26 21:55:35,774 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:55:35,774 INFO ]: Found error trace [2018-06-26 21:55:35,774 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:55:35,775 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:35,775 INFO ]: Analyzing trace with hash 1401456374, now seen corresponding path program 1 times [2018-06-26 21:55:35,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:35,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:35,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:35,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:35,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:35,784 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:35,830 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:55:35,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:35,830 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:35,830 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:35,830 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:35,831 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:35,831 INFO ]: Start difference. First operand 9 states and 813 transitions. Second operand 3 states. [2018-06-26 21:55:37,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:37,224 INFO ]: Finished difference Result 13 states and 1075 transitions. [2018-06-26 21:55:37,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:37,224 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:55:37,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:37,225 INFO ]: With dead ends: 13 [2018-06-26 21:55:37,225 INFO ]: Without dead ends: 13 [2018-06-26 21:55:37,226 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:55:37,226 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:55:37,279 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 21:55:37,279 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 21:55:37,281 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1032 transitions. [2018-06-26 21:55:37,281 INFO ]: Start accepts. Automaton has 12 states and 1032 transitions. Word has length 6 [2018-06-26 21:55:37,282 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:37,282 INFO ]: Abstraction has 12 states and 1032 transitions. [2018-06-26 21:55:37,282 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:37,282 INFO ]: Start isEmpty. Operand 12 states and 1032 transitions. [2018-06-26 21:55:37,283 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:55:37,283 INFO ]: Found error trace [2018-06-26 21:55:37,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:55:37,283 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:37,283 INFO ]: Analyzing trace with hash 1501970479, now seen corresponding path program 1 times [2018-06-26 21:55:37,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:37,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:37,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:37,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:37,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:37,300 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:37,320 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 21:55:37,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:37,320 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:37,321 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:37,321 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:37,321 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:37,321 INFO ]: Start difference. First operand 12 states and 1032 transitions. Second operand 3 states. [2018-06-26 21:55:37,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:37,878 INFO ]: Finished difference Result 16 states and 1074 transitions. [2018-06-26 21:55:37,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:37,881 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 21:55:37,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:37,882 INFO ]: With dead ends: 16 [2018-06-26 21:55:37,882 INFO ]: Without dead ends: 13 [2018-06-26 21:55:37,882 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:55:37,882 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:55:37,884 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:55:37,884 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:55:37,885 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2018-06-26 21:55:37,885 INFO ]: Start accepts. Automaton has 13 states and 117 transitions. Word has length 9 [2018-06-26 21:55:37,885 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:37,885 INFO ]: Abstraction has 13 states and 117 transitions. [2018-06-26 21:55:37,885 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:37,885 INFO ]: Start isEmpty. Operand 13 states and 117 transitions. [2018-06-26 21:55:37,885 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:55:37,886 INFO ]: Found error trace [2018-06-26 21:55:37,886 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:55:37,886 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:37,886 INFO ]: Analyzing trace with hash 2051196181, now seen corresponding path program 1 times [2018-06-26 21:55:37,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:37,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:37,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:37,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:37,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:37,904 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:37,951 INFO ]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:55:37,951 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:37,951 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 21:55:37,951 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:55:37,952 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:55:37,952 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:55:37,952 INFO ]: Start difference. First operand 13 states and 117 transitions. Second operand 4 states. [2018-06-26 21:55:38,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:38,138 INFO ]: Finished difference Result 21 states and 234 transitions. [2018-06-26 21:55:38,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:55:38,138 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-26 21:55:38,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:38,139 INFO ]: With dead ends: 21 [2018-06-26 21:55:38,139 INFO ]: Without dead ends: 21 [2018-06-26 21:55:38,139 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:55:38,139 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 21:55:38,142 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 21:55:38,142 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:55:38,143 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 184 transitions. [2018-06-26 21:55:38,143 INFO ]: Start accepts. Automaton has 17 states and 184 transitions. Word has length 9 [2018-06-26 21:55:38,143 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:38,143 INFO ]: Abstraction has 17 states and 184 transitions. [2018-06-26 21:55:38,143 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:55:38,143 INFO ]: Start isEmpty. Operand 17 states and 184 transitions. [2018-06-26 21:55:38,144 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:55:38,144 INFO ]: Found error trace [2018-06-26 21:55:38,144 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:55:38,144 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:38,144 INFO ]: Analyzing trace with hash 1580535700, now seen corresponding path program 1 times [2018-06-26 21:55:38,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:38,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:38,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:38,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,164 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:38,194 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 21:55:38,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:38,194 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:38,194 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:38,194 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:38,194 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:38,195 INFO ]: Start difference. First operand 17 states and 184 transitions. Second operand 3 states. [2018-06-26 21:55:38,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:38,269 INFO ]: Finished difference Result 17 states and 141 transitions. [2018-06-26 21:55:38,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:38,269 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 21:55:38,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:38,270 INFO ]: With dead ends: 17 [2018-06-26 21:55:38,270 INFO ]: Without dead ends: 17 [2018-06-26 21:55:38,270 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:55:38,270 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:55:38,272 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 21:55:38,272 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:55:38,273 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 141 transitions. [2018-06-26 21:55:38,273 INFO ]: Start accepts. Automaton has 17 states and 141 transitions. Word has length 11 [2018-06-26 21:55:38,273 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:38,273 INFO ]: Abstraction has 17 states and 141 transitions. [2018-06-26 21:55:38,273 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:38,273 INFO ]: Start isEmpty. Operand 17 states and 141 transitions. [2018-06-26 21:55:38,273 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 21:55:38,273 INFO ]: Found error trace [2018-06-26 21:55:38,274 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:55:38,274 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:38,274 INFO ]: Analyzing trace with hash 1625579076, now seen corresponding path program 2 times [2018-06-26 21:55:38,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:38,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:38,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:38,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,299 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:38,328 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 21:55:38,328 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:38,328 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:38,328 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:38,328 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:38,328 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:38,328 INFO ]: Start difference. First operand 17 states and 141 transitions. Second operand 3 states. [2018-06-26 21:55:38,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:38,401 INFO ]: Finished difference Result 17 states and 110 transitions. [2018-06-26 21:55:38,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:38,405 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 21:55:38,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:38,406 INFO ]: With dead ends: 17 [2018-06-26 21:55:38,406 INFO ]: Without dead ends: 17 [2018-06-26 21:55:38,406 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:55:38,406 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:55:38,408 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 21:55:38,408 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:55:38,408 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-06-26 21:55:38,409 INFO ]: Start accepts. Automaton has 17 states and 110 transitions. Word has length 12 [2018-06-26 21:55:38,409 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:38,409 INFO ]: Abstraction has 17 states and 110 transitions. [2018-06-26 21:55:38,409 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:38,409 INFO ]: Start isEmpty. Operand 17 states and 110 transitions. [2018-06-26 21:55:38,409 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 21:55:38,409 INFO ]: Found error trace [2018-06-26 21:55:38,409 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:55:38,409 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:38,409 INFO ]: Analyzing trace with hash 200818208, now seen corresponding path program 1 times [2018-06-26 21:55:38,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:38,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:38,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:55:38,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,423 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:38,480 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:55:38,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:55:38,480 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:55:38,480 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:55:38,480 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:55:38,480 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:55:38,480 INFO ]: Start difference. First operand 17 states and 110 transitions. Second operand 3 states. [2018-06-26 21:55:38,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:38,591 INFO ]: Finished difference Result 21 states and 131 transitions. [2018-06-26 21:55:38,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:55:38,592 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 21:55:38,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:38,593 INFO ]: With dead ends: 21 [2018-06-26 21:55:38,593 INFO ]: Without dead ends: 21 [2018-06-26 21:55:38,593 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:55:38,593 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 21:55:38,595 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 21:55:38,595 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 21:55:38,598 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 131 transitions. [2018-06-26 21:55:38,598 INFO ]: Start accepts. Automaton has 21 states and 131 transitions. Word has length 12 [2018-06-26 21:55:38,598 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:38,598 INFO ]: Abstraction has 21 states and 131 transitions. [2018-06-26 21:55:38,598 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:55:38,598 INFO ]: Start isEmpty. Operand 21 states and 131 transitions. [2018-06-26 21:55:38,599 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 21:55:38,599 INFO ]: Found error trace [2018-06-26 21:55:38,599 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:55:38,599 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:55:38,599 INFO ]: Analyzing trace with hash -1011906705, now seen corresponding path program 1 times [2018-06-26 21:55:38,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:55:38,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:55:38,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:38,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:55:38,628 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:38,800 INFO ]: Checked inductivity of 28 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 21:55:38,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:55:38,800 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 21:55:38,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:55:38,872 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:55:38,881 INFO ]: Computing forward predicates... [2018-06-26 21:55:38,920 INFO ]: Checked inductivity of 28 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 21:55:38,952 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:55:38,952 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:55:38,953 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:55:38,953 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:55:38,953 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:55:38,953 INFO ]: Start difference. First operand 21 states and 131 transitions. Second operand 4 states. [2018-06-26 21:55:39,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:55:39,735 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-26 21:55:39,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:55:39,735 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-26 21:55:39,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:55:39,735 INFO ]: With dead ends: 9 [2018-06-26 21:55:39,735 INFO ]: Without dead ends: 0 [2018-06-26 21:55:39,735 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:55:39,735 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:55:39,736 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:55:39,736 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:55:39,736 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:55:39,736 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-06-26 21:55:39,736 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:55:39,736 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:55:39,736 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:55:39,736 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:55:39,736 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:55:39,738 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:55:39,740 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:55:39 BasicIcfg [2018-06-26 21:55:39,740 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:55:39,741 INFO ]: Toolchain (without parser) took 9725.66 ms. Allocated memory was 306.2 MB in the beginning and 654.3 MB in the end (delta: 348.1 MB). Free memory was 260.5 MB in the beginning and 275.5 MB in the end (delta: -14.9 MB). Peak memory consumption was 333.2 MB. Max. memory is 3.6 GB. [2018-06-26 21:55:39,743 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:55:39,744 INFO ]: ChcToBoogie took 62.07 ms. Allocated memory is still 306.2 MB. Free memory was 260.5 MB in the beginning and 258.5 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:55:39,745 INFO ]: Boogie Preprocessor took 29.38 ms. Allocated memory is still 306.2 MB. Free memory was 258.5 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:55:39,745 INFO ]: RCFGBuilder took 216.00 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 248.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:55:39,746 INFO ]: BlockEncodingV2 took 2256.45 ms. Allocated memory was 306.2 MB in the beginning and 435.7 MB in the end (delta: 129.5 MB). Free memory was 248.6 MB in the beginning and 169.6 MB in the end (delta: 79.0 MB). Peak memory consumption was 279.3 MB. Max. memory is 3.6 GB. [2018-06-26 21:55:39,746 INFO ]: TraceAbstraction took 7151.41 ms. Allocated memory was 435.7 MB in the beginning and 654.3 MB in the end (delta: 218.6 MB). Free memory was 169.6 MB in the beginning and 275.5 MB in the end (delta: -105.9 MB). Peak memory consumption was 112.7 MB. Max. memory is 3.6 GB. [2018-06-26 21:55:39,753 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, 333 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.07 ms. Allocated memory is still 306.2 MB. Free memory was 260.5 MB in the beginning and 258.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 29.38 ms. Allocated memory is still 306.2 MB. Free memory was 258.5 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 216.00 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 248.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2256.45 ms. Allocated memory was 306.2 MB in the beginning and 435.7 MB in the end (delta: 129.5 MB). Free memory was 248.6 MB in the beginning and 169.6 MB in the end (delta: 79.0 MB). Peak memory consumption was 279.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7151.41 ms. Allocated memory was 435.7 MB in the beginning and 654.3 MB in the end (delta: 218.6 MB). Free memory was 169.6 MB in the beginning and 275.5 MB in the end (delta: -105.9 MB). Peak memory consumption was 112.7 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, 7.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 3 SDslu, 28 SDs, 0 SdLazy, 2291 SolverSat, 2042 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 1319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 149/155 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/simple.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-55-39-775.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-55-39-775.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-55-39-775.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-55-39-775.csv Received shutdown request...