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/nested1.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:37:21,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:37:21,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:37:21,638 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:37:21,638 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:37:21,639 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:37:21,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:37:21,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:37:21,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:37:21,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:37:21,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:37:21,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:37:21,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:37:21,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:37:21,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:37:21,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:37:21,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:37:21,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:37:21,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:37:21,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:37:21,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:37:21,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:37:21,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:37:21,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:37:21,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:37:21,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:37:21,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:37:21,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:37:21,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:37:21,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:37:21,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:37:21,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:37:21,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:37:21,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:37:21,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:37:21,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:37:21,683 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:37:21,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:37:21,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:37:21,713 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:37:21,713 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:37:21,714 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:37:21,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:37:21,714 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:37:21,714 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:37:21,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:37:21,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:37:21,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:37:21,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:37:21,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:37:21,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:37:21,719 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:37:21,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:37:21,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:37:21,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:37:21,720 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:37:21,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:37:21,720 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:37:21,722 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:37:21,723 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:37:21,773 INFO ]: Repository-Root is: /tmp [2018-06-26 21:37:21,786 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:37:21,790 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:37:21,791 INFO ]: Initializing SmtParser... [2018-06-26 21:37:21,791 INFO ]: SmtParser initialized [2018-06-26 21:37:21,792 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested1.c.smt2 [2018-06-26 21:37:21,793 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:37:21,888 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested1.c.smt2 unknown [2018-06-26 21:37:22,117 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested1.c.smt2 [2018-06-26 21:37:22,121 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:37:22,127 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:37:22,127 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:37:22,127 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:37:22,128 INFO ]: ChcToBoogie initialized [2018-06-26 21:37:22,131 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,189 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22 Unit [2018-06-26 21:37:22,189 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:37:22,190 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:37:22,190 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:37:22,190 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:37:22,211 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,211 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,217 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,218 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,223 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,230 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,231 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,241 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:37:22,242 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:37:22,242 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:37:22,242 INFO ]: RCFGBuilder initialized [2018-06-26 21:37:22,243 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:37:22,256 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:37:22,256 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:37:22,256 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:37:22,256 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:37:22,256 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:37:22,256 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:37:22,480 INFO ]: Using library mode [2018-06-26 21:37:22,481 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:37:22 BoogieIcfgContainer [2018-06-26 21:37:22,481 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:37:22,482 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:37:22,482 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:37:22,489 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:37:22,490 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:37:22" (1/1) ... [2018-06-26 21:37:22,506 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:37:22,507 INFO ]: Using Remove infeasible edges [2018-06-26 21:37:22,508 INFO ]: Using Maximize final states [2018-06-26 21:37:22,508 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:37:22,509 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:37:22,512 INFO ]: Using Remove sink states [2018-06-26 21:37:22,513 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:37:22,513 INFO ]: Using Use SBE [2018-06-26 21:37:22,535 WARN ]: expecting exponential blowup for input size 23 [2018-06-26 21:37:32,694 INFO ]: SBE split 1 edges [2018-06-26 21:37:32,705 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:37:32,706 INFO ]: 0 new accepting states [2018-06-26 21:37:32,736 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:37:32,738 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:37:32,744 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:37:32,744 INFO ]: 0 new accepting states [2018-06-26 21:37:32,744 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:37:32,745 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:37:32,749 INFO ]: Encoded RCFG 6 locations, 98 edges [2018-06-26 21:37:32,749 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:37:32 BasicIcfg [2018-06-26 21:37:32,749 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:37:32,750 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:37:32,750 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:37:32,754 INFO ]: TraceAbstraction initialized [2018-06-26 21:37:32,755 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:37:22" (1/4) ... [2018-06-26 21:37:32,756 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc40b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:37:32, skipping insertion in model container [2018-06-26 21:37:32,756 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:37:22" (2/4) ... [2018-06-26 21:37:32,756 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc40b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:37:32, skipping insertion in model container [2018-06-26 21:37:32,756 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:37:22" (3/4) ... [2018-06-26 21:37:32,756 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc40b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:37:32, skipping insertion in model container [2018-06-26 21:37:32,756 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:37:32" (4/4) ... [2018-06-26 21:37:32,759 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:37:32,766 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:37:32,772 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:37:32,816 INFO ]: Using default assertion order modulation [2018-06-26 21:37:32,816 INFO ]: Interprodecural is true [2018-06-26 21:37:32,816 INFO ]: Hoare is false [2018-06-26 21:37:32,816 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:37:32,817 INFO ]: Backedges is TWOTRACK [2018-06-26 21:37:32,817 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:37:32,817 INFO ]: Difference is false [2018-06-26 21:37:32,817 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:37:32,817 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:37:32,831 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:37:32,844 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:37:32,844 INFO ]: Found error trace [2018-06-26 21:37:32,845 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:37:32,845 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:32,850 INFO ]: Analyzing trace with hash 38262498, now seen corresponding path program 1 times [2018-06-26 21:37:32,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:32,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:32,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:32,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:32,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:32,918 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:32,996 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:37:32,998 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:32,998 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:33,000 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:33,010 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:33,011 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:33,013 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:37:34,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:34,180 INFO ]: Finished difference Result 7 states and 127 transitions. [2018-06-26 21:37:34,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:34,181 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:37:34,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:34,190 INFO ]: With dead ends: 7 [2018-06-26 21:37:34,190 INFO ]: Without dead ends: 7 [2018-06-26 21:37:34,192 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:37:34,207 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:37:34,224 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:37:34,226 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:37:34,227 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2018-06-26 21:37:34,228 INFO ]: Start accepts. Automaton has 7 states and 127 transitions. Word has length 5 [2018-06-26 21:37:34,229 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:34,229 INFO ]: Abstraction has 7 states and 127 transitions. [2018-06-26 21:37:34,229 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:34,229 INFO ]: Start isEmpty. Operand 7 states and 127 transitions. [2018-06-26 21:37:34,230 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:37:34,230 INFO ]: Found error trace [2018-06-26 21:37:34,230 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:37:34,230 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:34,230 INFO ]: Analyzing trace with hash 1185096834, now seen corresponding path program 1 times [2018-06-26 21:37:34,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:34,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:34,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:34,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:34,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:34,243 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:34,311 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:37:34,311 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:34,311 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:34,312 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:34,312 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:34,313 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:34,313 INFO ]: Start difference. First operand 7 states and 127 transitions. Second operand 3 states. [2018-06-26 21:37:35,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:35,294 INFO ]: Finished difference Result 9 states and 168 transitions. [2018-06-26 21:37:35,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:35,318 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:37:35,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:35,319 INFO ]: With dead ends: 9 [2018-06-26 21:37:35,320 INFO ]: Without dead ends: 9 [2018-06-26 21:37:35,320 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:37:35,321 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:37:35,324 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:37:35,324 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:37:35,325 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2018-06-26 21:37:35,325 INFO ]: Start accepts. Automaton has 9 states and 168 transitions. Word has length 6 [2018-06-26 21:37:35,325 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:35,325 INFO ]: Abstraction has 9 states and 168 transitions. [2018-06-26 21:37:35,325 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:35,325 INFO ]: Start isEmpty. Operand 9 states and 168 transitions. [2018-06-26 21:37:35,326 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:37:35,326 INFO ]: Found error trace [2018-06-26 21:37:35,326 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:37:35,326 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:35,326 INFO ]: Analyzing trace with hash 1184143522, now seen corresponding path program 1 times [2018-06-26 21:37:35,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:35,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:35,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:35,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:35,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:35,335 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:35,369 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:37:35,370 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:35,370 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:35,370 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:35,370 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:35,370 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:35,370 INFO ]: Start difference. First operand 9 states and 168 transitions. Second operand 3 states. [2018-06-26 21:37:35,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:35,712 INFO ]: Finished difference Result 13 states and 248 transitions. [2018-06-26 21:37:35,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:35,712 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:37:35,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:35,715 INFO ]: With dead ends: 13 [2018-06-26 21:37:35,715 INFO ]: Without dead ends: 13 [2018-06-26 21:37:35,715 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:37:35,715 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:37:35,720 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:37:35,720 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:37:35,721 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2018-06-26 21:37:35,722 INFO ]: Start accepts. Automaton has 13 states and 248 transitions. Word has length 6 [2018-06-26 21:37:35,722 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:35,722 INFO ]: Abstraction has 13 states and 248 transitions. [2018-06-26 21:37:35,722 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:35,722 INFO ]: Start isEmpty. Operand 13 states and 248 transitions. [2018-06-26 21:37:35,722 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:37:35,722 INFO ]: Found error trace [2018-06-26 21:37:35,722 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:35,723 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:35,723 INFO ]: Analyzing trace with hash -238512483, now seen corresponding path program 1 times [2018-06-26 21:37:35,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:35,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:35,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:35,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:35,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:35,740 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:35,812 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 21:37:35,812 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:35,812 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:35,812 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:35,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:35,813 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:35,813 INFO ]: Start difference. First operand 13 states and 248 transitions. Second operand 3 states. [2018-06-26 21:37:36,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:36,095 INFO ]: Finished difference Result 13 states and 176 transitions. [2018-06-26 21:37:36,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:36,095 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:37:36,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:36,096 INFO ]: With dead ends: 13 [2018-06-26 21:37:36,096 INFO ]: Without dead ends: 13 [2018-06-26 21:37:36,096 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:37:36,096 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:37:36,099 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:37:36,099 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:37:36,100 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 176 transitions. [2018-06-26 21:37:36,100 INFO ]: Start accepts. Automaton has 13 states and 176 transitions. Word has length 8 [2018-06-26 21:37:36,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:36,100 INFO ]: Abstraction has 13 states and 176 transitions. [2018-06-26 21:37:36,100 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:36,100 INFO ]: Start isEmpty. Operand 13 states and 176 transitions. [2018-06-26 21:37:36,100 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:37:36,100 INFO ]: Found error trace [2018-06-26 21:37:36,101 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:36,101 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:36,101 INFO ]: Analyzing trace with hash -1333019236, now seen corresponding path program 1 times [2018-06-26 21:37:36,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:36,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:36,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,102 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:36,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:36,132 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:37:36,132 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:36,132 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:36,132 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:36,132 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:36,132 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:36,132 INFO ]: Start difference. First operand 13 states and 176 transitions. Second operand 3 states. [2018-06-26 21:37:36,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:36,447 INFO ]: Finished difference Result 18 states and 174 transitions. [2018-06-26 21:37:36,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:36,447 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 21:37:36,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:36,448 INFO ]: With dead ends: 18 [2018-06-26 21:37:36,448 INFO ]: Without dead ends: 17 [2018-06-26 21:37:36,448 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:37:36,448 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:37:36,451 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 21:37:36,451 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:37:36,451 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 127 transitions. [2018-06-26 21:37:36,452 INFO ]: Start accepts. Automaton has 17 states and 127 transitions. Word has length 9 [2018-06-26 21:37:36,452 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:36,452 INFO ]: Abstraction has 17 states and 127 transitions. [2018-06-26 21:37:36,452 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:36,452 INFO ]: Start isEmpty. Operand 17 states and 127 transitions. [2018-06-26 21:37:36,452 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:37:36,452 INFO ]: Found error trace [2018-06-26 21:37:36,452 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:36,452 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:36,452 INFO ]: Analyzing trace with hash 1970480736, now seen corresponding path program 1 times [2018-06-26 21:37:36,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:36,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:36,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:36,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,467 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:36,539 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:37:36,539 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:36,539 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:36,540 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:36,540 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:36,540 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:36,540 INFO ]: Start difference. First operand 17 states and 127 transitions. Second operand 3 states. [2018-06-26 21:37:36,622 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:36,622 INFO ]: Finished difference Result 17 states and 102 transitions. [2018-06-26 21:37:36,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:36,622 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:37:36,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:36,623 INFO ]: With dead ends: 17 [2018-06-26 21:37:36,623 INFO ]: Without dead ends: 17 [2018-06-26 21:37:36,623 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:37:36,623 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 21:37:36,625 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 21:37:36,625 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 21:37:36,626 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-06-26 21:37:36,626 INFO ]: Start accepts. Automaton has 17 states and 102 transitions. Word has length 10 [2018-06-26 21:37:36,626 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:36,626 INFO ]: Abstraction has 17 states and 102 transitions. [2018-06-26 21:37:36,626 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:36,626 INFO ]: Start isEmpty. Operand 17 states and 102 transitions. [2018-06-26 21:37:36,627 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:37:36,627 INFO ]: Found error trace [2018-06-26 21:37:36,627 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:36,627 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:36,627 INFO ]: Analyzing trace with hash 1472639148, now seen corresponding path program 1 times [2018-06-26 21:37:36,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:36,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:36,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:36,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:36,718 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:37:36,718 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:36,718 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:36,718 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:36,718 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:36,719 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:36,719 INFO ]: Start difference. First operand 17 states and 102 transitions. Second operand 3 states. [2018-06-26 21:37:36,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:36,918 INFO ]: Finished difference Result 29 states and 183 transitions. [2018-06-26 21:37:36,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:36,921 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 21:37:36,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:36,924 INFO ]: With dead ends: 29 [2018-06-26 21:37:36,924 INFO ]: Without dead ends: 29 [2018-06-26 21:37:36,924 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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:37:36,924 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 21:37:36,928 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-06-26 21:37:36,928 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 21:37:36,930 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2018-06-26 21:37:36,930 INFO ]: Start accepts. Automaton has 24 states and 171 transitions. Word has length 11 [2018-06-26 21:37:36,930 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:36,930 INFO ]: Abstraction has 24 states and 171 transitions. [2018-06-26 21:37:36,930 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:36,930 INFO ]: Start isEmpty. Operand 24 states and 171 transitions. [2018-06-26 21:37:36,931 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:37:36,931 INFO ]: Found error trace [2018-06-26 21:37:36,931 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:37:36,931 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:37:36,931 INFO ]: Analyzing trace with hash 660849629, now seen corresponding path program 1 times [2018-06-26 21:37:36,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:37:36,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:37:36,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:37:36,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:37:36,953 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:37:36,998 INFO ]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 21:37:36,998 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:37:36,998 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:37:36,999 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:37:36,999 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:37:36,999 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:37:36,999 INFO ]: Start difference. First operand 24 states and 171 transitions. Second operand 3 states. [2018-06-26 21:37:37,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:37:37,084 INFO ]: Finished difference Result 19 states and 135 transitions. [2018-06-26 21:37:37,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:37:37,084 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 21:37:37,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:37:37,084 INFO ]: With dead ends: 19 [2018-06-26 21:37:37,085 INFO ]: Without dead ends: 0 [2018-06-26 21:37:37,085 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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:37:37,085 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:37:37,085 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:37:37,085 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:37:37,085 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:37:37,085 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-06-26 21:37:37,085 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:37:37,085 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:37:37,085 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:37:37,085 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:37:37,085 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:37:37,087 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:37:37,088 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:37:37 BasicIcfg [2018-06-26 21:37:37,088 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:37:37,089 INFO ]: Toolchain (without parser) took 14966.63 ms. Allocated memory was 303.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 257.4 MB in the beginning and 707.4 MB in the end (delta: -450.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-26 21:37:37,090 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:37:37,091 INFO ]: ChcToBoogie took 62.19 ms. Allocated memory is still 303.0 MB. Free memory was 256.3 MB in the beginning and 254.3 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:37:37,091 INFO ]: Boogie Preprocessor took 51.18 ms. Allocated memory is still 303.0 MB. Free memory was 254.3 MB in the beginning and 253.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 21:37:37,093 INFO ]: RCFGBuilder took 239.53 ms. Allocated memory is still 303.0 MB. Free memory was 253.3 MB in the beginning and 244.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:37:37,093 INFO ]: BlockEncodingV2 took 10267.59 ms. Allocated memory was 303.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 244.3 MB in the beginning and 1.0 GB in the end (delta: -768.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-26 21:37:37,094 INFO ]: TraceAbstraction took 4337.68 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 707.4 MB in the end (delta: 305.0 MB). Peak memory consumption was 305.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:37:37,103 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, 98 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.19 ms. Allocated memory is still 303.0 MB. Free memory was 256.3 MB in the beginning and 254.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.18 ms. Allocated memory is still 303.0 MB. Free memory was 254.3 MB in the beginning and 253.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 239.53 ms. Allocated memory is still 303.0 MB. Free memory was 253.3 MB in the beginning and 244.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 10267.59 ms. Allocated memory was 303.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 244.3 MB in the beginning and 1.0 GB in the end (delta: -768.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. * TraceAbstraction took 4337.68 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 707.4 MB in the end (delta: 305.0 MB). Peak memory consumption was 305.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 4 SDslu, 24 SDs, 0 SdLazy, 850 SolverSat, 710 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 99/99 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/nested1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-37-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-37-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-37-37-127.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested1.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-37-37-127.csv Received shutdown request...