java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:42:48,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:42:48,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:42:48,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:42:48,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:42:48,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:42:48,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:42:48,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:42:48,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:42:48,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:42:48,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:42:48,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:42:48,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:42:48,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:42:48,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:42:48,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:42:48,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:42:48,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:42:48,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:42:48,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:42:48,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:42:48,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:42:48,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:42:48,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:42:48,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:42:48,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:42:48,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:42:48,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:42:48,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:42:48,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:42:48,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:42:48,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:42:48,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:42:48,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:42:48,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:42:48,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:42:48,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:42:48,809 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:42:48,812 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:42:48,812 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:42:48,813 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:42:48,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:42:48,813 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:42:48,813 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:42:48,814 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:42:48,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:42:48,814 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:42:48,814 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:42:48,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:48,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:42:48,816 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:42:48,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:42:48,816 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:42:48,817 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:42:48,817 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:42:48,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:42:48,817 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:42:48,819 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:42:48,819 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:42:48,855 INFO ]: Repository-Root is: /tmp [2018-06-24 21:42:48,871 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:42:48,878 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:42:48,879 INFO ]: Initializing SmtParser... [2018-06-24 21:42:48,879 INFO ]: SmtParser initialized [2018-06-24 21:42:48,880 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 [2018-06-24 21:42:48,881 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:42:48,969 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@49d59bf3 [2018-06-24 21:42:49,172 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 [2018-06-24 21:42:49,176 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:42:49,186 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:42:49,187 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:42:49,187 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:42:49,187 INFO ]: ChcToBoogie initialized [2018-06-24 21:42:49,190 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,248 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49 Unit [2018-06-24 21:42:49,248 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:42:49,249 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:42:49,249 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:42:49,249 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:42:49,271 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,271 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,277 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,277 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,281 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,283 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,284 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,294 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:42:49,294 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:42:49,294 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:42:49,294 INFO ]: RCFGBuilder initialized [2018-06-24 21:42:49,295 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:42:49,312 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:42:49,313 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:42:49,313 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:42:49,313 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:42:49,313 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:42:49,313 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:49,632 INFO ]: Using library mode [2018-06-24 21:42:49,633 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:49 BoogieIcfgContainer [2018-06-24 21:42:49,633 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:42:49,634 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:42:49,634 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:42:49,635 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:42:49,636 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:49" (1/1) ... [2018-06-24 21:42:49,656 INFO ]: Initial Icfg 12 locations, 19 edges [2018-06-24 21:42:49,657 INFO ]: Using Remove infeasible edges [2018-06-24 21:42:49,658 INFO ]: Using Maximize final states [2018-06-24 21:42:49,658 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:42:49,658 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:42:49,662 INFO ]: Using Remove sink states [2018-06-24 21:42:49,662 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:42:49,662 INFO ]: Using Use SBE [2018-06-24 21:42:49,672 INFO ]: SBE split 0 edges [2018-06-24 21:42:49,677 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:42:49,678 INFO ]: 0 new accepting states [2018-06-24 21:42:49,709 INFO ]: Removed 5 edges and 2 locations by large block encoding [2018-06-24 21:42:49,711 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:49,715 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:42:49,715 INFO ]: 0 new accepting states [2018-06-24 21:42:49,715 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:42:49,715 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:49,715 INFO ]: Encoded RCFG 8 locations, 15 edges [2018-06-24 21:42:49,716 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:49 BasicIcfg [2018-06-24 21:42:49,716 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:42:49,717 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:42:49,717 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:42:49,720 INFO ]: TraceAbstraction initialized [2018-06-24 21:42:49,720 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:49" (1/4) ... [2018-06-24 21:42:49,721 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc7d5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:42:49, skipping insertion in model container [2018-06-24 21:42:49,721 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:49" (2/4) ... [2018-06-24 21:42:49,721 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc7d5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:42:49, skipping insertion in model container [2018-06-24 21:42:49,721 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:49" (3/4) ... [2018-06-24 21:42:49,722 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc7d5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:49, skipping insertion in model container [2018-06-24 21:42:49,722 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:49" (4/4) ... [2018-06-24 21:42:49,723 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:42:49,732 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:42:49,740 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:42:49,781 INFO ]: Using default assertion order modulation [2018-06-24 21:42:49,782 INFO ]: Interprodecural is true [2018-06-24 21:42:49,782 INFO ]: Hoare is false [2018-06-24 21:42:49,782 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:42:49,782 INFO ]: Backedges is TWOTRACK [2018-06-24 21:42:49,782 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:42:49,782 INFO ]: Difference is false [2018-06-24 21:42:49,782 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:42:49,782 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:42:49,791 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:42:49,801 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:49,801 INFO ]: Found error trace [2018-06-24 21:42:49,802 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:49,802 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:49,807 INFO ]: Analyzing trace with hash 1363226160, now seen corresponding path program 1 times [2018-06-24 21:42:49,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:49,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:49,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:49,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:49,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:49,881 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:49,974 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:49,976 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:49,976 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:49,977 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:49,989 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:49,989 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:49,992 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-24 21:42:50,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:50,173 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-24 21:42:50,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:50,175 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:42:50,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:50,189 INFO ]: With dead ends: 13 [2018-06-24 21:42:50,189 INFO ]: Without dead ends: 13 [2018-06-24 21:42:50,191 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:50,203 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:42:50,228 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 21:42:50,229 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:42:50,231 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-24 21:42:50,232 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 6 [2018-06-24 21:42:50,233 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:50,233 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-24 21:42:50,233 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:50,233 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-24 21:42:50,233 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:50,233 INFO ]: Found error trace [2018-06-24 21:42:50,233 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:50,234 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:50,236 INFO ]: Analyzing trace with hash 1363256912, now seen corresponding path program 1 times [2018-06-24 21:42:50,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:50,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:50,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:50,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:50,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:50,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:50,389 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:50,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:50,389 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:50,390 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:50,390 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:50,391 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:50,391 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 4 states. [2018-06-24 21:42:50,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:50,677 INFO ]: Finished difference Result 14 states and 31 transitions. [2018-06-24 21:42:50,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:50,677 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:42:50,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:50,678 INFO ]: With dead ends: 14 [2018-06-24 21:42:50,678 INFO ]: Without dead ends: 14 [2018-06-24 21:42:50,679 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:50,679 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:42:50,681 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 21:42:50,681 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:42:50,682 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2018-06-24 21:42:50,682 INFO ]: Start accepts. Automaton has 11 states and 24 transitions. Word has length 6 [2018-06-24 21:42:50,682 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:50,682 INFO ]: Abstraction has 11 states and 24 transitions. [2018-06-24 21:42:50,682 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:50,682 INFO ]: Start isEmpty. Operand 11 states and 24 transitions. [2018-06-24 21:42:50,682 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:50,682 INFO ]: Found error trace [2018-06-24 21:42:50,682 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:50,682 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:50,683 INFO ]: Analyzing trace with hash -690017402, now seen corresponding path program 1 times [2018-06-24 21:42:50,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:50,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:50,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:50,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:50,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:50,706 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,051 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:42:51,053 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:51,053 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-24 21:42:51,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:51,102 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,107 INFO ]: Computing forward predicates... [2018-06-24 21:42:51,221 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,251 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:51,251 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:42:51,251 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:42:51,251 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:42:51,251 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:51,251 INFO ]: Start difference. First operand 11 states and 24 transitions. Second operand 6 states. [2018-06-24 21:42:51,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:51,484 INFO ]: Finished difference Result 15 states and 34 transitions. [2018-06-24 21:42:51,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:42:51,485 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:42:51,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:51,485 INFO ]: With dead ends: 15 [2018-06-24 21:42:51,485 INFO ]: Without dead ends: 15 [2018-06-24 21:42:51,486 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:42:51,486 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:42:51,488 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-24 21:42:51,488 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:42:51,488 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2018-06-24 21:42:51,488 INFO ]: Start accepts. Automaton has 11 states and 24 transitions. Word has length 7 [2018-06-24 21:42:51,488 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:51,488 INFO ]: Abstraction has 11 states and 24 transitions. [2018-06-24 21:42:51,488 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:42:51,489 INFO ]: Start isEmpty. Operand 11 states and 24 transitions. [2018-06-24 21:42:51,489 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:51,489 INFO ]: Found error trace [2018-06-24 21:42:51,489 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:51,489 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:51,489 INFO ]: Analyzing trace with hash -689957820, now seen corresponding path program 1 times [2018-06-24 21:42:51,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:51,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:51,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:51,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,503 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,541 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,542 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:51,542 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:51,542 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:51,542 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:51,542 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:51,542 INFO ]: Start difference. First operand 11 states and 24 transitions. Second operand 3 states. [2018-06-24 21:42:51,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:51,553 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-24 21:42:51,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:51,553 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:51,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:51,554 INFO ]: With dead ends: 12 [2018-06-24 21:42:51,554 INFO ]: Without dead ends: 10 [2018-06-24 21:42:51,554 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:51,554 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:42:51,555 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:42:51,555 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:42:51,556 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-24 21:42:51,556 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-24 21:42:51,556 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:51,556 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-24 21:42:51,556 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:51,556 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-24 21:42:51,556 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:51,556 INFO ]: Found error trace [2018-06-24 21:42:51,556 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:51,556 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:51,557 INFO ]: Analyzing trace with hash -689301457, now seen corresponding path program 1 times [2018-06-24 21:42:51,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:51,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:51,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:51,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,629 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:51,629 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:51,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:51,652 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,654 INFO ]: Computing forward predicates... [2018-06-24 21:42:51,681 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:51,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:42:51,700 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:42:51,700 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:42:51,701 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:51,701 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 5 states. [2018-06-24 21:42:51,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:51,742 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-24 21:42:51,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:42:51,743 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 21:42:51,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:51,743 INFO ]: With dead ends: 11 [2018-06-24 21:42:51,743 INFO ]: Without dead ends: 9 [2018-06-24 21:42:51,743 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:42:51,743 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:42:51,744 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:42:51,744 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:42:51,745 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-06-24 21:42:51,745 INFO ]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 7 [2018-06-24 21:42:51,745 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:51,745 INFO ]: Abstraction has 9 states and 16 transitions. [2018-06-24 21:42:51,745 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:42:51,745 INFO ]: Start isEmpty. Operand 9 states and 16 transitions. [2018-06-24 21:42:51,745 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:51,745 INFO ]: Found error trace [2018-06-24 21:42:51,745 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:51,745 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:51,745 INFO ]: Analyzing trace with hash -688319315, now seen corresponding path program 1 times [2018-06-24 21:42:51,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:51,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:51,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:51,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,802 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:51,803 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:51,803 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:51,803 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:51,803 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:51,803 INFO ]: Start difference. First operand 9 states and 16 transitions. Second operand 4 states. [2018-06-24 21:42:51,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:51,847 INFO ]: Finished difference Result 13 states and 24 transitions. [2018-06-24 21:42:51,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:51,848 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:42:51,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:51,848 INFO ]: With dead ends: 13 [2018-06-24 21:42:51,848 INFO ]: Without dead ends: 12 [2018-06-24 21:42:51,849 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:51,849 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:42:51,850 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 21:42:51,850 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:42:51,850 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-06-24 21:42:51,850 INFO ]: Start accepts. Automaton has 10 states and 19 transitions. Word has length 7 [2018-06-24 21:42:51,850 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:51,850 INFO ]: Abstraction has 10 states and 19 transitions. [2018-06-24 21:42:51,850 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:51,850 INFO ]: Start isEmpty. Operand 10 states and 19 transitions. [2018-06-24 21:42:51,851 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:51,851 INFO ]: Found error trace [2018-06-24 21:42:51,851 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:51,851 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:51,851 INFO ]: Analyzing trace with hash -688288563, now seen corresponding path program 1 times [2018-06-24 21:42:51,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:51,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:51,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:51,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:51,859 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:51,978 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:51,979 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:51,979 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:51,979 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:51,979 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:51,979 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:51,979 INFO ]: Start difference. First operand 10 states and 19 transitions. Second operand 4 states. [2018-06-24 21:42:52,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:52,072 INFO ]: Finished difference Result 11 states and 20 transitions. [2018-06-24 21:42:52,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:52,072 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:42:52,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:52,073 INFO ]: With dead ends: 11 [2018-06-24 21:42:52,073 INFO ]: Without dead ends: 9 [2018-06-24 21:42:52,073 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:52,073 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:42:52,074 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:42:52,074 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:42:52,074 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-06-24 21:42:52,074 INFO ]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 7 [2018-06-24 21:42:52,074 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:52,074 INFO ]: Abstraction has 9 states and 14 transitions. [2018-06-24 21:42:52,074 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:52,074 INFO ]: Start isEmpty. Operand 9 states and 14 transitions. [2018-06-24 21:42:52,075 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:52,075 INFO ]: Found error trace [2018-06-24 21:42:52,075 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:52,075 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:52,075 INFO ]: Analyzing trace with hash -686472273, now seen corresponding path program 1 times [2018-06-24 21:42:52,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:52,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:52,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:52,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:52,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:52,091 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:52,236 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:52,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:52,237 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:52,237 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:52,237 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:52,237 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:52,237 INFO ]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2018-06-24 21:42:52,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:52,414 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-24 21:42:52,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:52,415 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:42:52,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:52,415 INFO ]: With dead ends: 9 [2018-06-24 21:42:52,415 INFO ]: Without dead ends: 8 [2018-06-24 21:42:52,416 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:52,416 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:42:52,416 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:42:52,416 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:42:52,417 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 21:42:52,417 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-24 21:42:52,417 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:52,417 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 21:42:52,417 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:52,417 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 21:42:52,417 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:52,417 INFO ]: Found error trace [2018-06-24 21:42:52,417 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:52,417 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:52,417 INFO ]: Analyzing trace with hash -686441521, now seen corresponding path program 1 times [2018-06-24 21:42:52,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:52,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:52,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:52,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:52,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:52,434 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:52,461 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:52,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:52,461 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:42:52,461 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:52,461 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:52,461 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:52,461 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2018-06-24 21:42:52,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:52,479 INFO ]: Finished difference Result 5 states and 8 transitions. [2018-06-24 21:42:52,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:52,479 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:42:52,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:52,479 INFO ]: With dead ends: 5 [2018-06-24 21:42:52,479 INFO ]: Without dead ends: 0 [2018-06-24 21:42:52,480 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:52,480 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:42:52,480 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:42:52,480 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:42:52,480 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:42:52,480 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-24 21:42:52,480 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:52,480 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:42:52,480 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:52,480 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:42:52,480 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:42:52,482 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:42:52,483 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:52 BasicIcfg [2018-06-24 21:42:52,483 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:42:52,484 INFO ]: Toolchain (without parser) took 3306.58 ms. Allocated memory was 309.3 MB in the beginning and 326.1 MB in the end (delta: 16.8 MB). Free memory was 264.7 MB in the beginning and 255.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:52,485 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:52,485 INFO ]: ChcToBoogie took 62.11 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:52,486 INFO ]: Boogie Preprocessor took 44.76 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 21:42:52,486 INFO ]: RCFGBuilder took 339.31 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:52,487 INFO ]: BlockEncodingV2 took 81.93 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 246.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:52,487 INFO ]: TraceAbstraction took 2766.45 ms. Allocated memory was 309.3 MB in the beginning and 326.1 MB in the end (delta: 16.8 MB). Free memory was 246.7 MB in the beginning and 255.0 MB in the end (delta: -8.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:52,491 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 19 edges - StatisticsResult: Encoded RCFG 8 locations, 15 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.11 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.76 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 339.31 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 81.93 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 246.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2766.45 ms. Allocated memory was 309.3 MB in the beginning and 326.1 MB in the end (delta: 16.8 MB). Free memory was 246.7 MB in the beginning and 255.0 MB in the end (delta: -8.3 MB). Peak memory consumption was 8.5 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, 8 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 79 SDtfs, 35 SDslu, 133 SDs, 0 SdLazy, 148 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 992 SizeOfPredicates, 11 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 5/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-42-52-510.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-42-52-510.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-42-52-510.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-42-52-510.csv Received shutdown request...