java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental.36.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:34:43,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:34:43,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:34:43,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:34:43,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:34:43,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:34:43,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:34:43,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:34:43,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:34:43,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:34:43,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:34:43,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:34:43,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:34:43,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:34:43,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:34:43,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:34:43,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:34:43,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:34:43,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:34:43,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:34:43,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:34:43,920 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:34:43,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:34:43,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:34:43,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:34:43,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:34:43,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:34:43,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:34:43,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:34:43,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:34:43,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:34:43,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:34:43,928 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:34:43,928 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:34:43,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:34:43,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:34:43,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:34:43,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:34:43,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:34:43,944 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:34:43,944 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:34:43,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:34:43,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:34:43,945 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:34:43,946 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:34:43,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:34:43,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:34:43,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:34:43,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:34:43,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:34:43,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:34:43,947 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:34:43,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:34:43,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:34:43,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:34:43,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:34:43,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:34:43,949 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:34:43,950 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:34:43,951 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:34:44,006 INFO ]: Repository-Root is: /tmp [2018-06-26 17:34:44,022 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:34:44,028 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:34:44,030 INFO ]: Initializing SmtParser... [2018-06-26 17:34:44,030 INFO ]: SmtParser initialized [2018-06-26 17:34:44,031 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental.36.smt2 [2018-06-26 17:34:44,032 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:34:44,120 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental.36.smt2 unknown [2018-06-26 17:34:44,898 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental.36.smt2 [2018-06-26 17:34:44,902 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:34:44,909 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:34:44,909 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:34:44,909 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:34:44,910 INFO ]: ChcToBoogie initialized [2018-06-26 17:34:44,913 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:34:44" (1/1) ... [2018-06-26 17:34:45,037 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45 Unit [2018-06-26 17:34:45,037 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:34:45,038 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:34:45,038 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:34:45,038 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:34:45,060 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,061 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,078 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,078 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,103 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,112 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,125 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... [2018-06-26 17:34:45,141 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:34:45,141 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:34:45,141 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:34:45,141 INFO ]: RCFGBuilder initialized [2018-06-26 17:34:45,142 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:34:45,162 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:34:45,162 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:34:45,162 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:34:45,162 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:34:45,162 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:34:45,162 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:34:47,615 INFO ]: Using library mode [2018-06-26 17:34:47,616 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:34:47 BoogieIcfgContainer [2018-06-26 17:34:47,616 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:34:47,617 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:34:47,617 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:34:47,620 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:34:47,620 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:34:47" (1/1) ... [2018-06-26 17:34:47,664 INFO ]: Initial Icfg 146 locations, 282 edges [2018-06-26 17:34:47,666 INFO ]: Using Remove infeasible edges [2018-06-26 17:34:47,667 INFO ]: Using Maximize final states [2018-06-26 17:34:47,667 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:34:47,667 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:34:47,669 INFO ]: Using Remove sink states [2018-06-26 17:34:47,670 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:34:47,670 INFO ]: Using Use SBE [2018-06-26 17:34:47,692 INFO ]: SBE split 0 edges [2018-06-26 17:34:47,707 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:34:47,709 INFO ]: 0 new accepting states [2018-06-26 17:34:48,589 INFO ]: Removed 54 edges and 8 locations by large block encoding [2018-06-26 17:34:48,595 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:34:48,603 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:34:48,604 INFO ]: 0 new accepting states [2018-06-26 17:34:48,610 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:34:48,611 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:34:48,613 INFO ]: Encoded RCFG 135 locations, 270 edges [2018-06-26 17:34:48,613 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:34:48 BasicIcfg [2018-06-26 17:34:48,613 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:34:48,615 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:34:48,615 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:34:48,622 INFO ]: TraceAbstraction initialized [2018-06-26 17:34:48,622 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:34:44" (1/4) ... [2018-06-26 17:34:48,623 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e26442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:34:48, skipping insertion in model container [2018-06-26 17:34:48,623 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:34:45" (2/4) ... [2018-06-26 17:34:48,623 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e26442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:34:48, skipping insertion in model container [2018-06-26 17:34:48,623 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:34:47" (3/4) ... [2018-06-26 17:34:48,624 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e26442c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:34:48, skipping insertion in model container [2018-06-26 17:34:48,624 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:34:48" (4/4) ... [2018-06-26 17:34:48,628 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:34:48,638 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:34:48,646 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:34:48,703 INFO ]: Using default assertion order modulation [2018-06-26 17:34:48,704 INFO ]: Interprodecural is true [2018-06-26 17:34:48,704 INFO ]: Hoare is false [2018-06-26 17:34:48,704 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:34:48,704 INFO ]: Backedges is TWOTRACK [2018-06-26 17:34:48,704 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:34:48,704 INFO ]: Difference is false [2018-06-26 17:34:48,704 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:34:48,704 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:34:48,726 INFO ]: Start isEmpty. Operand 135 states. [2018-06-26 17:34:48,792 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:34:48,792 INFO ]: Found error trace [2018-06-26 17:34:48,794 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:34:48,794 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:34:48,799 INFO ]: Analyzing trace with hash 5699023, now seen corresponding path program 1 times [2018-06-26 17:34:48,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:34:48,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:34:48,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:48,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:34:48,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:48,948 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:34:49,193 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:34:49,196 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:34:49,196 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:34:49,198 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:34:49,214 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:34:49,214 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:34:49,217 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-26 17:34:50,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:34:50,924 INFO ]: Finished difference Result 267 states and 537 transitions. [2018-06-26 17:34:50,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:34:50,925 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:34:50,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:34:50,967 INFO ]: With dead ends: 267 [2018-06-26 17:34:50,967 INFO ]: Without dead ends: 267 [2018-06-26 17:34:50,971 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:34:50,991 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-26 17:34:51,110 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-26 17:34:51,112 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-26 17:34:51,134 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 537 transitions. [2018-06-26 17:34:51,135 INFO ]: Start accepts. Automaton has 267 states and 537 transitions. Word has length 4 [2018-06-26 17:34:51,137 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:34:51,137 INFO ]: Abstraction has 267 states and 537 transitions. [2018-06-26 17:34:51,137 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:34:51,137 INFO ]: Start isEmpty. Operand 267 states and 537 transitions. [2018-06-26 17:34:51,218 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:34:51,218 INFO ]: Found error trace [2018-06-26 17:34:51,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:34:51,218 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:34:51,219 INFO ]: Analyzing trace with hash 398054140, now seen corresponding path program 1 times [2018-06-26 17:34:51,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:34:51,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:34:51,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:51,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:34:51,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:51,310 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:34:51,460 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:34:51,460 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:34:51,460 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:34:51,462 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:34:51,462 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:34:51,462 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:34:51,462 INFO ]: Start difference. First operand 267 states and 537 transitions. Second operand 3 states. [2018-06-26 17:34:53,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:34:53,318 INFO ]: Finished difference Result 399 states and 800 transitions. [2018-06-26 17:34:53,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:34:53,318 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 17:34:53,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:34:53,333 INFO ]: With dead ends: 399 [2018-06-26 17:34:53,333 INFO ]: Without dead ends: 399 [2018-06-26 17:34:53,334 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:34:53,334 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-26 17:34:53,411 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-26 17:34:53,411 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-26 17:34:53,424 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 800 transitions. [2018-06-26 17:34:53,424 INFO ]: Start accepts. Automaton has 399 states and 800 transitions. Word has length 8 [2018-06-26 17:34:53,425 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:34:53,425 INFO ]: Abstraction has 399 states and 800 transitions. [2018-06-26 17:34:53,425 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:34:53,425 INFO ]: Start isEmpty. Operand 399 states and 800 transitions. [2018-06-26 17:34:53,447 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:34:53,447 INFO ]: Found error trace [2018-06-26 17:34:53,447 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:34:53,447 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:34:53,447 INFO ]: Analyzing trace with hash -1401449703, now seen corresponding path program 1 times [2018-06-26 17:34:53,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:34:53,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:34:53,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:53,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:34:53,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:53,508 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:34:53,674 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:34:53,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:34:53,674 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:34:53,674 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:34:53,675 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:34:53,675 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:34:53,675 INFO ]: Start difference. First operand 399 states and 800 transitions. Second operand 5 states. [2018-06-26 17:34:57,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:34:57,410 INFO ]: Finished difference Result 853 states and 2859 transitions. [2018-06-26 17:34:57,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:34:57,411 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:34:57,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:34:57,522 INFO ]: With dead ends: 853 [2018-06-26 17:34:57,522 INFO ]: Without dead ends: 849 [2018-06-26 17:34:57,522 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:34:57,523 INFO ]: Start minimizeSevpa. Operand 849 states. [2018-06-26 17:34:57,922 INFO ]: Finished minimizeSevpa. Reduced states from 849 to 625. [2018-06-26 17:34:57,923 INFO ]: Start removeUnreachable. Operand 625 states. [2018-06-26 17:34:57,952 INFO ]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1735 transitions. [2018-06-26 17:34:57,952 INFO ]: Start accepts. Automaton has 625 states and 1735 transitions. Word has length 9 [2018-06-26 17:34:57,953 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:34:57,953 INFO ]: Abstraction has 625 states and 1735 transitions. [2018-06-26 17:34:57,954 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:34:57,954 INFO ]: Start isEmpty. Operand 625 states and 1735 transitions. [2018-06-26 17:34:57,985 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:34:57,985 INFO ]: Found error trace [2018-06-26 17:34:57,985 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:34:57,986 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:34:57,987 INFO ]: Analyzing trace with hash -1400526182, now seen corresponding path program 1 times [2018-06-26 17:34:57,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:34:57,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:34:57,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:57,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:34:57,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:34:58,046 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:34:58,195 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:34:58,195 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:34:58,195 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:34:58,196 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:34:58,196 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:34:58,196 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:34:58,196 INFO ]: Start difference. First operand 625 states and 1735 transitions. Second operand 5 states. [2018-06-26 17:35:03,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:03,272 INFO ]: Finished difference Result 1201 states and 4867 transitions. [2018-06-26 17:35:03,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:35:03,272 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:35:03,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:03,422 INFO ]: With dead ends: 1201 [2018-06-26 17:35:03,423 INFO ]: Without dead ends: 1196 [2018-06-26 17:35:03,423 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:35:03,424 INFO ]: Start minimizeSevpa. Operand 1196 states. [2018-06-26 17:35:03,966 INFO ]: Finished minimizeSevpa. Reduced states from 1196 to 915. [2018-06-26 17:35:03,966 INFO ]: Start removeUnreachable. Operand 915 states. [2018-06-26 17:35:04,010 INFO ]: Finished removeUnreachable. Reduced from 915 states to 915 states and 3272 transitions. [2018-06-26 17:35:04,010 INFO ]: Start accepts. Automaton has 915 states and 3272 transitions. Word has length 9 [2018-06-26 17:35:04,010 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:04,010 INFO ]: Abstraction has 915 states and 3272 transitions. [2018-06-26 17:35:04,011 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:35:04,011 INFO ]: Start isEmpty. Operand 915 states and 3272 transitions. [2018-06-26 17:35:04,055 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:35:04,055 INFO ]: Found error trace [2018-06-26 17:35:04,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:04,055 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:04,056 INFO ]: Analyzing trace with hash -1399602661, now seen corresponding path program 1 times [2018-06-26 17:35:04,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:04,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:04,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:04,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:04,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:04,119 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:04,424 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:04,424 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:04,424 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:35:04,424 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:35:04,424 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:35:04,424 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:35:04,424 INFO ]: Start difference. First operand 915 states and 3272 transitions. Second operand 5 states. [2018-06-26 17:35:08,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:08,116 INFO ]: Finished difference Result 1996 states and 9706 transitions. [2018-06-26 17:35:08,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:35:08,117 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:35:08,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:08,300 INFO ]: With dead ends: 1996 [2018-06-26 17:35:08,300 INFO ]: Without dead ends: 1989 [2018-06-26 17:35:08,301 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:35:08,302 INFO ]: Start minimizeSevpa. Operand 1989 states. [2018-06-26 17:35:09,217 INFO ]: Finished minimizeSevpa. Reduced states from 1989 to 1456. [2018-06-26 17:35:09,217 INFO ]: Start removeUnreachable. Operand 1456 states. [2018-06-26 17:35:09,315 INFO ]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 6369 transitions. [2018-06-26 17:35:09,315 INFO ]: Start accepts. Automaton has 1456 states and 6369 transitions. Word has length 9 [2018-06-26 17:35:09,315 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:09,315 INFO ]: Abstraction has 1456 states and 6369 transitions. [2018-06-26 17:35:09,315 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:35:09,315 INFO ]: Start isEmpty. Operand 1456 states and 6369 transitions. [2018-06-26 17:35:09,368 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:35:09,368 INFO ]: Found error trace [2018-06-26 17:35:09,369 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:09,369 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:09,370 INFO ]: Analyzing trace with hash -1310944645, now seen corresponding path program 1 times [2018-06-26 17:35:09,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:09,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:09,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:09,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:09,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:09,568 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:09,684 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:09,684 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:09,685 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:35:09,685 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:35:09,685 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:35:09,685 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:09,685 INFO ]: Start difference. First operand 1456 states and 6369 transitions. Second operand 3 states. [2018-06-26 17:35:11,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:11,333 INFO ]: Finished difference Result 2283 states and 8579 transitions. [2018-06-26 17:35:11,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:35:11,333 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 17:35:11,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:11,497 INFO ]: With dead ends: 2283 [2018-06-26 17:35:11,497 INFO ]: Without dead ends: 2212 [2018-06-26 17:35:11,497 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:35:11,499 INFO ]: Start minimizeSevpa. Operand 2212 states. [2018-06-26 17:35:12,011 INFO ]: Finished minimizeSevpa. Reduced states from 2212 to 2190. [2018-06-26 17:35:12,029 INFO ]: Start removeUnreachable. Operand 2190 states. [2018-06-26 17:35:12,345 INFO ]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 8243 transitions. [2018-06-26 17:35:12,345 INFO ]: Start accepts. Automaton has 2190 states and 8243 transitions. Word has length 9 [2018-06-26 17:35:12,345 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:12,345 INFO ]: Abstraction has 2190 states and 8243 transitions. [2018-06-26 17:35:12,345 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:35:12,345 INFO ]: Start isEmpty. Operand 2190 states and 8243 transitions. [2018-06-26 17:35:12,400 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:35:12,400 INFO ]: Found error trace [2018-06-26 17:35:12,400 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:12,400 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:12,401 INFO ]: Analyzing trace with hash -1048509920, now seen corresponding path program 1 times [2018-06-26 17:35:12,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:12,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:12,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:12,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:12,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:12,447 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:12,646 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:12,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:12,646 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:35:12,646 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:35:12,646 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:35:12,646 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:35:12,646 INFO ]: Start difference. First operand 2190 states and 8243 transitions. Second operand 5 states. [2018-06-26 17:35:14,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:14,069 INFO ]: Finished difference Result 3519 states and 15864 transitions. [2018-06-26 17:35:14,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:35:14,072 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:35:14,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:14,411 INFO ]: With dead ends: 3519 [2018-06-26 17:35:14,411 INFO ]: Without dead ends: 3519 [2018-06-26 17:35:14,411 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:35:14,413 INFO ]: Start minimizeSevpa. Operand 3519 states. [2018-06-26 17:35:15,464 INFO ]: Finished minimizeSevpa. Reduced states from 3519 to 2852. [2018-06-26 17:35:15,464 INFO ]: Start removeUnreachable. Operand 2852 states. [2018-06-26 17:35:15,659 INFO ]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 10552 transitions. [2018-06-26 17:35:15,659 INFO ]: Start accepts. Automaton has 2852 states and 10552 transitions. Word has length 9 [2018-06-26 17:35:15,659 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:15,659 INFO ]: Abstraction has 2852 states and 10552 transitions. [2018-06-26 17:35:15,659 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:35:15,659 INFO ]: Start isEmpty. Operand 2852 states and 10552 transitions. [2018-06-26 17:35:15,715 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:35:15,715 INFO ]: Found error trace [2018-06-26 17:35:15,715 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:15,715 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:15,715 INFO ]: Analyzing trace with hash 129682655, now seen corresponding path program 1 times [2018-06-26 17:35:15,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:15,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:15,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:15,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:15,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:15,762 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:15,890 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:15,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:15,890 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:35:15,891 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:35:15,891 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:35:15,891 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:35:15,891 INFO ]: Start difference. First operand 2852 states and 10552 transitions. Second operand 6 states. [2018-06-26 17:35:20,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:20,830 INFO ]: Finished difference Result 4811 states and 27157 transitions. [2018-06-26 17:35:20,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:35:20,830 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:35:20,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:21,580 INFO ]: With dead ends: 4811 [2018-06-26 17:35:21,580 INFO ]: Without dead ends: 4811 [2018-06-26 17:35:21,580 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:35:21,585 INFO ]: Start minimizeSevpa. Operand 4811 states. [2018-06-26 17:35:23,020 INFO ]: Finished minimizeSevpa. Reduced states from 4811 to 3247. [2018-06-26 17:35:23,020 INFO ]: Start removeUnreachable. Operand 3247 states. [2018-06-26 17:35:23,201 INFO ]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 12751 transitions. [2018-06-26 17:35:23,201 INFO ]: Start accepts. Automaton has 3247 states and 12751 transitions. Word has length 10 [2018-06-26 17:35:23,201 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:23,201 INFO ]: Abstraction has 3247 states and 12751 transitions. [2018-06-26 17:35:23,201 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:35:23,202 INFO ]: Start isEmpty. Operand 3247 states and 12751 transitions. [2018-06-26 17:35:23,252 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:35:23,252 INFO ]: Found error trace [2018-06-26 17:35:23,252 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:23,252 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:23,253 INFO ]: Analyzing trace with hash 129683616, now seen corresponding path program 1 times [2018-06-26 17:35:23,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:23,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:23,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:23,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:23,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:23,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:23,445 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:23,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:23,445 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:35:23,445 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:35:23,445 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:35:23,445 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:35:23,446 INFO ]: Start difference. First operand 3247 states and 12751 transitions. Second operand 6 states. [2018-06-26 17:35:28,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:35:28,730 INFO ]: Finished difference Result 6148 states and 43123 transitions. [2018-06-26 17:35:28,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:35:28,730 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:35:28,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:35:32,875 INFO ]: With dead ends: 6148 [2018-06-26 17:35:32,875 INFO ]: Without dead ends: 5763 [2018-06-26 17:35:32,875 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:35:32,877 INFO ]: Start minimizeSevpa. Operand 5763 states. [2018-06-26 17:35:35,080 INFO ]: Finished minimizeSevpa. Reduced states from 5763 to 3720. [2018-06-26 17:35:35,080 INFO ]: Start removeUnreachable. Operand 3720 states. [2018-06-26 17:35:35,572 INFO ]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 15956 transitions. [2018-06-26 17:35:35,572 INFO ]: Start accepts. Automaton has 3720 states and 15956 transitions. Word has length 10 [2018-06-26 17:35:35,572 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:35:35,572 INFO ]: Abstraction has 3720 states and 15956 transitions. [2018-06-26 17:35:35,572 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:35:35,572 INFO ]: Start isEmpty. Operand 3720 states and 15956 transitions. [2018-06-26 17:35:35,608 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:35:35,608 INFO ]: Found error trace [2018-06-26 17:35:35,608 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:35:35,608 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:35:35,609 INFO ]: Analyzing trace with hash 129684577, now seen corresponding path program 1 times [2018-06-26 17:35:35,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:35:35,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:35:35,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:35,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:35:35,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:35:35,658 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:35:35,843 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:35:35,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:35:35,843 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:35:35,843 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:35:35,843 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:35:35,843 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:35:35,843 INFO ]: Start difference. First operand 3720 states and 15956 transitions. Second operand 6 states. Received shutdown request... [2018-06-26 17:35:41,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:35:41,613 WARN ]: Verification canceled [2018-06-26 17:35:41,616 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:35:41,617 WARN ]: Timeout [2018-06-26 17:35:41,617 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:35:41 BasicIcfg [2018-06-26 17:35:41,617 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:35:41,618 INFO ]: Toolchain (without parser) took 56715.44 ms. Allocated memory was 307.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 217.4 MB in the beginning and 935.4 MB in the end (delta: -717.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-26 17:35:41,619 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:35:41,619 INFO ]: ChcToBoogie took 128.10 ms. Allocated memory is still 307.8 MB. Free memory was 217.4 MB in the beginning and 212.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:35:41,620 INFO ]: Boogie Preprocessor took 102.84 ms. Allocated memory is still 307.8 MB. Free memory was 212.4 MB in the beginning and 209.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:35:41,620 INFO ]: RCFGBuilder took 2474.79 ms. Allocated memory was 307.8 MB in the beginning and 357.0 MB in the end (delta: 49.3 MB). Free memory was 208.5 MB in the beginning and 320.3 MB in the end (delta: -111.8 MB). Peak memory consumption was 52.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:35:41,625 INFO ]: BlockEncodingV2 took 996.90 ms. Allocated memory is still 357.0 MB. Free memory was 320.3 MB in the beginning and 227.0 MB in the end (delta: 93.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 3.6 GB. [2018-06-26 17:35:41,625 INFO ]: TraceAbstraction took 53002.92 ms. Allocated memory was 357.0 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 227.0 MB in the beginning and 935.4 MB in the end (delta: -708.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 17:35:41,628 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 146 locations, 282 edges - StatisticsResult: Encoded RCFG 135 locations, 270 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 128.10 ms. Allocated memory is still 307.8 MB. Free memory was 217.4 MB in the beginning and 212.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 102.84 ms. Allocated memory is still 307.8 MB. Free memory was 212.4 MB in the beginning and 209.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2474.79 ms. Allocated memory was 307.8 MB in the beginning and 357.0 MB in the end (delta: 49.3 MB). Free memory was 208.5 MB in the beginning and 320.3 MB in the end (delta: -111.8 MB). Peak memory consumption was 52.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 996.90 ms. Allocated memory is still 357.0 MB. Free memory was 320.3 MB in the beginning and 227.0 MB in the end (delta: 93.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53002.92 ms. Allocated memory was 357.0 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 227.0 MB in the beginning and 935.4 MB in the end (delta: -708.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (3720states) and interpolant automaton (currently 11 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (8827 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 52.9s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 41.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5591 SDtfs, 1142 SDslu, 8120 SDs, 0 SdLazy, 14354 SolverSat, 3503 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3720occurred in iteration=9, 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: 8.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 5334 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental.36.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-35-41-643.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental.36.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-35-41-643.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental.36.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-35-41-643.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental.36.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-35-41-643.csv Completed graceful shutdown