java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_if.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 01:28:54,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 01:28:54,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 01:28:54,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 01:28:54,702 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 01:28:54,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 01:28:54,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 01:28:54,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 01:28:54,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 01:28:54,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 01:28:54,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 01:28:54,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 01:28:54,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 01:28:54,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 01:28:54,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 01:28:54,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 01:28:54,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 01:28:54,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 01:28:54,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 01:28:54,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 01:28:54,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 01:28:54,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 01:28:54,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 01:28:54,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 01:28:54,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 01:28:54,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 01:28:54,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 01:28:54,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 01:28:54,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 01:28:54,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 01:28:54,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 01:28:54,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 01:28:54,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 01:28:54,750 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 01:28:54,750 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 01:28:54,750 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 01:28:54,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 01:28:54,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 01:28:54,775 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 01:28:54,775 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 01:28:54,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 01:28:54,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 01:28:54,779 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 01:28:54,779 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 01:28:54,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 01:28:54,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 01:28:54,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 01:28:54,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 01:28:54,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 01:28:54,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 01:28:54,781 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 01:28:54,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 01:28:54,781 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 01:28:54,781 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 01:28:54,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 01:28:54,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 01:28:54,783 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 01:28:54,784 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 01:28:54,785 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 01:28:54,835 INFO ]: Repository-Root is: /tmp [2018-06-25 01:28:54,850 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 01:28:54,855 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 01:28:54,857 INFO ]: Initializing SmtParser... [2018-06-25 01:28:54,857 INFO ]: SmtParser initialized [2018-06-25 01:28:54,858 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_if.c.smt2 [2018-06-25 01:28:54,859 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-25 01:28:54,944 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_if.c.smt2 unknown [2018-06-25 01:28:55,159 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/simple_if.c.smt2 [2018-06-25 01:28:55,163 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 01:28:55,171 INFO ]: Walking toolchain with 5 elements. [2018-06-25 01:28:55,171 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 01:28:55,171 INFO ]: Initializing ChcToBoogie... [2018-06-25 01:28:55,171 INFO ]: ChcToBoogie initialized [2018-06-25 01:28:55,178 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,222 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55 Unit [2018-06-25 01:28:55,222 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 01:28:55,223 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 01:28:55,223 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 01:28:55,223 INFO ]: Boogie Preprocessor initialized [2018-06-25 01:28:55,243 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,243 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,251 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,252 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,255 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,267 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,268 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,270 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 01:28:55,270 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 01:28:55,270 INFO ]: Initializing RCFGBuilder... [2018-06-25 01:28:55,270 INFO ]: RCFGBuilder initialized [2018-06-25 01:28:55,271 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (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-25 01:28:55,294 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 01:28:55,294 INFO ]: Found specification of procedure gotoProc [2018-06-25 01:28:55,294 INFO ]: Found implementation of procedure gotoProc [2018-06-25 01:28:55,294 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 01:28:55,295 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 01:28:55,295 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-25 01:28:55,539 INFO ]: Using library mode [2018-06-25 01:28:55,540 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:28:55 BoogieIcfgContainer [2018-06-25 01:28:55,540 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 01:28:55,540 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 01:28:55,540 INFO ]: Initializing BlockEncodingV2... [2018-06-25 01:28:55,543 INFO ]: BlockEncodingV2 initialized [2018-06-25 01:28:55,544 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:28:55" (1/1) ... [2018-06-25 01:28:55,568 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 01:28:55,575 INFO ]: Using Remove infeasible edges [2018-06-25 01:28:55,576 INFO ]: Using Maximize final states [2018-06-25 01:28:55,576 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 01:28:55,576 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 01:28:55,578 INFO ]: Using Remove sink states [2018-06-25 01:28:55,581 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 01:28:55,581 INFO ]: Using Use SBE [2018-06-25 01:28:55,599 WARN ]: expecting exponential blowup for input size 19 [2018-06-25 01:28:56,903 WARN ]: Simplifying disjunction of 110544 conjuctions. This might take some time... [2018-06-25 01:29:31,253 INFO ]: Simplified to disjunction of 3136 conjuctions. [2018-06-25 01:29:31,344 INFO ]: SBE split 1 edges [2018-06-25 01:29:31,353 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 01:29:31,354 INFO ]: 0 new accepting states [2018-06-25 01:29:31,397 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 01:29:31,399 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:29:31,405 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 01:29:31,405 INFO ]: 0 new accepting states [2018-06-25 01:29:31,405 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 01:29:31,405 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 01:29:31,406 INFO ]: Encoded RCFG 6 locations, 35 edges [2018-06-25 01:29:31,406 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:29:31 BasicIcfg [2018-06-25 01:29:31,407 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 01:29:31,407 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 01:29:31,407 INFO ]: Initializing TraceAbstraction... [2018-06-25 01:29:31,413 INFO ]: TraceAbstraction initialized [2018-06-25 01:29:31,413 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 01:28:55" (1/4) ... [2018-06-25 01:29:31,415 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33866b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 01:29:31, skipping insertion in model container [2018-06-25 01:29:31,415 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 01:28:55" (2/4) ... [2018-06-25 01:29:31,415 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33866b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 01:29:31, skipping insertion in model container [2018-06-25 01:29:31,415 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 01:28:55" (3/4) ... [2018-06-25 01:29:31,415 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33866b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:29:31, skipping insertion in model container [2018-06-25 01:29:31,415 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 01:29:31" (4/4) ... [2018-06-25 01:29:31,417 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 01:29:31,426 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 01:29:31,436 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 01:29:31,491 INFO ]: Using default assertion order modulation [2018-06-25 01:29:31,492 INFO ]: Interprodecural is true [2018-06-25 01:29:31,492 INFO ]: Hoare is false [2018-06-25 01:29:31,492 INFO ]: Compute interpolants for FPandBP [2018-06-25 01:29:31,492 INFO ]: Backedges is TWOTRACK [2018-06-25 01:29:31,492 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 01:29:31,492 INFO ]: Difference is false [2018-06-25 01:29:31,492 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 01:29:31,492 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 01:29:31,505 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 01:29:31,519 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 01:29:31,519 INFO ]: Found error trace [2018-06-25 01:29:31,520 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 01:29:31,520 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:31,525 INFO ]: Analyzing trace with hash 36325122, now seen corresponding path program 1 times [2018-06-25 01:29:31,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:31,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:31,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:31,575 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:31,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:31,628 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:31,728 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:29:31,731 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:31,731 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:31,733 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:31,748 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:31,748 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:31,751 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 01:29:32,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:32,182 INFO ]: Finished difference Result 7 states and 48 transitions. [2018-06-25 01:29:32,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:32,183 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 01:29:32,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:32,192 INFO ]: With dead ends: 7 [2018-06-25 01:29:32,192 INFO ]: Without dead ends: 7 [2018-06-25 01:29:32,194 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-25 01:29:32,211 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 01:29:32,227 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 01:29:32,229 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 01:29:32,229 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-06-25 01:29:32,230 INFO ]: Start accepts. Automaton has 7 states and 48 transitions. Word has length 5 [2018-06-25 01:29:32,231 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:32,231 INFO ]: Abstraction has 7 states and 48 transitions. [2018-06-25 01:29:32,231 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:32,231 INFO ]: Start isEmpty. Operand 7 states and 48 transitions. [2018-06-25 01:29:32,232 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 01:29:32,232 INFO ]: Found error trace [2018-06-25 01:29:32,232 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 01:29:32,232 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:32,232 INFO ]: Analyzing trace with hash 1125901156, now seen corresponding path program 1 times [2018-06-25 01:29:32,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:32,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:32,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:32,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:32,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:32,242 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:32,305 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:29:32,305 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:32,305 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:32,307 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:32,307 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:32,307 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:32,307 INFO ]: Start difference. First operand 7 states and 48 transitions. Second operand 3 states. [2018-06-25 01:29:32,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:32,527 INFO ]: Finished difference Result 9 states and 72 transitions. [2018-06-25 01:29:32,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:32,527 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 01:29:32,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:32,528 INFO ]: With dead ends: 9 [2018-06-25 01:29:32,528 INFO ]: Without dead ends: 9 [2018-06-25 01:29:32,529 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-25 01:29:32,529 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 01:29:32,532 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 01:29:32,532 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 01:29:32,532 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-06-25 01:29:32,532 INFO ]: Start accepts. Automaton has 9 states and 72 transitions. Word has length 6 [2018-06-25 01:29:32,532 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:32,532 INFO ]: Abstraction has 9 states and 72 transitions. [2018-06-25 01:29:32,532 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:32,533 INFO ]: Start isEmpty. Operand 9 states and 72 transitions. [2018-06-25 01:29:32,533 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:29:32,533 INFO ]: Found error trace [2018-06-25 01:29:32,533 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:32,533 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:32,533 INFO ]: Analyzing trace with hash 542960260, now seen corresponding path program 1 times [2018-06-25 01:29:32,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:32,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:32,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:32,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:32,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:32,543 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:32,580 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 01:29:32,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:32,581 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:32,581 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:32,581 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:32,581 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:32,581 INFO ]: Start difference. First operand 9 states and 72 transitions. Second operand 3 states. [2018-06-25 01:29:32,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:32,786 INFO ]: Finished difference Result 13 states and 130 transitions. [2018-06-25 01:29:32,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:32,786 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 01:29:32,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:32,787 INFO ]: With dead ends: 13 [2018-06-25 01:29:32,787 INFO ]: Without dead ends: 13 [2018-06-25 01:29:32,787 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-25 01:29:32,788 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 01:29:32,791 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 01:29:32,792 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 01:29:32,792 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2018-06-25 01:29:32,793 INFO ]: Start accepts. Automaton has 11 states and 110 transitions. Word has length 7 [2018-06-25 01:29:32,793 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:32,793 INFO ]: Abstraction has 11 states and 110 transitions. [2018-06-25 01:29:32,793 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:32,793 INFO ]: Start isEmpty. Operand 11 states and 110 transitions. [2018-06-25 01:29:32,793 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 01:29:32,793 INFO ]: Found error trace [2018-06-25 01:29:32,793 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:32,793 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:32,794 INFO ]: Analyzing trace with hash 542424022, now seen corresponding path program 1 times [2018-06-25 01:29:32,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:32,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:32,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:32,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:32,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:32,806 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:32,841 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:29:32,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:32,841 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:32,841 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:32,841 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:32,841 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:32,841 INFO ]: Start difference. First operand 11 states and 110 transitions. Second operand 3 states. [2018-06-25 01:29:33,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:33,342 INFO ]: Finished difference Result 11 states and 83 transitions. [2018-06-25 01:29:33,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:33,342 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 01:29:33,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:33,343 INFO ]: With dead ends: 11 [2018-06-25 01:29:33,343 INFO ]: Without dead ends: 11 [2018-06-25 01:29:33,343 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-25 01:29:33,343 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 01:29:33,345 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 01:29:33,345 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 01:29:33,346 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2018-06-25 01:29:33,346 INFO ]: Start accepts. Automaton has 11 states and 83 transitions. Word has length 7 [2018-06-25 01:29:33,346 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:33,346 INFO ]: Abstraction has 11 states and 83 transitions. [2018-06-25 01:29:33,346 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:33,346 INFO ]: Start isEmpty. Operand 11 states and 83 transitions. [2018-06-25 01:29:33,347 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:29:33,347 INFO ]: Found error trace [2018-06-25 01:29:33,347 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:33,347 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:33,347 INFO ]: Analyzing trace with hash -375656679, now seen corresponding path program 1 times [2018-06-25 01:29:33,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:33,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:33,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:33,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:33,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:33,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:33,439 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 01:29:33,439 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:33,439 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:33,439 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:33,439 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:33,439 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:33,439 INFO ]: Start difference. First operand 11 states and 83 transitions. Second operand 3 states. [2018-06-25 01:29:33,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:33,868 INFO ]: Finished difference Result 17 states and 140 transitions. [2018-06-25 01:29:33,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:33,869 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:29:33,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:33,870 INFO ]: With dead ends: 17 [2018-06-25 01:29:33,870 INFO ]: Without dead ends: 17 [2018-06-25 01:29:33,870 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-25 01:29:33,870 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 01:29:33,873 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 01:29:33,873 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 01:29:33,874 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 140 transitions. [2018-06-25 01:29:33,874 INFO ]: Start accepts. Automaton has 17 states and 140 transitions. Word has length 8 [2018-06-25 01:29:33,874 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:33,874 INFO ]: Abstraction has 17 states and 140 transitions. [2018-06-25 01:29:33,874 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:33,874 INFO ]: Start isEmpty. Operand 17 states and 140 transitions. [2018-06-25 01:29:33,875 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:29:33,875 INFO ]: Found error trace [2018-06-25 01:29:33,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:33,875 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:33,875 INFO ]: Analyzing trace with hash -289709644, now seen corresponding path program 1 times [2018-06-25 01:29:33,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:33,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:33,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:33,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:33,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:33,887 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:33,924 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 01:29:33,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:33,924 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:33,924 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:33,924 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:33,924 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:33,924 INFO ]: Start difference. First operand 17 states and 140 transitions. Second operand 3 states. [2018-06-25 01:29:33,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:33,991 INFO ]: Finished difference Result 24 states and 203 transitions. [2018-06-25 01:29:33,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:33,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:29:33,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:33,994 INFO ]: With dead ends: 24 [2018-06-25 01:29:33,994 INFO ]: Without dead ends: 24 [2018-06-25 01:29:33,994 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 01:29:33,994 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 01:29:33,999 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-25 01:29:33,999 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 01:29:34,000 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 194 transitions. [2018-06-25 01:29:34,000 INFO ]: Start accepts. Automaton has 22 states and 194 transitions. Word has length 8 [2018-06-25 01:29:34,000 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:34,000 INFO ]: Abstraction has 22 states and 194 transitions. [2018-06-25 01:29:34,000 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:34,000 INFO ]: Start isEmpty. Operand 22 states and 194 transitions. [2018-06-25 01:29:34,001 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 01:29:34,001 INFO ]: Found error trace [2018-06-25 01:29:34,001 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:34,001 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:34,001 INFO ]: Analyzing trace with hash -289620271, now seen corresponding path program 1 times [2018-06-25 01:29:34,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:34,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:34,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:34,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:34,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:34,010 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:34,039 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 01:29:34,039 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:34,039 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:34,039 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:34,040 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:34,040 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:34,040 INFO ]: Start difference. First operand 22 states and 194 transitions. Second operand 3 states. [2018-06-25 01:29:34,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:34,121 INFO ]: Finished difference Result 26 states and 153 transitions. [2018-06-25 01:29:34,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:34,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 01:29:34,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:34,122 INFO ]: With dead ends: 26 [2018-06-25 01:29:34,122 INFO ]: Without dead ends: 20 [2018-06-25 01:29:34,122 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-25 01:29:34,122 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 01:29:34,124 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-25 01:29:34,124 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 01:29:34,124 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-06-25 01:29:34,124 INFO ]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 8 [2018-06-25 01:29:34,124 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:34,124 INFO ]: Abstraction has 18 states and 38 transitions. [2018-06-25 01:29:34,125 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:34,125 INFO ]: Start isEmpty. Operand 18 states and 38 transitions. [2018-06-25 01:29:34,125 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 01:29:34,125 INFO ]: Found error trace [2018-06-25 01:29:34,125 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:34,125 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:34,125 INFO ]: Analyzing trace with hash -2102230245, now seen corresponding path program 1 times [2018-06-25 01:29:34,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:34,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:34,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:34,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:34,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:34,140 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:34,206 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 01:29:34,206 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 01:29:34,206 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 01:29:34,206 INFO ]: Interpolant automaton has 3 states [2018-06-25 01:29:34,206 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 01:29:34,206 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 01:29:34,206 INFO ]: Start difference. First operand 18 states and 38 transitions. Second operand 3 states. [2018-06-25 01:29:34,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:34,306 INFO ]: Finished difference Result 18 states and 27 transitions. [2018-06-25 01:29:34,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:34,306 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 01:29:34,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:34,307 INFO ]: With dead ends: 18 [2018-06-25 01:29:34,307 INFO ]: Without dead ends: 18 [2018-06-25 01:29:34,307 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-25 01:29:34,307 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 01:29:34,308 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 01:29:34,308 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 01:29:34,309 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-06-25 01:29:34,309 INFO ]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 12 [2018-06-25 01:29:34,309 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:34,309 INFO ]: Abstraction has 18 states and 27 transitions. [2018-06-25 01:29:34,309 INFO ]: Interpolant automaton has 3 states. [2018-06-25 01:29:34,309 INFO ]: Start isEmpty. Operand 18 states and 27 transitions. [2018-06-25 01:29:34,310 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 01:29:34,310 INFO ]: Found error trace [2018-06-25 01:29:34,310 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 01:29:34,310 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 01:29:34,310 INFO ]: Analyzing trace with hash 1763299786, now seen corresponding path program 1 times [2018-06-25 01:29:34,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 01:29:34,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 01:29:34,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:34,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:34,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 01:29:34,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:34,363 INFO ]: Checked inductivity of 28 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 01:29:34,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 01:29:34,363 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 01:29:34,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 01:29:34,419 INFO ]: Conjunction of SSA is unsat [2018-06-25 01:29:34,425 INFO ]: Computing forward predicates... [2018-06-25 01:29:34,452 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 01:29:34,484 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 01:29:34,484 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-25 01:29:34,484 INFO ]: Interpolant automaton has 4 states [2018-06-25 01:29:34,484 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 01:29:34,484 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:29:34,485 INFO ]: Start difference. First operand 18 states and 27 transitions. Second operand 4 states. [2018-06-25 01:29:34,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 01:29:34,813 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-25 01:29:34,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 01:29:34,814 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-25 01:29:34,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 01:29:34,814 INFO ]: With dead ends: 14 [2018-06-25 01:29:34,814 INFO ]: Without dead ends: 0 [2018-06-25 01:29:34,814 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 01:29:34,814 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 01:29:34,814 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 01:29:34,814 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 01:29:34,814 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 01:29:34,814 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-06-25 01:29:34,814 INFO ]: Finished accepts. word is rejected. [2018-06-25 01:29:34,814 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 01:29:34,814 INFO ]: Interpolant automaton has 4 states. [2018-06-25 01:29:34,814 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 01:29:34,814 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 01:29:34,817 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 01:29:34,818 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 01:29:34 BasicIcfg [2018-06-25 01:29:34,818 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 01:29:34,819 INFO ]: Toolchain (without parser) took 39655.28 ms. Allocated memory was 306.7 MB in the beginning and 676.9 MB in the end (delta: 370.1 MB). Free memory was 262.1 MB in the beginning and 454.5 MB in the end (delta: -192.4 MB). Peak memory consumption was 177.7 MB. Max. memory is 3.6 GB. [2018-06-25 01:29:34,821 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:29:34,821 INFO ]: ChcToBoogie took 51.48 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:29:34,822 INFO ]: Boogie Preprocessor took 47.00 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 258.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 01:29:34,822 INFO ]: RCFGBuilder took 269.72 ms. Allocated memory is still 306.7 MB. Free memory was 258.1 MB in the beginning and 249.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 01:29:34,823 INFO ]: BlockEncodingV2 took 35866.12 ms. Allocated memory was 306.7 MB in the beginning and 438.3 MB in the end (delta: 131.6 MB). Free memory was 249.1 MB in the beginning and 148.4 MB in the end (delta: 100.7 MB). Peak memory consumption was 312.4 MB. Max. memory is 3.6 GB. [2018-06-25 01:29:34,823 INFO ]: TraceAbstraction took 3410.96 ms. Allocated memory was 438.3 MB in the beginning and 676.9 MB in the end (delta: 238.6 MB). Free memory was 148.4 MB in the beginning and 454.5 MB in the end (delta: -306.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 01:29:34,829 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, 35 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.48 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.00 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 258.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 269.72 ms. Allocated memory is still 306.7 MB. Free memory was 258.1 MB in the beginning and 249.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 35866.12 ms. Allocated memory was 306.7 MB in the beginning and 438.3 MB in the end (delta: 131.6 MB). Free memory was 249.1 MB in the beginning and 148.4 MB in the end (delta: 100.7 MB). Peak memory consumption was 312.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3410.96 ms. Allocated memory was 438.3 MB in the beginning and 676.9 MB in the end (delta: 238.6 MB). Free memory was 148.4 MB in the beginning and 454.5 MB in the end (delta: -306.1 MB). There was no memory consumed. 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, 3.3s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 4 SDslu, 27 SDs, 0 SdLazy, 406 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=6, 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 100/109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_if.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_01-29-34-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_if.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_01-29-34-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_if.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_01-29-34-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_if.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_01-29-34-850.csv Received shutdown request...