java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:48:04,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:48:04,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:48:04,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:48:04,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:48:04,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:48:04,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:48:04,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:48:04,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:48:04,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:48:04,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:48:04,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:48:04,228 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:48:04,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:48:04,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:48:04,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:48:04,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:48:04,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:48:04,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:48:04,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:48:04,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:48:04,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:48:04,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:48:04,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:48:04,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:48:04,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:48:04,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:48:04,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:48:04,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:48:04,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:48:04,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:48:04,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:48:04,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:48:04,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:48:04,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:48:04,270 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:48:04,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:48:04,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:48:04,288 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:48:04,288 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:48:04,292 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:48:04,292 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:48:04,292 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:48:04,292 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:48:04,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:48:04,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:48:04,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:48:04,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:48:04,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:48:04,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:48:04,294 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:48:04,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:48:04,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:48:04,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:48:04,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:48:04,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:48:04,297 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:48:04,298 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:48:04,298 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:48:04,352 INFO ]: Repository-Root is: /tmp [2018-06-25 00:48:04,376 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:48:04,380 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:48:04,383 INFO ]: Initializing SmtParser... [2018-06-25 00:48:04,383 INFO ]: SmtParser initialized [2018-06-25 00:48:04,384 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 [2018-06-25 00:48:04,385 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 00:48:04,482 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 unknown [2018-06-25 00:48:04,739 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 [2018-06-25 00:48:04,746 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:48:04,752 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:48:04,753 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:48:04,753 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:48:04,753 INFO ]: ChcToBoogie initialized [2018-06-25 00:48:04,756 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,807 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04 Unit [2018-06-25 00:48:04,807 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:48:04,807 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:48:04,807 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:48:04,807 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:48:04,829 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,829 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,836 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,836 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,841 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,842 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,854 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... [2018-06-25 00:48:04,856 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:48:04,857 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:48:04,857 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:48:04,857 INFO ]: RCFGBuilder initialized [2018-06-25 00:48:04,858 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 00:48:04,885 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:48:04,886 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:48:04,886 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:48:04,886 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:48:04,886 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:48:04,886 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:48:05,100 INFO ]: Using library mode [2018-06-25 00:48:05,101 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:48:05 BoogieIcfgContainer [2018-06-25 00:48:05,101 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:48:05,101 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:48:05,101 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:48:05,102 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:48:05,103 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:48:05" (1/1) ... [2018-06-25 00:48:05,117 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:48:05,120 INFO ]: Using Remove infeasible edges [2018-06-25 00:48:05,120 INFO ]: Using Maximize final states [2018-06-25 00:48:05,121 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:48:05,121 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:48:05,125 INFO ]: Using Remove sink states [2018-06-25 00:48:05,126 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:48:05,126 INFO ]: Using Use SBE [2018-06-25 00:48:05,149 WARN ]: expecting exponential blowup for input size 18 [2018-06-25 00:48:06,260 WARN ]: Simplifying disjunction of 66848 conjuctions. This might take some time... [2018-06-25 00:48:21,521 INFO ]: Simplified to disjunction of 1920 conjuctions. [2018-06-25 00:48:21,600 INFO ]: SBE split 1 edges [2018-06-25 00:48:21,605 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:48:21,607 INFO ]: 0 new accepting states [2018-06-25 00:48:21,651 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:48:21,653 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:48:21,656 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:48:21,656 INFO ]: 0 new accepting states [2018-06-25 00:48:21,656 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:48:21,657 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:48:21,657 INFO ]: Encoded RCFG 6 locations, 32 edges [2018-06-25 00:48:21,658 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:48:21 BasicIcfg [2018-06-25 00:48:21,658 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:48:21,661 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:48:21,661 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:48:21,664 INFO ]: TraceAbstraction initialized [2018-06-25 00:48:21,664 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:48:04" (1/4) ... [2018-06-25 00:48:21,667 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168cdeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:48:21, skipping insertion in model container [2018-06-25 00:48:21,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:48:04" (2/4) ... [2018-06-25 00:48:21,667 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168cdeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:48:21, skipping insertion in model container [2018-06-25 00:48:21,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:48:05" (3/4) ... [2018-06-25 00:48:21,668 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168cdeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:48:21, skipping insertion in model container [2018-06-25 00:48:21,668 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:48:21" (4/4) ... [2018-06-25 00:48:21,669 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:48:21,679 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:48:21,689 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:48:21,748 INFO ]: Using default assertion order modulation [2018-06-25 00:48:21,749 INFO ]: Interprodecural is true [2018-06-25 00:48:21,749 INFO ]: Hoare is false [2018-06-25 00:48:21,749 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:48:21,749 INFO ]: Backedges is TWOTRACK [2018-06-25 00:48:21,749 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:48:21,749 INFO ]: Difference is false [2018-06-25 00:48:21,749 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:48:21,749 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:48:21,762 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:48:21,778 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:48:21,778 INFO ]: Found error trace [2018-06-25 00:48:21,779 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:48:21,779 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:21,785 INFO ]: Analyzing trace with hash 36232866, now seen corresponding path program 1 times [2018-06-25 00:48:21,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:21,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:21,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:21,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:21,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:21,882 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:21,996 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:48:21,998 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:21,998 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:22,000 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:22,016 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:22,017 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:22,019 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:48:23,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:23,009 INFO ]: Finished difference Result 7 states and 50 transitions. [2018-06-25 00:48:23,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:23,010 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:48:23,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:23,021 INFO ]: With dead ends: 7 [2018-06-25 00:48:23,021 INFO ]: Without dead ends: 7 [2018-06-25 00:48:23,023 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:23,042 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:48:23,060 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:48:23,061 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:48:23,062 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-06-25 00:48:23,064 INFO ]: Start accepts. Automaton has 7 states and 50 transitions. Word has length 5 [2018-06-25 00:48:23,065 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:23,065 INFO ]: Abstraction has 7 states and 50 transitions. [2018-06-25 00:48:23,065 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:23,065 INFO ]: Start isEmpty. Operand 7 states and 50 transitions. [2018-06-25 00:48:23,065 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:48:23,065 INFO ]: Found error trace [2018-06-25 00:48:23,065 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:48:23,065 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:23,066 INFO ]: Analyzing trace with hash 1123068128, now seen corresponding path program 1 times [2018-06-25 00:48:23,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:23,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:23,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:23,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:23,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:23,076 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:23,137 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:48:23,137 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:23,137 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:23,139 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:23,139 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:23,139 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:23,140 INFO ]: Start difference. First operand 7 states and 50 transitions. Second operand 3 states. [2018-06-25 00:48:23,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:23,406 INFO ]: Finished difference Result 9 states and 69 transitions. [2018-06-25 00:48:23,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:23,406 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:48:23,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:23,407 INFO ]: With dead ends: 9 [2018-06-25 00:48:23,407 INFO ]: Without dead ends: 9 [2018-06-25 00:48:23,408 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:23,408 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:48:23,412 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:48:23,412 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:48:23,413 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2018-06-25 00:48:23,413 INFO ]: Start accepts. Automaton has 9 states and 69 transitions. Word has length 6 [2018-06-25 00:48:23,413 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:23,413 INFO ]: Abstraction has 9 states and 69 transitions. [2018-06-25 00:48:23,413 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:23,413 INFO ]: Start isEmpty. Operand 9 states and 69 transitions. [2018-06-25 00:48:23,413 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:48:23,413 INFO ]: Found error trace [2018-06-25 00:48:23,413 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:48:23,414 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:23,414 INFO ]: Analyzing trace with hash 1123097919, now seen corresponding path program 1 times [2018-06-25 00:48:23,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:23,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:23,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:23,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:23,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:23,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:23,483 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:48:23,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:23,483 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:23,483 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:23,484 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:23,484 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:23,484 INFO ]: Start difference. First operand 9 states and 69 transitions. Second operand 3 states. [2018-06-25 00:48:23,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:23,728 INFO ]: Finished difference Result 13 states and 100 transitions. [2018-06-25 00:48:23,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:23,729 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:48:23,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:23,730 INFO ]: With dead ends: 13 [2018-06-25 00:48:23,730 INFO ]: Without dead ends: 11 [2018-06-25 00:48:23,730 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:23,730 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:48:23,731 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:48:23,731 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:48:23,732 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2018-06-25 00:48:23,732 INFO ]: Start accepts. Automaton has 11 states and 41 transitions. Word has length 6 [2018-06-25 00:48:23,732 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:23,732 INFO ]: Abstraction has 11 states and 41 transitions. [2018-06-25 00:48:23,732 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:23,732 INFO ]: Start isEmpty. Operand 11 states and 41 transitions. [2018-06-25 00:48:23,732 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:48:23,732 INFO ]: Found error trace [2018-06-25 00:48:23,732 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:23,732 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:23,732 INFO ]: Analyzing trace with hash 944289101, now seen corresponding path program 1 times [2018-06-25 00:48:23,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:23,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:23,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:23,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:23,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:23,748 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:23,785 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:48:23,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:23,786 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:23,786 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:23,786 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:23,786 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:23,786 INFO ]: Start difference. First operand 11 states and 41 transitions. Second operand 3 states. [2018-06-25 00:48:24,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:24,254 INFO ]: Finished difference Result 15 states and 42 transitions. [2018-06-25 00:48:24,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:24,254 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:48:24,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:24,254 INFO ]: With dead ends: 15 [2018-06-25 00:48:24,255 INFO ]: Without dead ends: 15 [2018-06-25 00:48:24,255 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:24,255 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:48:24,257 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 00:48:24,257 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:48:24,257 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2018-06-25 00:48:24,257 INFO ]: Start accepts. Automaton has 15 states and 42 transitions. Word has length 8 [2018-06-25 00:48:24,257 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:24,257 INFO ]: Abstraction has 15 states and 42 transitions. [2018-06-25 00:48:24,257 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:24,257 INFO ]: Start isEmpty. Operand 15 states and 42 transitions. [2018-06-25 00:48:24,258 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:48:24,258 INFO ]: Found error trace [2018-06-25 00:48:24,258 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:24,258 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:24,258 INFO ]: Analyzing trace with hash 1087434856, now seen corresponding path program 1 times [2018-06-25 00:48:24,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:24,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:24,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:24,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:24,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:24,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:24,303 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:48:24,303 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:24,303 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:24,303 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:24,303 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:24,303 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:24,303 INFO ]: Start difference. First operand 15 states and 42 transitions. Second operand 3 states. [2018-06-25 00:48:24,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:24,523 INFO ]: Finished difference Result 23 states and 70 transitions. [2018-06-25 00:48:24,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:24,524 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:48:24,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:24,524 INFO ]: With dead ends: 23 [2018-06-25 00:48:24,524 INFO ]: Without dead ends: 23 [2018-06-25 00:48:24,525 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:24,525 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:48:24,527 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-25 00:48:24,528 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 00:48:24,528 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 67 transitions. [2018-06-25 00:48:24,529 INFO ]: Start accepts. Automaton has 21 states and 67 transitions. Word has length 8 [2018-06-25 00:48:24,529 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:24,529 INFO ]: Abstraction has 21 states and 67 transitions. [2018-06-25 00:48:24,529 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:24,529 INFO ]: Start isEmpty. Operand 21 states and 67 transitions. [2018-06-25 00:48:24,529 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:48:24,529 INFO ]: Found error trace [2018-06-25 00:48:24,529 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:24,529 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:24,530 INFO ]: Analyzing trace with hash -532958809, now seen corresponding path program 1 times [2018-06-25 00:48:24,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:24,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:24,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:24,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:24,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:24,549 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:24,590 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:48:24,590 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:24,590 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:24,591 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:24,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:24,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:24,592 INFO ]: Start difference. First operand 21 states and 67 transitions. Second operand 3 states. [2018-06-25 00:48:24,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:24,629 INFO ]: Finished difference Result 18 states and 50 transitions. [2018-06-25 00:48:24,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:24,629 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:48:24,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:24,630 INFO ]: With dead ends: 18 [2018-06-25 00:48:24,630 INFO ]: Without dead ends: 18 [2018-06-25 00:48:24,630 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:24,630 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:48:24,632 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 00:48:24,632 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 00:48:24,632 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2018-06-25 00:48:24,632 INFO ]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 13 [2018-06-25 00:48:24,632 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:24,632 INFO ]: Abstraction has 18 states and 50 transitions. [2018-06-25 00:48:24,632 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:24,633 INFO ]: Start isEmpty. Operand 18 states and 50 transitions. [2018-06-25 00:48:24,633 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 00:48:24,633 INFO ]: Found error trace [2018-06-25 00:48:24,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:24,633 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:24,633 INFO ]: Analyzing trace with hash 1965376010, now seen corresponding path program 1 times [2018-06-25 00:48:24,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:24,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:24,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:24,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:24,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:24,664 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:25,144 INFO ]: Checked inductivity of 45 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 00:48:25,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:48:25,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:48:25,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:25,239 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:25,251 INFO ]: Computing forward predicates... [2018-06-25 00:48:25,387 INFO ]: Checked inductivity of 45 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 00:48:25,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:48:25,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-25 00:48:25,407 INFO ]: Interpolant automaton has 9 states [2018-06-25 00:48:25,407 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 00:48:25,407 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-25 00:48:25,408 INFO ]: Start difference. First operand 18 states and 50 transitions. Second operand 9 states. [2018-06-25 00:48:25,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:25,911 INFO ]: Finished difference Result 45 states and 123 transitions. [2018-06-25 00:48:25,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:48:25,913 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-25 00:48:25,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:25,914 INFO ]: With dead ends: 45 [2018-06-25 00:48:25,914 INFO ]: Without dead ends: 45 [2018-06-25 00:48:25,914 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:48:25,914 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 00:48:25,920 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-06-25 00:48:25,920 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 00:48:25,921 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 83 transitions. [2018-06-25 00:48:25,921 INFO ]: Start accepts. Automaton has 30 states and 83 transitions. Word has length 14 [2018-06-25 00:48:25,921 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:25,921 INFO ]: Abstraction has 30 states and 83 transitions. [2018-06-25 00:48:25,921 INFO ]: Interpolant automaton has 9 states. [2018-06-25 00:48:25,921 INFO ]: Start isEmpty. Operand 30 states and 83 transitions. [2018-06-25 00:48:25,922 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 00:48:25,922 INFO ]: Found error trace [2018-06-25 00:48:25,922 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:25,922 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:25,922 INFO ]: Analyzing trace with hash 1827295788, now seen corresponding path program 2 times [2018-06-25 00:48:25,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:25,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:25,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:25,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:48:25,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:25,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:26,116 INFO ]: Checked inductivity of 120 backedges. 30 proven. 82 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 00:48:26,116 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:48:26,116 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-25 00:48:26,123 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 00:48:26,217 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 00:48:26,217 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:26,223 INFO ]: Computing forward predicates... [2018-06-25 00:48:26,283 INFO ]: Checked inductivity of 120 backedges. 29 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 00:48:26,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:48:26,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2018-06-25 00:48:26,305 INFO ]: Interpolant automaton has 11 states [2018-06-25 00:48:26,305 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 00:48:26,305 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 00:48:26,305 INFO ]: Start difference. First operand 30 states and 83 transitions. Second operand 11 states. [2018-06-25 00:48:26,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:26,600 INFO ]: Finished difference Result 61 states and 175 transitions. [2018-06-25 00:48:26,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 00:48:26,628 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-25 00:48:26,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:26,629 INFO ]: With dead ends: 61 [2018-06-25 00:48:26,630 INFO ]: Without dead ends: 61 [2018-06-25 00:48:26,630 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-25 00:48:26,630 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 00:48:26,635 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 34. [2018-06-25 00:48:26,635 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 00:48:26,636 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 99 transitions. [2018-06-25 00:48:26,637 INFO ]: Start accepts. Automaton has 34 states and 99 transitions. Word has length 20 [2018-06-25 00:48:26,637 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:26,637 INFO ]: Abstraction has 34 states and 99 transitions. [2018-06-25 00:48:26,637 INFO ]: Interpolant automaton has 11 states. [2018-06-25 00:48:26,637 INFO ]: Start isEmpty. Operand 34 states and 99 transitions. [2018-06-25 00:48:26,637 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 00:48:26,637 INFO ]: Found error trace [2018-06-25 00:48:26,638 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:26,638 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:26,638 INFO ]: Analyzing trace with hash 1750324586, now seen corresponding path program 3 times [2018-06-25 00:48:26,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:26,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:26,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:26,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:48:26,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:26,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:26,742 INFO ]: Checked inductivity of 120 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-25 00:48:26,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:26,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:26,742 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:26,742 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:26,742 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:26,742 INFO ]: Start difference. First operand 34 states and 99 transitions. Second operand 3 states. [2018-06-25 00:48:26,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:26,775 INFO ]: Finished difference Result 34 states and 67 transitions. [2018-06-25 00:48:26,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:26,775 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-25 00:48:26,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:26,776 INFO ]: With dead ends: 34 [2018-06-25 00:48:26,776 INFO ]: Without dead ends: 34 [2018-06-25 00:48:26,776 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:26,776 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 00:48:26,779 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 00:48:26,779 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 00:48:26,779 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 67 transitions. [2018-06-25 00:48:26,779 INFO ]: Start accepts. Automaton has 34 states and 67 transitions. Word has length 20 [2018-06-25 00:48:26,779 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:26,779 INFO ]: Abstraction has 34 states and 67 transitions. [2018-06-25 00:48:26,779 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:26,779 INFO ]: Start isEmpty. Operand 34 states and 67 transitions. [2018-06-25 00:48:26,780 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 00:48:26,780 INFO ]: Found error trace [2018-06-25 00:48:26,780 INFO ]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:48:26,780 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:48:26,780 INFO ]: Analyzing trace with hash 910744348, now seen corresponding path program 4 times [2018-06-25 00:48:26,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:48:26,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:48:26,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:26,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 00:48:26,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:48:26,792 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:48:26,853 INFO ]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-25 00:48:26,853 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:48:26,853 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:48:26,853 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:48:26,853 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:48:26,853 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:26,853 INFO ]: Start difference. First operand 34 states and 67 transitions. Second operand 3 states. [2018-06-25 00:48:26,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:48:26,913 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-25 00:48:26,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:48:26,914 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-25 00:48:26,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:48:26,914 INFO ]: With dead ends: 14 [2018-06-25 00:48:26,914 INFO ]: Without dead ends: 0 [2018-06-25 00:48:26,914 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:48:26,914 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 00:48:26,914 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 00:48:26,914 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 00:48:26,914 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 00:48:26,914 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-06-25 00:48:26,914 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:48:26,915 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 00:48:26,915 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:48:26,915 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 00:48:26,915 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 00:48:26,917 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:48:26,918 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:48:26 BasicIcfg [2018-06-25 00:48:26,918 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:48:26,919 INFO ]: Toolchain (without parser) took 22172.30 ms. Allocated memory was 304.1 MB in the beginning and 425.2 MB in the end (delta: 121.1 MB). Free memory was 258.5 MB in the beginning and 240.4 MB in the end (delta: 18.1 MB). Peak memory consumption was 139.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:48:26,921 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:48:26,921 INFO ]: ChcToBoogie took 54.49 ms. Allocated memory is still 304.1 MB. Free memory was 258.5 MB in the beginning and 256.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:48:26,922 INFO ]: Boogie Preprocessor took 48.88 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 255.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 00:48:26,922 INFO ]: RCFGBuilder took 244.15 ms. Allocated memory is still 304.1 MB. Free memory was 254.4 MB in the beginning and 246.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:48:26,923 INFO ]: BlockEncodingV2 took 16556.43 ms. Allocated memory was 304.1 MB in the beginning and 425.2 MB in the end (delta: 121.1 MB). Free memory was 246.4 MB in the beginning and 245.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 227.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:48:26,923 INFO ]: TraceAbstraction took 5257.39 ms. Allocated memory is still 425.2 MB. Free memory was 245.3 MB in the beginning and 240.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:48:26,927 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 32 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.49 ms. Allocated memory is still 304.1 MB. Free memory was 258.5 MB in the beginning and 256.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.88 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 255.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 244.15 ms. Allocated memory is still 304.1 MB. Free memory was 254.4 MB in the beginning and 246.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 16556.43 ms. Allocated memory was 304.1 MB in the beginning and 425.2 MB in the end (delta: 121.1 MB). Free memory was 246.4 MB in the beginning and 245.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 227.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5257.39 ms. Allocated memory is still 425.2 MB. Free memory was 245.3 MB in the beginning and 240.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 2 SDslu, 75 SDs, 0 SdLazy, 623 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=8, 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, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 451/653 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/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-48-26-939.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-48-26-939.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-48-26-939.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-48-26-939.csv Received shutdown request...