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/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.19.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:24:42,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:24:42,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:24:42,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:24:42,659 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:24:42,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:24:42,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:24:42,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:24:42,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:24:42,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:24:42,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:24:42,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:24:42,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:24:42,671 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:24:42,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:24:42,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:24:42,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:24:42,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:24:42,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:24:42,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:24:42,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:24:42,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:24:42,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:24:42,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:24:42,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:24:42,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:24:42,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:24:42,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:24:42,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:24:42,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:24:42,705 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:24:42,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:24:42,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:24:42,706 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:24:42,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:24:42,713 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:24:42,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:24:42,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:24:42,735 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:24:42,735 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:24:42,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:24:42,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:24:42,736 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:24:42,737 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:24:42,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:24:42,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:24:42,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:24:42,738 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:24:42,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:24:42,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:24:42,738 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:24:42,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:24:42,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:24:42,739 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:24:42,739 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:24:42,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:24:42,739 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:24:42,740 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:24:42,741 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:24:42,780 INFO ]: Repository-Root is: /tmp [2018-06-24 20:24:42,798 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:24:42,802 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:24:42,804 INFO ]: Initializing SmtParser... [2018-06-24 20:24:42,804 INFO ]: SmtParser initialized [2018-06-24 20:24:42,805 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.19.smt2 [2018-06-24 20:24:42,806 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-24 20:24:42,896 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.19.smt2 unknown [2018-06-24 20:24:43,501 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.19.smt2 [2018-06-24 20:24:43,506 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:24:43,511 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:24:43,512 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:24:43,512 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:24:43,512 INFO ]: ChcToBoogie initialized [2018-06-24 20:24:43,519 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,634 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43 Unit [2018-06-24 20:24:43,635 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:24:43,635 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:24:43,635 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:24:43,635 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:24:43,650 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,650 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,666 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,667 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,691 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,696 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,706 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (1/1) ... [2018-06-24 20:24:43,712 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:24:43,719 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:24:43,719 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:24:43,719 INFO ]: RCFGBuilder initialized [2018-06-24 20:24:43,720 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (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-24 20:24:43,735 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:24:43,735 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:24:43,735 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:24:43,735 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:24:43,735 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:24:43,735 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-24 20:24:45,241 INFO ]: Using library mode [2018-06-24 20:24:45,243 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:24:45 BoogieIcfgContainer [2018-06-24 20:24:45,243 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:24:45,244 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:24:45,244 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:24:45,245 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:24:45,245 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:24:45" (1/1) ... [2018-06-24 20:24:45,297 INFO ]: Initial Icfg 147 locations, 285 edges [2018-06-24 20:24:45,298 INFO ]: Using Remove infeasible edges [2018-06-24 20:24:45,300 INFO ]: Using Maximize final states [2018-06-24 20:24:45,300 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:24:45,300 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:24:45,302 INFO ]: Using Remove sink states [2018-06-24 20:24:45,306 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:24:45,306 INFO ]: Using Use SBE [2018-06-24 20:24:45,323 INFO ]: SBE split 0 edges [2018-06-24 20:24:45,334 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 20:24:45,336 INFO ]: 0 new accepting states [2018-06-24 20:24:45,986 INFO ]: Removed 49 edges and 8 locations by large block encoding [2018-06-24 20:24:45,988 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-24 20:24:45,994 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:24:45,995 INFO ]: 0 new accepting states [2018-06-24 20:24:45,998 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:24:45,999 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:24:46,003 INFO ]: Encoded RCFG 135 locations, 268 edges [2018-06-24 20:24:46,003 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:24:46 BasicIcfg [2018-06-24 20:24:46,004 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:24:46,005 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:24:46,005 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:24:46,008 INFO ]: TraceAbstraction initialized [2018-06-24 20:24:46,008 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:24:43" (1/4) ... [2018-06-24 20:24:46,009 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b553b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:24:46, skipping insertion in model container [2018-06-24 20:24:46,009 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:24:43" (2/4) ... [2018-06-24 20:24:46,009 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b553b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:24:46, skipping insertion in model container [2018-06-24 20:24:46,009 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:24:45" (3/4) ... [2018-06-24 20:24:46,009 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82b553b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:24:46, skipping insertion in model container [2018-06-24 20:24:46,009 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:24:46" (4/4) ... [2018-06-24 20:24:46,014 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:24:46,026 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:24:46,044 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:24:46,101 INFO ]: Using default assertion order modulation [2018-06-24 20:24:46,102 INFO ]: Interprodecural is true [2018-06-24 20:24:46,102 INFO ]: Hoare is false [2018-06-24 20:24:46,102 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:24:46,102 INFO ]: Backedges is TWOTRACK [2018-06-24 20:24:46,102 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:24:46,102 INFO ]: Difference is false [2018-06-24 20:24:46,102 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:24:46,102 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:24:46,128 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:24:46,210 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:24:46,210 INFO ]: Found error trace [2018-06-24 20:24:46,211 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:24:46,211 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:46,220 INFO ]: Analyzing trace with hash 177995960, now seen corresponding path program 1 times [2018-06-24 20:24:46,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:46,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:46,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:46,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:46,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:46,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:46,578 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:24:46,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:46,580 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:24:46,581 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:24:46,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:24:46,592 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:24:46,594 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:24:48,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:48,438 INFO ]: Finished difference Result 267 states and 533 transitions. [2018-06-24 20:24:48,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:24:48,440 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:24:48,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:48,501 INFO ]: With dead ends: 267 [2018-06-24 20:24:48,502 INFO ]: Without dead ends: 267 [2018-06-24 20:24:48,578 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-24 20:24:48,592 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:24:48,741 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:24:48,742 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:24:48,762 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 533 transitions. [2018-06-24 20:24:48,763 INFO ]: Start accepts. Automaton has 267 states and 533 transitions. Word has length 5 [2018-06-24 20:24:48,764 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:48,764 INFO ]: Abstraction has 267 states and 533 transitions. [2018-06-24 20:24:48,764 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:24:48,764 INFO ]: Start isEmpty. Operand 267 states and 533 transitions. [2018-06-24 20:24:48,792 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:48,792 INFO ]: Found error trace [2018-06-24 20:24:48,792 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:48,792 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:48,793 INFO ]: Analyzing trace with hash 719328698, now seen corresponding path program 1 times [2018-06-24 20:24:48,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:48,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:48,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:48,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:48,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:48,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:48,951 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:24:48,951 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:48,951 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:24:48,952 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:24:48,952 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:24:48,952 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:24:48,953 INFO ]: Start difference. First operand 267 states and 533 transitions. Second operand 3 states. [2018-06-24 20:24:50,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:50,437 INFO ]: Finished difference Result 399 states and 796 transitions. [2018-06-24 20:24:50,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:24:50,437 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:24:50,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:50,454 INFO ]: With dead ends: 399 [2018-06-24 20:24:50,454 INFO ]: Without dead ends: 399 [2018-06-24 20:24:50,455 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-24 20:24:50,455 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:24:50,525 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:24:50,525 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:24:50,542 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 796 transitions. [2018-06-24 20:24:50,542 INFO ]: Start accepts. Automaton has 399 states and 796 transitions. Word has length 10 [2018-06-24 20:24:50,542 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:50,542 INFO ]: Abstraction has 399 states and 796 transitions. [2018-06-24 20:24:50,542 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:24:50,542 INFO ]: Start isEmpty. Operand 399 states and 796 transitions. [2018-06-24 20:24:50,568 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:50,568 INFO ]: Found error trace [2018-06-24 20:24:50,568 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:50,568 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:50,568 INFO ]: Analyzing trace with hash 462260985, now seen corresponding path program 1 times [2018-06-24 20:24:50,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:50,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:50,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:50,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:50,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:50,616 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:50,845 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:24:50,845 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:50,845 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:50,845 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:50,845 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:50,845 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:50,846 INFO ]: Start difference. First operand 399 states and 796 transitions. Second operand 6 states. [2018-06-24 20:24:55,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:55,138 INFO ]: Finished difference Result 802 states and 3084 transitions. [2018-06-24 20:24:55,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:24:55,139 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:55,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:55,264 INFO ]: With dead ends: 802 [2018-06-24 20:24:55,264 INFO ]: Without dead ends: 802 [2018-06-24 20:24:55,265 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:24:55,265 INFO ]: Start minimizeSevpa. Operand 802 states. [2018-06-24 20:24:55,513 INFO ]: Finished minimizeSevpa. Reduced states from 802 to 479. [2018-06-24 20:24:55,513 INFO ]: Start removeUnreachable. Operand 479 states. [2018-06-24 20:24:55,530 INFO ]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1079 transitions. [2018-06-24 20:24:55,530 INFO ]: Start accepts. Automaton has 479 states and 1079 transitions. Word has length 10 [2018-06-24 20:24:55,530 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:55,530 INFO ]: Abstraction has 479 states and 1079 transitions. [2018-06-24 20:24:55,530 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:24:55,530 INFO ]: Start isEmpty. Operand 479 states and 1079 transitions. [2018-06-24 20:24:55,558 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:55,558 INFO ]: Found error trace [2018-06-24 20:24:55,558 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:55,558 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:55,558 INFO ]: Analyzing trace with hash 462264829, now seen corresponding path program 1 times [2018-06-24 20:24:55,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:55,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:55,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:55,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:55,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:55,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:55,950 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:24:55,950 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:55,950 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:55,950 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:55,950 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:55,950 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:55,950 INFO ]: Start difference. First operand 479 states and 1079 transitions. Second operand 6 states. [2018-06-24 20:24:59,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:59,928 INFO ]: Finished difference Result 1165 states and 4241 transitions. [2018-06-24 20:24:59,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:24:59,928 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:59,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:00,059 INFO ]: With dead ends: 1165 [2018-06-24 20:25:00,060 INFO ]: Without dead ends: 1165 [2018-06-24 20:25:00,060 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:25:00,062 INFO ]: Start minimizeSevpa. Operand 1165 states. [2018-06-24 20:25:00,399 INFO ]: Finished minimizeSevpa. Reduced states from 1165 to 708. [2018-06-24 20:25:00,399 INFO ]: Start removeUnreachable. Operand 708 states. [2018-06-24 20:25:00,425 INFO ]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1748 transitions. [2018-06-24 20:25:00,425 INFO ]: Start accepts. Automaton has 708 states and 1748 transitions. Word has length 10 [2018-06-24 20:25:00,426 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:00,426 INFO ]: Abstraction has 708 states and 1748 transitions. [2018-06-24 20:25:00,426 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:25:00,426 INFO ]: Start isEmpty. Operand 708 states and 1748 transitions. [2018-06-24 20:25:00,456 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:00,456 INFO ]: Found error trace [2018-06-24 20:25:00,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:00,456 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:00,458 INFO ]: Analyzing trace with hash -128653107, now seen corresponding path program 1 times [2018-06-24 20:25:00,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:00,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:00,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:00,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:00,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:00,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:00,947 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:25:00,947 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:00,948 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:25:00,948 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:25:00,948 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:25:00,948 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:25:00,948 INFO ]: Start difference. First operand 708 states and 1748 transitions. Second operand 6 states. [2018-06-24 20:25:05,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:05,757 INFO ]: Finished difference Result 2460 states and 11228 transitions. [2018-06-24 20:25:05,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:25:05,757 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:25:05,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:06,066 INFO ]: With dead ends: 2460 [2018-06-24 20:25:06,066 INFO ]: Without dead ends: 2460 [2018-06-24 20:25:06,066 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:25:06,068 INFO ]: Start minimizeSevpa. Operand 2460 states. [2018-06-24 20:25:06,891 INFO ]: Finished minimizeSevpa. Reduced states from 2460 to 1352. [2018-06-24 20:25:06,891 INFO ]: Start removeUnreachable. Operand 1352 states. [2018-06-24 20:25:06,967 INFO ]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 4140 transitions. [2018-06-24 20:25:06,967 INFO ]: Start accepts. Automaton has 1352 states and 4140 transitions. Word has length 10 [2018-06-24 20:25:06,967 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:06,967 INFO ]: Abstraction has 1352 states and 4140 transitions. [2018-06-24 20:25:06,968 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:25:06,968 INFO ]: Start isEmpty. Operand 1352 states and 4140 transitions. [2018-06-24 20:25:06,996 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:06,996 INFO ]: Found error trace [2018-06-24 20:25:06,996 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:06,996 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:06,997 INFO ]: Analyzing trace with hash -14136503, now seen corresponding path program 1 times [2018-06-24 20:25:06,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:06,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:06,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:06,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:06,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:07,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:07,502 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:25:07,502 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:07,502 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:25:07,502 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:25:07,502 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:25:07,502 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:25:07,502 INFO ]: Start difference. First operand 1352 states and 4140 transitions. Second operand 6 states. [2018-06-24 20:25:07,784 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 20:25:13,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:13,990 INFO ]: Finished difference Result 4327 states and 18887 transitions. [2018-06-24 20:25:13,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:25:13,991 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:25:13,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:14,478 INFO ]: With dead ends: 4327 [2018-06-24 20:25:14,478 INFO ]: Without dead ends: 4327 [2018-06-24 20:25:14,478 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:25:14,480 INFO ]: Start minimizeSevpa. Operand 4327 states. [2018-06-24 20:25:15,483 INFO ]: Finished minimizeSevpa. Reduced states from 4327 to 2758. [2018-06-24 20:25:15,483 INFO ]: Start removeUnreachable. Operand 2758 states. [2018-06-24 20:25:17,077 INFO ]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 9582 transitions. [2018-06-24 20:25:17,077 INFO ]: Start accepts. Automaton has 2758 states and 9582 transitions. Word has length 10 [2018-06-24 20:25:17,077 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:17,077 INFO ]: Abstraction has 2758 states and 9582 transitions. [2018-06-24 20:25:17,077 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:25:17,077 INFO ]: Start isEmpty. Operand 2758 states and 9582 transitions. [2018-06-24 20:25:17,140 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:17,140 INFO ]: Found error trace [2018-06-24 20:25:17,140 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:17,140 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:17,141 INFO ]: Analyzing trace with hash -1734499650, now seen corresponding path program 1 times [2018-06-24 20:25:17,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:17,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:17,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:17,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:17,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:17,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:17,248 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:25:17,248 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:17,248 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:25:17,249 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:25:17,249 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:25:17,249 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:25:17,249 INFO ]: Start difference. First operand 2758 states and 9582 transitions. Second operand 3 states. [2018-06-24 20:25:17,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:17,997 INFO ]: Finished difference Result 2969 states and 10284 transitions. [2018-06-24 20:25:18,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:25:18,000 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:25:18,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:18,204 INFO ]: With dead ends: 2969 [2018-06-24 20:25:18,204 INFO ]: Without dead ends: 2969 [2018-06-24 20:25:18,205 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-24 20:25:18,206 INFO ]: Start minimizeSevpa. Operand 2969 states. [2018-06-24 20:25:18,743 INFO ]: Finished minimizeSevpa. Reduced states from 2969 to 2969. [2018-06-24 20:25:18,744 INFO ]: Start removeUnreachable. Operand 2969 states. [2018-06-24 20:25:19,153 INFO ]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 10284 transitions. [2018-06-24 20:25:19,153 INFO ]: Start accepts. Automaton has 2969 states and 10284 transitions. Word has length 10 [2018-06-24 20:25:19,153 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:19,153 INFO ]: Abstraction has 2969 states and 10284 transitions. [2018-06-24 20:25:19,153 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:25:19,153 INFO ]: Start isEmpty. Operand 2969 states and 10284 transitions. [2018-06-24 20:25:19,232 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:25:19,232 INFO ]: Found error trace [2018-06-24 20:25:19,232 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:19,232 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:19,232 INFO ]: Analyzing trace with hash 1438490823, now seen corresponding path program 1 times [2018-06-24 20:25:19,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:19,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:19,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:19,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:19,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:19,282 INFO ]: Conjunction of SSA is sat [2018-06-24 20:25:19,290 INFO ]: Counterexample might be feasible [2018-06-24 20:25:19,303 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:25:19,306 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:25:19 BasicIcfg [2018-06-24 20:25:19,306 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:25:19,307 INFO ]: Toolchain (without parser) took 35800.18 ms. Allocated memory was 305.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 232.6 MB in the beginning and 1.1 GB in the end (delta: -822.1 MB). Peak memory consumption was 328.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:19,307 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:25:19,308 INFO ]: ChcToBoogie took 122.98 ms. Allocated memory is still 305.1 MB. Free memory was 232.6 MB in the beginning and 227.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:19,308 INFO ]: Boogie Preprocessor took 77.29 ms. Allocated memory is still 305.1 MB. Free memory was 227.6 MB in the beginning and 224.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:19,308 INFO ]: RCFGBuilder took 1524.17 ms. Allocated memory was 305.1 MB in the beginning and 323.5 MB in the end (delta: 18.4 MB). Free memory was 224.6 MB in the beginning and 243.0 MB in the end (delta: -18.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:19,312 INFO ]: BlockEncodingV2 took 759.85 ms. Allocated memory is still 323.5 MB. Free memory was 243.0 MB in the beginning and 202.2 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:19,312 INFO ]: TraceAbstraction took 33301.11 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 202.2 MB in the beginning and 1.1 GB in the end (delta: -852.5 MB). Peak memory consumption was 279.9 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:19,319 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 285 edges - StatisticsResult: Encoded RCFG 135 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 122.98 ms. Allocated memory is still 305.1 MB. Free memory was 232.6 MB in the beginning and 227.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 77.29 ms. Allocated memory is still 305.1 MB. Free memory was 227.6 MB in the beginning and 224.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1524.17 ms. Allocated memory was 305.1 MB in the beginning and 323.5 MB in the end (delta: 18.4 MB). Free memory was 224.6 MB in the beginning and 243.0 MB in the end (delta: -18.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 759.85 ms. Allocated memory is still 323.5 MB. Free memory was 243.0 MB in the beginning and 202.2 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 33301.11 ms. Allocated memory was 323.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 202.2 MB in the beginning and 1.1 GB in the end (delta: -852.5 MB). Peak memory consumption was 279.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(4, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int); [L0] COND TRUE gotoSwitch == 4 [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int, hhv_step_lturn_12_Int, hhv_step_lturn_13_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int, gpav_3_Int, gpav_4_Int, gpav_5_Int, gpav_6_Int, gpav_7_Int, gpav_8_Int, gpav_9_Int, gpav_10_Int, gpav_11_Int, gpav_12_Int, gpav_13_Int; [L0] RET call gotoProc(4, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int); [L0] hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int, hhv_combined_lturn_12_Int, hhv_combined_lturn_13_Int := hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_13_Int, hbv_False_12_Int, hbv_False_14_Int; [L0] havoc hbv_False_12_Int, hbv_False_8_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_14_Int, hbv_False_13_Int, hbv_False_3_Int, hbv_False_10_Int, hbv_False_7_Int, hbv_False_9_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_11_Int, hbv_False_1_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int, hhv_step_lturn_12_Int, hhv_step_lturn_13_Int := hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int, hhv_combined_lturn_12_Int, hhv_combined_lturn_13_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. UNSAFE Result, 33.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4248 SDtfs, 895 SDslu, 7700 SDs, 0 SdLazy, 12250 SolverSat, 2571 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2969occurred 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: 5.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 3457 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 1184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.19.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-25-19-333.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.19.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-25-19-333.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.19.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-25-19-333.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.19.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-25-19-333.csv Received shutdown request...