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/hopv/lia/mochi/array_init.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:13:13,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:13:13,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:13:13,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:13:13,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:13:13,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:13:13,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:13:13,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:13:13,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:13:13,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:13:13,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:13:13,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:13:13,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:13:13,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:13:13,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:13:13,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:13:13,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:13:13,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:13:13,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:13:13,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:13:13,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:13:13,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:13:13,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:13:13,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:13:13,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:13:13,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:13:13,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:13:13,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:13:13,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:13:13,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:13:13,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:13:13,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:13:13,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:13:13,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:13:13,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:13:13,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:13:13,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:13:13,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:13:13,083 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:13:13,083 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:13:13,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:13:13,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:13:13,084 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:13:13,084 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:13:13,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:13:13,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:13:13,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:13:13,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:13:13,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:13:13,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:13:13,086 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:13:13,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:13:13,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:13:13,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:13:13,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:13:13,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:13:13,087 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:13:13,089 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:13:13,089 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:13:13,125 INFO ]: Repository-Root is: /tmp [2018-06-24 21:13:13,139 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:13:13,143 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:13:13,145 INFO ]: Initializing SmtParser... [2018-06-24 21:13:13,145 INFO ]: SmtParser initialized [2018-06-24 21:13:13,147 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/array_init.smt2 [2018-06-24 21:13:13,149 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:13:13,234 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/array_init.smt2 unknown [2018-06-24 21:13:13,439 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/array_init.smt2 [2018-06-24 21:13:13,443 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:13:13,448 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:13:13,449 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:13:13,449 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:13:13,449 INFO ]: ChcToBoogie initialized [2018-06-24 21:13:13,452 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,511 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13 Unit [2018-06-24 21:13:13,512 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:13:13,512 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:13:13,512 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:13:13,512 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:13:13,532 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,532 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,538 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,538 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,543 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,547 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,548 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,549 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:13:13,550 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:13:13,550 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:13:13,550 INFO ]: RCFGBuilder initialized [2018-06-24 21:13:13,551 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:13:13,567 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:13:13,567 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:13:13,567 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:13:13,567 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:13:13,567 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:13:13,567 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:13:13,923 INFO ]: Using library mode [2018-06-24 21:13:13,923 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:13 BoogieIcfgContainer [2018-06-24 21:13:13,923 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:13:13,924 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:13:13,924 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:13:13,925 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:13:13,925 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:13" (1/1) ... [2018-06-24 21:13:13,954 INFO ]: Initial Icfg 14 locations, 18 edges [2018-06-24 21:13:13,959 INFO ]: Using Remove infeasible edges [2018-06-24 21:13:13,959 INFO ]: Using Maximize final states [2018-06-24 21:13:13,960 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:13:13,960 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:13:13,962 INFO ]: Using Remove sink states [2018-06-24 21:13:13,962 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:13:13,962 INFO ]: Using Use SBE [2018-06-24 21:13:14,014 INFO ]: SBE split 1 edges [2018-06-24 21:13:14,030 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:13:14,031 INFO ]: 0 new accepting states [2018-06-24 21:13:14,289 INFO ]: Removed 15 edges and 4 locations by large block encoding [2018-06-24 21:13:14,292 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:14,296 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:13:14,296 INFO ]: 0 new accepting states [2018-06-24 21:13:14,297 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:13:14,297 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:14,297 INFO ]: Encoded RCFG 8 locations, 14 edges [2018-06-24 21:13:14,297 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:14 BasicIcfg [2018-06-24 21:13:14,298 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:13:14,298 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:13:14,299 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:13:14,303 INFO ]: TraceAbstraction initialized [2018-06-24 21:13:14,303 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:13" (1/4) ... [2018-06-24 21:13:14,303 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bccfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:13:14, skipping insertion in model container [2018-06-24 21:13:14,304 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:13" (2/4) ... [2018-06-24 21:13:14,304 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bccfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:13:14, skipping insertion in model container [2018-06-24 21:13:14,304 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:13" (3/4) ... [2018-06-24 21:13:14,304 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bccfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:14, skipping insertion in model container [2018-06-24 21:13:14,304 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:14" (4/4) ... [2018-06-24 21:13:14,306 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:13:14,315 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:13:14,323 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:13:14,364 INFO ]: Using default assertion order modulation [2018-06-24 21:13:14,364 INFO ]: Interprodecural is true [2018-06-24 21:13:14,364 INFO ]: Hoare is false [2018-06-24 21:13:14,365 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:13:14,365 INFO ]: Backedges is TWOTRACK [2018-06-24 21:13:14,365 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:13:14,365 INFO ]: Difference is false [2018-06-24 21:13:14,365 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:13:14,365 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:13:14,377 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:13:14,389 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:14,389 INFO ]: Found error trace [2018-06-24 21:13:14,389 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:14,390 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:14,394 INFO ]: Analyzing trace with hash 1022126868, now seen corresponding path program 1 times [2018-06-24 21:13:14,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:14,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:14,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:14,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:14,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:14,488 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:14,587 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:14,589 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:14,589 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:13:14,591 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:13:14,603 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:13:14,603 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:13:14,606 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-24 21:13:14,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:14,713 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-24 21:13:14,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:13:14,714 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:13:14,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:14,725 INFO ]: With dead ends: 9 [2018-06-24 21:13:14,725 INFO ]: Without dead ends: 9 [2018-06-24 21:13:14,727 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:14,753 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:13:14,774 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 21:13:14,775 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:13:14,775 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 21:13:14,776 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 6 [2018-06-24 21:13:14,777 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:14,777 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 21:13:14,777 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:13:14,777 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 21:13:14,777 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:14,777 INFO ]: Found error trace [2018-06-24 21:13:14,777 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:14,778 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:14,778 INFO ]: Analyzing trace with hash 1022190294, now seen corresponding path program 1 times [2018-06-24 21:13:14,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:14,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:14,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:14,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:14,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:14,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:14,898 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:14,898 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:14,898 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:13:14,899 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:13:14,899 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:13:14,899 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:13:14,899 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-24 21:13:14,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:14,945 INFO ]: Finished difference Result 11 states and 18 transitions. [2018-06-24 21:13:14,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:13:14,945 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:13:14,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:14,947 INFO ]: With dead ends: 11 [2018-06-24 21:13:14,947 INFO ]: Without dead ends: 11 [2018-06-24 21:13:14,947 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:14,947 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:13:14,949 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:13:14,950 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:13:14,950 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-06-24 21:13:14,950 INFO ]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 6 [2018-06-24 21:13:14,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:14,950 INFO ]: Abstraction has 9 states and 14 transitions. [2018-06-24 21:13:14,950 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:13:14,950 INFO ]: Start isEmpty. Operand 9 states and 14 transitions. [2018-06-24 21:13:14,950 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:13:14,951 INFO ]: Found error trace [2018-06-24 21:13:14,951 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:14,951 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:14,951 INFO ]: Analyzing trace with hash 1622963818, now seen corresponding path program 1 times [2018-06-24 21:13:14,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:14,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:14,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:14,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:14,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:14,976 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:15,185 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:15,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:15,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:15,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:15,244 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:15,252 INFO ]: Computing forward predicates... [2018-06-24 21:13:15,293 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:13:15,314 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:15,314 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 21:13:15,314 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:13:15,315 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:13:15,315 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:13:15,315 INFO ]: Start difference. First operand 9 states and 14 transitions. Second operand 6 states. [2018-06-24 21:13:15,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:15,431 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 21:13:15,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:13:15,432 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:13:15,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:15,432 INFO ]: With dead ends: 10 [2018-06-24 21:13:15,432 INFO ]: Without dead ends: 10 [2018-06-24 21:13:15,433 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:13:15,433 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:13:15,434 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 21:13:15,434 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:13:15,434 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-06-24 21:13:15,434 INFO ]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 7 [2018-06-24 21:13:15,435 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:15,435 INFO ]: Abstraction has 9 states and 12 transitions. [2018-06-24 21:13:15,435 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:13:15,435 INFO ]: Start isEmpty. Operand 9 states and 12 transitions. [2018-06-24 21:13:15,435 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:13:15,435 INFO ]: Found error trace [2018-06-24 21:13:15,435 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:15,435 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:15,435 INFO ]: Analyzing trace with hash -1944518806, now seen corresponding path program 1 times [2018-06-24 21:13:15,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:15,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:15,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:15,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:15,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:15,477 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:15,554 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:13:15,554 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:15,554 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:13:15,554 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:13:15,554 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:13:15,554 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:15,555 INFO ]: Start difference. First operand 9 states and 12 transitions. Second operand 5 states. [2018-06-24 21:13:15,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:15,616 INFO ]: Finished difference Result 9 states and 11 transitions. [2018-06-24 21:13:15,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:13:15,617 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:13:15,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:15,617 INFO ]: With dead ends: 9 [2018-06-24 21:13:15,617 INFO ]: Without dead ends: 9 [2018-06-24 21:13:15,617 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:13:15,617 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:13:15,618 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:13:15,618 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:13:15,619 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 21:13:15,619 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-24 21:13:15,619 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:15,619 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 21:13:15,619 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:13:15,619 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 21:13:15,619 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:13:15,619 INFO ]: Found error trace [2018-06-24 21:13:15,619 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:15,619 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:15,620 INFO ]: Analyzing trace with hash -1944517845, now seen corresponding path program 1 times [2018-06-24 21:13:15,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:15,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:15,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:15,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:15,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:15,638 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:15,877 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:15,877 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:15,877 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) [2018-06-24 21:13:15,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:15,933 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:15,935 INFO ]: Computing forward predicates... [2018-06-24 21:13:16,039 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:16,061 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:16,061 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 21:13:16,061 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:13:16,061 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:13:16,061 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:13:16,061 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 9 states. [2018-06-24 21:13:16,333 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 21:13:16,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:16,455 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-24 21:13:16,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:13:16,456 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:13:16,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:16,456 INFO ]: With dead ends: 14 [2018-06-24 21:13:16,456 INFO ]: Without dead ends: 14 [2018-06-24 21:13:16,456 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:13:16,457 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:13:16,458 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-24 21:13:16,458 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:13:16,459 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-24 21:13:16,459 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2018-06-24 21:13:16,459 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:16,459 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-24 21:13:16,459 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:13:16,459 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-24 21:13:16,459 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:13:16,459 INFO ]: Found error trace [2018-06-24 21:13:16,459 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:16,459 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:16,459 INFO ]: Analyzing trace with hash -1944516884, now seen corresponding path program 1 times [2018-06-24 21:13:16,459 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:16,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:16,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:16,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:16,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:16,480 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:16,651 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:16,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:16,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:16,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:16,680 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:16,683 INFO ]: Computing forward predicates... [2018-06-24 21:13:16,803 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:16,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:16,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-24 21:13:16,824 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:13:16,824 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:13:16,825 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:13:16,825 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 9 states. [2018-06-24 21:13:16,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:16,867 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-24 21:13:16,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:13:16,867 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:13:16,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:16,867 INFO ]: With dead ends: 12 [2018-06-24 21:13:16,867 INFO ]: Without dead ends: 11 [2018-06-24 21:13:16,868 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:13:16,868 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:13:16,869 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:13:16,869 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:13:16,869 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 21:13:16,869 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-24 21:13:16,869 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:16,869 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 21:13:16,869 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:13:16,870 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 21:13:16,870 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:13:16,870 INFO ]: Found error trace [2018-06-24 21:13:16,870 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:16,870 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:16,870 INFO ]: Analyzing trace with hash -868163641, now seen corresponding path program 2 times [2018-06-24 21:13:16,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:16,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:16,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:16,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:16,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:16,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:17,056 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:17,056 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:17,056 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:13:17,056 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:13:17,056 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:13:17,056 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:13:17,056 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2018-06-24 21:13:17,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:17,072 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-24 21:13:17,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:13:17,073 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 21:13:17,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:17,073 INFO ]: With dead ends: 11 [2018-06-24 21:13:17,073 INFO ]: Without dead ends: 11 [2018-06-24 21:13:17,073 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:13:17,074 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:13:17,074 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:13:17,075 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:13:17,075 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 21:13:17,075 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-24 21:13:17,075 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:17,075 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 21:13:17,075 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:13:17,075 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 21:13:17,075 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:13:17,075 INFO ]: Found error trace [2018-06-24 21:13:17,075 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:17,076 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:17,076 INFO ]: Analyzing trace with hash -1144269389, now seen corresponding path program 1 times [2018-06-24 21:13:17,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:17,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:17,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:17,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:17,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:17,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:17,260 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:17,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:17,260 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:17,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:17,307 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:17,309 INFO ]: Computing forward predicates... [2018-06-24 21:13:17,443 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:17,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:17,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-24 21:13:17,469 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:13:17,469 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:13:17,469 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:13:17,469 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 13 states. [2018-06-24 21:13:17,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:17,578 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-24 21:13:17,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:13:17,578 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-24 21:13:17,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:17,579 INFO ]: With dead ends: 15 [2018-06-24 21:13:17,579 INFO ]: Without dead ends: 13 [2018-06-24 21:13:17,579 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:13:17,579 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:13:17,580 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 21:13:17,580 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:13:17,581 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 21:13:17,581 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-06-24 21:13:17,581 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:17,581 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 21:13:17,581 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:13:17,581 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 21:13:17,581 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:13:17,581 INFO ]: Found error trace [2018-06-24 21:13:17,581 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:17,581 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:17,581 INFO ]: Analyzing trace with hash -1854997681, now seen corresponding path program 2 times [2018-06-24 21:13:17,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:17,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:17,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:17,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:17,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:17,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:17,775 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:17,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:17,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:17,783 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:13:17,807 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:13:17,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:17,809 INFO ]: Computing forward predicates... [2018-06-24 21:13:17,828 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:17,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:17,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:13:17,848 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:13:17,848 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:13:17,848 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:13:17,848 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2018-06-24 21:13:17,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:17,914 INFO ]: Finished difference Result 13 states and 15 transitions. [2018-06-24 21:13:17,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:13:17,916 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 21:13:17,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:17,916 INFO ]: With dead ends: 13 [2018-06-24 21:13:17,916 INFO ]: Without dead ends: 13 [2018-06-24 21:13:17,916 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:13:17,916 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:13:17,918 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:13:17,918 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:13:17,918 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 21:13:17,918 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-24 21:13:17,918 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:17,918 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 21:13:17,918 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:13:17,918 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 21:13:17,918 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:13:17,918 INFO ]: Found error trace [2018-06-24 21:13:17,918 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:17,919 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:17,919 INFO ]: Analyzing trace with hash -1671353557, now seen corresponding path program 3 times [2018-06-24 21:13:17,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:17,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:17,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:17,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:17,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:17,941 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:18,183 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:18,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:18,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:18,192 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:13:18,255 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:13:18,255 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:18,258 INFO ]: Computing forward predicates... [2018-06-24 21:13:18,324 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:13:18,347 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:18,347 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-06-24 21:13:18,347 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:13:18,348 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:13:18,348 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:13:18,348 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2018-06-24 21:13:18,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:18,529 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 21:13:18,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:13:18,529 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 21:13:18,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:18,530 INFO ]: With dead ends: 19 [2018-06-24 21:13:18,530 INFO ]: Without dead ends: 19 [2018-06-24 21:13:18,530 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:13:18,530 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:13:18,531 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-24 21:13:18,531 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:13:18,532 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 21:13:18,532 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-24 21:13:18,532 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:18,532 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 21:13:18,532 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:13:18,532 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 21:13:18,532 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:13:18,532 INFO ]: Found error trace [2018-06-24 21:13:18,532 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:18,532 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:18,532 INFO ]: Analyzing trace with hash -1671352596, now seen corresponding path program 1 times [2018-06-24 21:13:18,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:18,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:18,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:18,533 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:18,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:18,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:18,988 WARN ]: Spent 245.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 13 [2018-06-24 21:13:19,185 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:19,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:19,186 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:13:19,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:19,227 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:19,229 INFO ]: Computing forward predicates... [2018-06-24 21:13:19,391 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:19,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:19,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-24 21:13:19,424 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:13:19,424 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:13:19,424 INFO ]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:13:19,424 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2018-06-24 21:13:19,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:19,628 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-24 21:13:19,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:13:19,628 INFO ]: Start accepts. Automaton has 17 states. Word has length 12 [2018-06-24 21:13:19,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:19,629 INFO ]: With dead ends: 17 [2018-06-24 21:13:19,629 INFO ]: Without dead ends: 14 [2018-06-24 21:13:19,630 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:13:19,630 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:13:19,631 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:13:19,631 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:13:19,631 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 21:13:19,631 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-24 21:13:19,631 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:19,631 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 21:13:19,631 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:13:19,632 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 21:13:19,632 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:13:19,632 INFO ]: Found error trace [2018-06-24 21:13:19,632 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:19,632 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:19,632 INFO ]: Analyzing trace with hash -1781441144, now seen corresponding path program 2 times [2018-06-24 21:13:19,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:19,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:19,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:19,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:19,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:19,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:19,731 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:19,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:19,731 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:19,737 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:13:19,782 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:13:19,782 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:19,784 INFO ]: Computing forward predicates... [2018-06-24 21:13:19,870 INFO ]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:19,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:19,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:13:19,903 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:13:19,903 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:13:19,903 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:13:19,903 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2018-06-24 21:13:20,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:20,000 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-24 21:13:20,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:13:20,001 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 21:13:20,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:20,002 INFO ]: With dead ends: 15 [2018-06-24 21:13:20,002 INFO ]: Without dead ends: 15 [2018-06-24 21:13:20,002 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:13:20,002 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:13:20,003 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:13:20,003 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:13:20,004 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-24 21:13:20,004 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-24 21:13:20,004 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:20,004 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-24 21:13:20,004 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:13:20,004 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-24 21:13:20,004 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:13:20,004 INFO ]: Found error trace [2018-06-24 21:13:20,004 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:20,004 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:20,004 INFO ]: Analyzing trace with hash 608870260, now seen corresponding path program 3 times [2018-06-24 21:13:20,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:20,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:20,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:20,005 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:20,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:20,026 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:20,435 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:20,435 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:20,435 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:20,441 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:13:20,477 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:13:20,477 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:20,480 INFO ]: Computing forward predicates... [2018-06-24 21:13:20,686 INFO ]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:20,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:20,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-24 21:13:20,706 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:13:20,706 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:13:20,707 INFO ]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:13:20,707 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2018-06-24 21:13:20,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:20,958 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-24 21:13:20,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:13:20,958 INFO ]: Start accepts. Automaton has 22 states. Word has length 14 [2018-06-24 21:13:20,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:20,959 INFO ]: With dead ends: 21 [2018-06-24 21:13:20,959 INFO ]: Without dead ends: 16 [2018-06-24 21:13:20,959 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:13:20,960 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:13:20,961 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:13:20,961 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:13:20,961 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 21:13:20,961 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-24 21:13:20,961 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:20,961 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 21:13:20,961 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:13:20,961 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 21:13:20,962 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:13:20,962 INFO ]: Found error trace [2018-06-24 21:13:20,962 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:20,962 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:20,962 INFO ]: Analyzing trace with hash -2107009264, now seen corresponding path program 4 times [2018-06-24 21:13:20,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:20,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:20,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:20,962 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:20,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:20,975 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:21,212 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:21,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:21,212 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:21,220 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:13:21,251 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:13:21,251 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:21,253 INFO ]: Computing forward predicates... [2018-06-24 21:13:21,264 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:21,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:21,288 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 21:13:21,288 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:13:21,288 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:13:21,288 INFO ]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:13:21,288 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 12 states. [2018-06-24 21:13:21,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:21,364 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-24 21:13:21,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:13:21,365 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-24 21:13:21,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:21,365 INFO ]: With dead ends: 17 [2018-06-24 21:13:21,365 INFO ]: Without dead ends: 17 [2018-06-24 21:13:21,365 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:13:21,365 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:13:21,366 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:13:21,366 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:13:21,367 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-24 21:13:21,367 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-24 21:13:21,367 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:21,367 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-24 21:13:21,367 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:13:21,367 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-24 21:13:21,367 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:13:21,367 INFO ]: Found error trace [2018-06-24 21:13:21,367 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:21,368 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:21,368 INFO ]: Analyzing trace with hash -893806868, now seen corresponding path program 5 times [2018-06-24 21:13:21,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:21,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:21,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:21,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:21,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:21,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:21,810 WARN ]: Spent 302.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-24 21:13:22,064 WARN ]: Spent 205.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2018-06-24 21:13:22,494 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:22,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:22,495 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:22,501 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:13:22,581 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:13:22,581 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:22,585 INFO ]: Computing forward predicates... [2018-06-24 21:13:22,849 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:22,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:22,870 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-06-24 21:13:22,870 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:13:22,870 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:13:22,870 INFO ]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:13:22,871 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 25 states. [2018-06-24 21:13:23,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:23,293 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-24 21:13:23,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:13:23,332 INFO ]: Start accepts. Automaton has 25 states. Word has length 16 [2018-06-24 21:13:23,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:23,332 INFO ]: With dead ends: 23 [2018-06-24 21:13:23,332 INFO ]: Without dead ends: 18 [2018-06-24 21:13:23,333 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:13:23,333 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:13:23,334 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:13:23,334 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:13:23,334 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 21:13:23,335 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-24 21:13:23,335 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:23,335 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 21:13:23,335 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:13:23,335 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 21:13:23,335 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:13:23,335 INFO ]: Found error trace [2018-06-24 21:13:23,335 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:23,335 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:23,335 INFO ]: Analyzing trace with hash 486086536, now seen corresponding path program 6 times [2018-06-24 21:13:23,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:23,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:23,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:23,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:23,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:23,356 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:23,814 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:23,814 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:23,814 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:23,820 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:13:23,857 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:13:23,857 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:23,860 INFO ]: Computing forward predicates... [2018-06-24 21:13:23,871 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:23,889 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:23,890 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 21:13:23,890 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:13:23,890 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:13:23,890 INFO ]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:13:23,890 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 14 states. [2018-06-24 21:13:23,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:23,945 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-24 21:13:23,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:13:23,947 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-24 21:13:23,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:23,947 INFO ]: With dead ends: 19 [2018-06-24 21:13:23,947 INFO ]: Without dead ends: 19 [2018-06-24 21:13:23,948 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:13:23,948 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:13:23,949 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 21:13:23,949 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:13:23,949 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 21:13:23,949 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-24 21:13:23,949 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:23,949 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 21:13:23,949 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:13:23,950 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 21:13:23,950 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:13:23,950 INFO ]: Found error trace [2018-06-24 21:13:23,950 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:23,950 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:23,950 INFO ]: Analyzing trace with hash -2112215692, now seen corresponding path program 7 times [2018-06-24 21:13:23,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:23,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:23,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:23,951 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:23,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:23,977 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:24,325 WARN ]: Spent 227.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-24 21:13:25,268 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:25,268 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:25,268 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:25,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:25,317 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:25,321 INFO ]: Computing forward predicates... [2018-06-24 21:13:25,654 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:25,685 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:25,685 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-06-24 21:13:25,685 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:13:25,685 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:13:25,686 INFO ]: CoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:13:25,686 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 29 states. [2018-06-24 21:13:26,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:26,326 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-24 21:13:26,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:13:26,326 INFO ]: Start accepts. Automaton has 29 states. Word has length 18 [2018-06-24 21:13:26,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:26,326 INFO ]: With dead ends: 26 [2018-06-24 21:13:26,327 INFO ]: Without dead ends: 20 [2018-06-24 21:13:26,327 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=316, Invalid=1324, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:13:26,327 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:13:26,328 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:13:26,328 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:13:26,329 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-24 21:13:26,329 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-24 21:13:26,329 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:26,329 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-24 21:13:26,329 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:13:26,329 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-24 21:13:26,329 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:13:26,329 INFO ]: Found error trace [2018-06-24 21:13:26,329 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:26,329 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:26,329 INFO ]: Analyzing trace with hash 1115418384, now seen corresponding path program 8 times [2018-06-24 21:13:26,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:26,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:26,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:26,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:26,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:26,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:27,198 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:27,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:27,198 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:27,204 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:13:27,262 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:13:27,262 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:27,265 INFO ]: Computing forward predicates... [2018-06-24 21:13:27,282 INFO ]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:27,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:27,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:13:27,302 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:13:27,302 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:13:27,303 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:13:27,303 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-06-24 21:13:27,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:27,425 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-24 21:13:27,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:13:27,425 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 21:13:27,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:27,425 INFO ]: With dead ends: 21 [2018-06-24 21:13:27,425 INFO ]: Without dead ends: 21 [2018-06-24 21:13:27,426 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=359, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:13:27,426 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:13:27,427 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 21:13:27,427 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:13:27,427 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 21:13:27,427 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-24 21:13:27,427 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:27,427 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 21:13:27,427 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:13:27,427 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 21:13:27,427 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:13:27,427 INFO ]: Found error trace [2018-06-24 21:13:27,427 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:27,427 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:27,428 INFO ]: Analyzing trace with hash 217202412, now seen corresponding path program 9 times [2018-06-24 21:13:27,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:27,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:27,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:27,428 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:13:27,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:27,469 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,031 WARN ]: Spent 263.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-24 21:13:29,140 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:13:29,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:29,140 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:29,146 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:13:29,235 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:13:29,235 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:29,241 INFO ]: Computing forward predicates... [2018-06-24 21:13:29,476 INFO ]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-24 21:13:29,496 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:29,496 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2018-06-24 21:13:29,496 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:13:29,496 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:13:29,496 INFO ]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:13:29,497 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2018-06-24 21:13:29,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:29,790 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-24 21:13:29,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:13:29,790 INFO ]: Start accepts. Automaton has 21 states. Word has length 20 [2018-06-24 21:13:29,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:29,790 INFO ]: With dead ends: 27 [2018-06-24 21:13:29,790 INFO ]: Without dead ends: 0 [2018-06-24 21:13:29,790 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:13:29,790 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:13:29,790 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:13:29,790 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:13:29,790 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:13:29,790 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-06-24 21:13:29,790 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:29,790 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:13:29,790 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:13:29,790 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:13:29,790 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:13:29,792 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:13:29,793 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:29 BasicIcfg [2018-06-24 21:13:29,793 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:13:29,794 INFO ]: Toolchain (without parser) took 16350.26 ms. Allocated memory was 309.3 MB in the beginning and 556.3 MB in the end (delta: 246.9 MB). Free memory was 263.7 MB in the beginning and 460.2 MB in the end (delta: -196.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:29,794 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:13:29,795 INFO ]: ChcToBoogie took 62.91 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:29,795 INFO ]: Boogie Preprocessor took 37.17 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 259.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:29,795 INFO ]: RCFGBuilder took 373.26 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 248.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:29,796 INFO ]: BlockEncodingV2 took 373.91 ms. Allocated memory is still 309.3 MB. Free memory was 248.6 MB in the beginning and 241.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:29,797 INFO ]: TraceAbstraction took 15494.64 ms. Allocated memory was 309.3 MB in the beginning and 556.3 MB in the end (delta: 246.9 MB). Free memory was 240.6 MB in the beginning and 460.2 MB in the end (delta: -219.6 MB). Peak memory consumption was 27.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:29,801 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 18 edges - StatisticsResult: Encoded RCFG 8 locations, 14 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.91 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.17 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 259.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 373.26 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 248.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 373.91 ms. Allocated memory is still 309.3 MB. Free memory was 248.6 MB in the beginning and 241.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15494.64 ms. Allocated memory was 309.3 MB in the beginning and 556.3 MB in the end (delta: 246.9 MB). Free memory was 240.6 MB in the beginning and 460.2 MB in the end (delta: -219.6 MB). Peak memory consumption was 27.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. SAFE Result, 15.4s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 249 SDslu, 637 SDs, 0 SdLazy, 999 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 155 SyntacticMatches, 8 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=18, 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, 19 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 35959 SizeOfPredicates, 240 NumberOfNonLiveVariables, 3824 ConjunctsInSsa, 834 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 241/536 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/array_init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-13-29-812.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-13-29-812.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-13-29-812.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_init.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-13-29-812.csv Received shutdown request...