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/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:10:25,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:10:25,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:10:25,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:10:25,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:10:25,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:10:25,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:10:25,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:10:25,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:10:25,447 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:10:25,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:10:25,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:10:25,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:10:25,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:10:25,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:10:25,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:10:25,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:10:25,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:10:25,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:10:25,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:10:25,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:10:25,473 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:10:25,473 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:10:25,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:10:25,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:10:25,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:10:25,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:10:25,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:10:25,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:10:25,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:10:25,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:10:25,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:10:25,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:10:25,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:10:25,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:10:25,486 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:10:25,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:10:25,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:10:25,507 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:10:25,507 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:10:25,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:10:25,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:10:25,508 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:10:25,509 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:10:25,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:10:25,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:10:25,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:10:25,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:10:25,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:10:25,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:10:25,511 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:10:25,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:10:25,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:10:25,511 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:10:25,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:10:25,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:10:25,512 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:10:25,513 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:10:25,514 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:10:25,547 INFO ]: Repository-Root is: /tmp [2018-06-24 21:10:25,561 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:10:25,566 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:10:25,567 INFO ]: Initializing SmtParser... [2018-06-24 21:10:25,568 INFO ]: SmtParser initialized [2018-06-24 21:10:25,568 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 [2018-06-24 21:10:25,570 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:10:25,654 INFO ]: Executing SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 unknown [2018-06-24 21:10:25,838 INFO ]: Succesfully executed SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 [2018-06-24 21:10:25,842 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:10:25,848 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:10:25,849 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:10:25,849 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:10:25,849 INFO ]: ChcToBoogie initialized [2018-06-24 21:10:25,852 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,912 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25 Unit [2018-06-24 21:10:25,912 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:10:25,913 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:10:25,913 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:10:25,913 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:10:25,932 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,933 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,939 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,939 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,941 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,944 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,945 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (1/1) ... [2018-06-24 21:10:25,948 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:10:25,948 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:10:25,948 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:10:25,948 INFO ]: RCFGBuilder initialized [2018-06-24 21:10:25,949 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (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:10:25,961 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:10:25,961 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:10:25,961 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:10:25,961 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:10:25,961 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:10:25,961 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:10:26,354 INFO ]: Using library mode [2018-06-24 21:10:26,355 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:10:26 BoogieIcfgContainer [2018-06-24 21:10:26,355 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:10:26,355 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:10:26,355 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:10:26,356 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:10:26,357 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:10:26" (1/1) ... [2018-06-24 21:10:26,371 INFO ]: Initial Icfg 16 locations, 18 edges [2018-06-24 21:10:26,373 INFO ]: Using Remove infeasible edges [2018-06-24 21:10:26,373 INFO ]: Using Maximize final states [2018-06-24 21:10:26,374 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:10:26,374 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:10:26,375 INFO ]: Using Remove sink states [2018-06-24 21:10:26,376 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:10:26,376 INFO ]: Using Use SBE [2018-06-24 21:10:26,393 INFO ]: SBE split 1 edges [2018-06-24 21:10:26,398 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:10:26,399 INFO ]: 0 new accepting states [2018-06-24 21:10:26,659 INFO ]: Removed 25 edges and 8 locations by large block encoding [2018-06-24 21:10:26,660 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:10:26,663 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-24 21:10:26,663 INFO ]: 0 new accepting states [2018-06-24 21:10:26,663 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:10:26,663 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:10:26,665 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:10:26,665 INFO ]: 0 new accepting states [2018-06-24 21:10:26,665 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:10:26,665 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:10:26,665 INFO ]: Encoded RCFG 6 locations, 9 edges [2018-06-24 21:10:26,666 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:10:26 BasicIcfg [2018-06-24 21:10:26,668 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:10:26,669 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:10:26,669 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:10:26,673 INFO ]: TraceAbstraction initialized [2018-06-24 21:10:26,674 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:10:25" (1/4) ... [2018-06-24 21:10:26,674 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52482a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:10:26, skipping insertion in model container [2018-06-24 21:10:26,674 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:10:25" (2/4) ... [2018-06-24 21:10:26,675 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52482a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:10:26, skipping insertion in model container [2018-06-24 21:10:26,675 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:10:26" (3/4) ... [2018-06-24 21:10:26,675 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52482a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:10:26, skipping insertion in model container [2018-06-24 21:10:26,675 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:10:26" (4/4) ... [2018-06-24 21:10:26,676 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:10:26,686 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:10:26,694 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:10:26,747 INFO ]: Using default assertion order modulation [2018-06-24 21:10:26,748 INFO ]: Interprodecural is true [2018-06-24 21:10:26,748 INFO ]: Hoare is false [2018-06-24 21:10:26,748 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:10:26,748 INFO ]: Backedges is TWOTRACK [2018-06-24 21:10:26,748 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:10:26,748 INFO ]: Difference is false [2018-06-24 21:10:26,748 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:10:26,748 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:10:26,761 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:10:26,776 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:10:26,777 INFO ]: Found error trace [2018-06-24 21:10:26,777 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:10:26,778 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:26,784 INFO ]: Analyzing trace with hash 34175623, now seen corresponding path program 1 times [2018-06-24 21:10:26,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:26,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:26,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:26,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:26,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:26,873 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:26,936 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:10:26,938 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:26,939 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:26,940 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:26,956 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:26,956 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:26,959 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:10:27,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:27,131 INFO ]: Finished difference Result 7 states and 13 transitions. [2018-06-24 21:10:27,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:27,133 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:10:27,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:27,141 INFO ]: With dead ends: 7 [2018-06-24 21:10:27,141 INFO ]: Without dead ends: 7 [2018-06-24 21:10:27,142 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:27,159 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:10:27,180 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:10:27,181 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:10:27,182 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-06-24 21:10:27,183 INFO ]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 5 [2018-06-24 21:10:27,184 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:27,184 INFO ]: Abstraction has 7 states and 13 transitions. [2018-06-24 21:10:27,184 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:27,184 INFO ]: Start isEmpty. Operand 7 states and 13 transitions. [2018-06-24 21:10:27,184 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:10:27,184 INFO ]: Found error trace [2018-06-24 21:10:27,184 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:10:27,184 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:27,186 INFO ]: Analyzing trace with hash 1059373306, now seen corresponding path program 1 times [2018-06-24 21:10:27,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:27,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:27,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:27,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:27,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:27,237 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:27,541 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-06-24 21:10:27,643 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:10:27,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:27,644 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:10:27,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:27,701 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:27,709 INFO ]: Computing forward predicates... [2018-06-24 21:10:27,911 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:10:27,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:27,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:10:27,932 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:10:27,932 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:10:27,932 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:10:27,933 INFO ]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-06-24 21:10:28,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:28,040 INFO ]: Finished difference Result 8 states and 17 transitions. [2018-06-24 21:10:28,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:10:28,040 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:10:28,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:28,041 INFO ]: With dead ends: 8 [2018-06-24 21:10:28,041 INFO ]: Without dead ends: 8 [2018-06-24 21:10:28,042 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:10:28,042 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:10:28,043 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:10:28,043 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:10:28,043 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-24 21:10:28,043 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 6 [2018-06-24 21:10:28,043 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:28,044 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-24 21:10:28,044 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:10:28,044 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-24 21:10:28,044 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:10:28,044 INFO ]: Found error trace [2018-06-24 21:10:28,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:10:28,044 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:28,044 INFO ]: Analyzing trace with hash 1059403097, now seen corresponding path program 1 times [2018-06-24 21:10:28,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:28,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:28,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:28,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:28,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:28,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:28,146 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:28,146 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:28,146 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:10:28,146 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:10:28,146 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:10:28,147 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:10:28,147 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 4 states. [2018-06-24 21:10:28,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:28,274 INFO ]: Finished difference Result 13 states and 35 transitions. [2018-06-24 21:10:28,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:10:28,275 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:10:28,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:28,277 INFO ]: With dead ends: 13 [2018-06-24 21:10:28,277 INFO ]: Without dead ends: 13 [2018-06-24 21:10:28,277 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:10:28,277 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:10:28,280 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 21:10:28,280 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:10:28,280 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2018-06-24 21:10:28,280 INFO ]: Start accepts. Automaton has 12 states and 34 transitions. Word has length 6 [2018-06-24 21:10:28,280 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:28,280 INFO ]: Abstraction has 12 states and 34 transitions. [2018-06-24 21:10:28,280 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:10:28,280 INFO ]: Start isEmpty. Operand 12 states and 34 transitions. [2018-06-24 21:10:28,281 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:10:28,281 INFO ]: Found error trace [2018-06-24 21:10:28,281 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:10:28,281 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:28,281 INFO ]: Analyzing trace with hash 1059432888, now seen corresponding path program 1 times [2018-06-24 21:10:28,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:28,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:28,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:28,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:28,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:28,292 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:28,337 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:28,338 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:10:28,338 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:10:28,338 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:10:28,338 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:10:28,338 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:28,338 INFO ]: Start difference. First operand 12 states and 34 transitions. Second operand 3 states. [2018-06-24 21:10:28,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:28,351 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-24 21:10:28,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:10:28,352 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:10:28,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:28,352 INFO ]: With dead ends: 12 [2018-06-24 21:10:28,352 INFO ]: Without dead ends: 12 [2018-06-24 21:10:28,352 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:10:28,352 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:10:28,354 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:10:28,354 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:10:28,354 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-24 21:10:28,354 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 6 [2018-06-24 21:10:28,354 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:28,355 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-24 21:10:28,355 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:10:28,355 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-24 21:10:28,355 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:10:28,355 INFO ]: Found error trace [2018-06-24 21:10:28,355 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:10:28,355 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:28,355 INFO ]: Analyzing trace with hash -1519236889, now seen corresponding path program 2 times [2018-06-24 21:10:28,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:28,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:28,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:28,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:28,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:28,375 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:28,773 WARN ]: Spent 249.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-06-24 21:10:28,906 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:28,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:28,906 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:28,912 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:10:28,947 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:10:28,947 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:28,949 INFO ]: Computing forward predicates... [2018-06-24 21:10:29,052 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:29,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:29,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:10:29,071 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:10:29,071 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:10:29,071 INFO ]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:10:29,072 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 8 states. [2018-06-24 21:10:29,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:29,105 INFO ]: Finished difference Result 14 states and 33 transitions. [2018-06-24 21:10:29,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:10:29,105 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:10:29,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:29,106 INFO ]: With dead ends: 14 [2018-06-24 21:10:29,106 INFO ]: Without dead ends: 14 [2018-06-24 21:10:29,106 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:10:29,106 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:10:29,108 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:10:29,108 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:10:29,109 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-06-24 21:10:29,109 INFO ]: Start accepts. Automaton has 14 states and 33 transitions. Word has length 7 [2018-06-24 21:10:29,109 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:29,109 INFO ]: Abstraction has 14 states and 33 transitions. [2018-06-24 21:10:29,109 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:10:29,109 INFO ]: Start isEmpty. Operand 14 states and 33 transitions. [2018-06-24 21:10:29,109 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:10:29,109 INFO ]: Found error trace [2018-06-24 21:10:29,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:29,109 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:29,109 INFO ]: Analyzing trace with hash -1522901182, now seen corresponding path program 1 times [2018-06-24 21:10:29,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:29,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:29,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:29,110 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:29,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:29,122 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:29,263 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:29,263 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:29,263 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:10:29,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:29,297 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:29,298 INFO ]: Computing forward predicates... [2018-06-24 21:10:29,306 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:29,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:29,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:10:29,329 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:10:29,329 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:10:29,329 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:10:29,329 INFO ]: Start difference. First operand 14 states and 33 transitions. Second operand 5 states. [2018-06-24 21:10:29,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:29,380 INFO ]: Finished difference Result 18 states and 42 transitions. [2018-06-24 21:10:29,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:10:29,381 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 21:10:29,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:29,381 INFO ]: With dead ends: 18 [2018-06-24 21:10:29,382 INFO ]: Without dead ends: 14 [2018-06-24 21:10:29,382 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:10:29,382 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:10:29,383 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:10:29,384 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:10:29,385 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-24 21:10:29,385 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 7 [2018-06-24 21:10:29,385 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:29,385 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-24 21:10:29,385 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:10:29,385 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-24 21:10:29,385 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:29,385 INFO ]: Found error trace [2018-06-24 21:10:29,385 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 21:10:29,385 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:29,386 INFO ]: Analyzing trace with hash 148225690, now seen corresponding path program 3 times [2018-06-24 21:10:29,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:29,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:29,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:29,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:29,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:29,428 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:29,800 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:29,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:29,800 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:10:29,807 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:10:29,885 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:10:29,885 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:29,890 INFO ]: Computing forward predicates... [2018-06-24 21:10:30,278 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:30,299 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:30,299 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:10:30,299 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:10:30,300 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:10:30,300 INFO ]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:10:30,300 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 10 states. [2018-06-24 21:10:30,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:30,357 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-24 21:10:30,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:10:30,357 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:10:30,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:30,358 INFO ]: With dead ends: 16 [2018-06-24 21:10:30,358 INFO ]: Without dead ends: 16 [2018-06-24 21:10:30,358 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:10:30,358 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:10:30,360 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:10:30,360 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:10:30,361 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2018-06-24 21:10:30,361 INFO ]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 8 [2018-06-24 21:10:30,361 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:30,361 INFO ]: Abstraction has 16 states and 37 transitions. [2018-06-24 21:10:30,361 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:10:30,361 INFO ]: Start isEmpty. Operand 16 states and 37 transitions. [2018-06-24 21:10:30,361 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:30,361 INFO ]: Found error trace [2018-06-24 21:10:30,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:30,361 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:30,362 INFO ]: Analyzing trace with hash 144561397, now seen corresponding path program 1 times [2018-06-24 21:10:30,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:30,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:30,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:30,362 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:30,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:30,375 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:30,458 INFO ]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:10:30,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:30,458 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:10:30,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:30,505 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:30,508 INFO ]: Computing forward predicates... [2018-06-24 21:10:30,607 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:10:30,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:30,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:10:30,626 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:10:30,626 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:10:30,626 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:10:30,626 INFO ]: Start difference. First operand 16 states and 37 transitions. Second operand 6 states. [2018-06-24 21:10:30,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:30,702 INFO ]: Finished difference Result 21 states and 51 transitions. [2018-06-24 21:10:30,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:10:30,703 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 21:10:30,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:30,703 INFO ]: With dead ends: 21 [2018-06-24 21:10:30,703 INFO ]: Without dead ends: 16 [2018-06-24 21:10:30,703 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:10:30,703 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:10:30,705 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:10:30,705 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:10:30,705 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2018-06-24 21:10:30,705 INFO ]: Start accepts. Automaton has 16 states and 35 transitions. Word has length 8 [2018-06-24 21:10:30,705 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:30,705 INFO ]: Abstraction has 16 states and 35 transitions. [2018-06-24 21:10:30,705 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:10:30,705 INFO ]: Start isEmpty. Operand 16 states and 35 transitions. [2018-06-24 21:10:30,705 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:10:30,705 INFO ]: Found error trace [2018-06-24 21:10:30,705 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:30,706 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:30,706 INFO ]: Analyzing trace with hash 173190548, now seen corresponding path program 2 times [2018-06-24 21:10:30,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:30,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:30,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:30,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:30,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:30,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:30,899 INFO ]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:30,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:30,899 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:10:30,904 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:10:30,929 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:10:30,929 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:30,931 INFO ]: Computing forward predicates... [2018-06-24 21:10:31,290 WARN ]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:10:31,344 INFO ]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:31,363 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:31,363 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:10:31,363 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:10:31,364 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:10:31,364 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:10:31,364 INFO ]: Start difference. First operand 16 states and 35 transitions. Second operand 10 states. [2018-06-24 21:10:31,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:31,461 INFO ]: Finished difference Result 24 states and 54 transitions. [2018-06-24 21:10:31,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:10:31,461 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:10:31,461 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:31,462 INFO ]: With dead ends: 24 [2018-06-24 21:10:31,462 INFO ]: Without dead ends: 24 [2018-06-24 21:10:31,462 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:10:31,462 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 21:10:31,465 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-24 21:10:31,465 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:10:31,465 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 52 transitions. [2018-06-24 21:10:31,465 INFO ]: Start accepts. Automaton has 22 states and 52 transitions. Word has length 8 [2018-06-24 21:10:31,465 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:31,465 INFO ]: Abstraction has 22 states and 52 transitions. [2018-06-24 21:10:31,465 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:10:31,465 INFO ]: Start isEmpty. Operand 22 states and 52 transitions. [2018-06-24 21:10:31,466 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:31,466 INFO ]: Found error trace [2018-06-24 21:10:31,466 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 21:10:31,466 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:31,466 INFO ]: Analyzing trace with hash 299958087, now seen corresponding path program 4 times [2018-06-24 21:10:31,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:31,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:31,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:31,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:31,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:31,482 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:31,874 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2018-06-24 21:10:32,082 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:32,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:32,082 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:32,100 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:10:32,143 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:10:32,143 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:32,191 INFO ]: Computing forward predicates... [2018-06-24 21:10:32,308 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:32,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:32,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:10:32,329 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:10:32,329 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:10:32,329 INFO ]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:32,329 INFO ]: Start difference. First operand 22 states and 52 transitions. Second operand 12 states. [2018-06-24 21:10:32,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:32,384 INFO ]: Finished difference Result 25 states and 61 transitions. [2018-06-24 21:10:32,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:10:32,386 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:10:32,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:32,387 INFO ]: With dead ends: 25 [2018-06-24 21:10:32,387 INFO ]: Without dead ends: 25 [2018-06-24 21:10:32,387 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:32,387 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:10:32,390 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 21:10:32,390 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:10:32,391 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2018-06-24 21:10:32,392 INFO ]: Start accepts. Automaton has 25 states and 61 transitions. Word has length 9 [2018-06-24 21:10:32,392 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:32,392 INFO ]: Abstraction has 25 states and 61 transitions. [2018-06-24 21:10:32,392 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:10:32,392 INFO ]: Start isEmpty. Operand 25 states and 61 transitions. [2018-06-24 21:10:32,392 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:10:32,392 INFO ]: Found error trace [2018-06-24 21:10:32,392 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:32,392 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:32,392 INFO ]: Analyzing trace with hash 296293794, now seen corresponding path program 2 times [2018-06-24 21:10:32,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:32,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:32,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:32,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:32,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:32,402 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:32,511 INFO ]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:32,511 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:32,511 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:10:32,518 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:10:32,571 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:10:32,571 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:32,573 INFO ]: Computing forward predicates... [2018-06-24 21:10:32,595 INFO ]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:32,614 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:32,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:10:32,615 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:10:32,615 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:10:32,615 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:10:32,615 INFO ]: Start difference. First operand 25 states and 61 transitions. Second operand 7 states. [2018-06-24 21:10:32,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:32,672 INFO ]: Finished difference Result 35 states and 84 transitions. [2018-06-24 21:10:32,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:10:32,672 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 21:10:32,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:32,673 INFO ]: With dead ends: 35 [2018-06-24 21:10:32,673 INFO ]: Without dead ends: 35 [2018-06-24 21:10:32,673 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:10:32,674 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:10:32,677 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-06-24 21:10:32,677 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:10:32,678 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 79 transitions. [2018-06-24 21:10:32,678 INFO ]: Start accepts. Automaton has 32 states and 79 transitions. Word has length 9 [2018-06-24 21:10:32,678 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:32,678 INFO ]: Abstraction has 32 states and 79 transitions. [2018-06-24 21:10:32,678 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:10:32,678 INFO ]: Start isEmpty. Operand 32 states and 79 transitions. [2018-06-24 21:10:32,678 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:10:32,678 INFO ]: Found error trace [2018-06-24 21:10:32,678 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 21:10:32,678 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:32,679 INFO ]: Analyzing trace with hash 708695098, now seen corresponding path program 5 times [2018-06-24 21:10:32,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:32,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:32,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:32,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:32,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:32,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:33,264 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2018-06-24 21:10:33,449 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2018-06-24 21:10:33,450 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:33,450 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:33,450 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:10:33,462 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:10:33,498 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:10:33,498 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:33,501 INFO ]: Computing forward predicates... [2018-06-24 21:10:33,661 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:33,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:33,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:10:33,680 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:10:33,680 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:10:33,680 INFO ]: CoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:10:33,680 INFO ]: Start difference. First operand 32 states and 79 transitions. Second operand 14 states. [2018-06-24 21:10:33,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:33,866 INFO ]: Finished difference Result 35 states and 88 transitions. [2018-06-24 21:10:33,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:10:33,867 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:10:33,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:33,867 INFO ]: With dead ends: 35 [2018-06-24 21:10:33,867 INFO ]: Without dead ends: 35 [2018-06-24 21:10:33,868 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:10:33,868 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:10:33,871 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:10:33,871 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:10:33,875 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 88 transitions. [2018-06-24 21:10:33,875 INFO ]: Start accepts. Automaton has 35 states and 88 transitions. Word has length 10 [2018-06-24 21:10:33,875 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:33,875 INFO ]: Abstraction has 35 states and 88 transitions. [2018-06-24 21:10:33,875 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:10:33,875 INFO ]: Start isEmpty. Operand 35 states and 88 transitions. [2018-06-24 21:10:33,875 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:10:33,875 INFO ]: Found error trace [2018-06-24 21:10:33,875 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:33,876 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:33,876 INFO ]: Analyzing trace with hash 594208285, now seen corresponding path program 3 times [2018-06-24 21:10:33,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:33,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:33,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:33,876 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:33,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:33,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:34,134 INFO ]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:10:34,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:34,135 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:10:34,140 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:10:34,177 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:10:34,177 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:34,180 INFO ]: Computing forward predicates... [2018-06-24 21:10:34,264 INFO ]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:10:34,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:34,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 21:10:34,284 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:10:34,284 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:10:34,284 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:10:34,284 INFO ]: Start difference. First operand 35 states and 88 transitions. Second operand 9 states. [2018-06-24 21:10:34,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:34,541 INFO ]: Finished difference Result 43 states and 109 transitions. [2018-06-24 21:10:34,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:10:34,542 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 21:10:34,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:34,543 INFO ]: With dead ends: 43 [2018-06-24 21:10:34,543 INFO ]: Without dead ends: 35 [2018-06-24 21:10:34,543 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:34,543 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:10:34,546 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:10:34,546 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:10:34,547 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 85 transitions. [2018-06-24 21:10:34,547 INFO ]: Start accepts. Automaton has 35 states and 85 transitions. Word has length 10 [2018-06-24 21:10:34,547 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:34,547 INFO ]: Abstraction has 35 states and 85 transitions. [2018-06-24 21:10:34,547 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:10:34,547 INFO ]: Start isEmpty. Operand 35 states and 85 transitions. [2018-06-24 21:10:34,548 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:10:34,548 INFO ]: Found error trace [2018-06-24 21:10:34,548 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-24 21:10:34,548 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:34,548 INFO ]: Analyzing trace with hash -1073544433, now seen corresponding path program 3 times [2018-06-24 21:10:34,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:34,548 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:34,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:34,549 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:34,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:34,562 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:34,971 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:34,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:34,971 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:10:34,977 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:10:35,012 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:10:35,012 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:35,015 INFO ]: Computing forward predicates... [2018-06-24 21:10:35,159 INFO ]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:35,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:35,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 21:10:35,186 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:10:35,186 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:10:35,186 INFO ]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:35,186 INFO ]: Start difference. First operand 35 states and 85 transitions. Second operand 12 states. [2018-06-24 21:10:35,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:35,410 INFO ]: Finished difference Result 49 states and 117 transitions. [2018-06-24 21:10:35,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:10:35,410 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-24 21:10:35,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:35,411 INFO ]: With dead ends: 49 [2018-06-24 21:10:35,411 INFO ]: Without dead ends: 49 [2018-06-24 21:10:35,412 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:10:35,412 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:10:35,415 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-06-24 21:10:35,416 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 21:10:35,416 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 114 transitions. [2018-06-24 21:10:35,416 INFO ]: Start accepts. Automaton has 46 states and 114 transitions. Word has length 10 [2018-06-24 21:10:35,416 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:35,416 INFO ]: Abstraction has 46 states and 114 transitions. [2018-06-24 21:10:35,417 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:10:35,417 INFO ]: Start isEmpty. Operand 46 states and 114 transitions. [2018-06-24 21:10:35,417 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:10:35,417 INFO ]: Found error trace [2018-06-24 21:10:35,417 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 21:10:35,417 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:35,417 INFO ]: Analyzing trace with hash 494640551, now seen corresponding path program 6 times [2018-06-24 21:10:35,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:35,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:35,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:35,418 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:35,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:35,438 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:35,937 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2018-06-24 21:10:36,383 WARN ]: Spent 290.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 42 [2018-06-24 21:10:36,688 WARN ]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2018-06-24 21:10:36,689 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:36,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:36,689 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:10:36,695 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:10:36,733 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:10:36,733 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:36,737 INFO ]: Computing forward predicates... [2018-06-24 21:10:37,123 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:37,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:37,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:10:37,142 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:10:37,142 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:10:37,142 INFO ]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:10:37,142 INFO ]: Start difference. First operand 46 states and 114 transitions. Second operand 16 states. [2018-06-24 21:10:37,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:37,216 INFO ]: Finished difference Result 50 states and 126 transitions. [2018-06-24 21:10:37,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:10:37,216 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-24 21:10:37,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:37,217 INFO ]: With dead ends: 50 [2018-06-24 21:10:37,217 INFO ]: Without dead ends: 50 [2018-06-24 21:10:37,217 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:10:37,217 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 21:10:37,219 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-24 21:10:37,219 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:10:37,220 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 126 transitions. [2018-06-24 21:10:37,220 INFO ]: Start accepts. Automaton has 50 states and 126 transitions. Word has length 11 [2018-06-24 21:10:37,220 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:37,220 INFO ]: Abstraction has 50 states and 126 transitions. [2018-06-24 21:10:37,220 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:10:37,220 INFO ]: Start isEmpty. Operand 50 states and 126 transitions. [2018-06-24 21:10:37,220 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:10:37,220 INFO ]: Found error trace [2018-06-24 21:10:37,220 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:37,220 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:37,221 INFO ]: Analyzing trace with hash 380153738, now seen corresponding path program 4 times [2018-06-24 21:10:37,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:37,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:37,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:37,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,231 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:37,337 INFO ]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:37,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:37,337 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:10:37,342 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:10:37,373 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:10:37,373 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:37,375 INFO ]: Computing forward predicates... [2018-06-24 21:10:37,386 INFO ]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:37,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:37,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:10:37,406 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:10:37,406 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:10:37,406 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:10:37,406 INFO ]: Start difference. First operand 50 states and 126 transitions. Second operand 9 states. [2018-06-24 21:10:37,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:37,480 INFO ]: Finished difference Result 74 states and 177 transitions. [2018-06-24 21:10:37,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:10:37,480 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 21:10:37,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:37,481 INFO ]: With dead ends: 74 [2018-06-24 21:10:37,481 INFO ]: Without dead ends: 74 [2018-06-24 21:10:37,481 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:10:37,481 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:10:37,486 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-06-24 21:10:37,486 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:10:37,487 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 163 transitions. [2018-06-24 21:10:37,487 INFO ]: Start accepts. Automaton has 66 states and 163 transitions. Word has length 11 [2018-06-24 21:10:37,487 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:37,487 INFO ]: Abstraction has 66 states and 163 transitions. [2018-06-24 21:10:37,487 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:10:37,487 INFO ]: Start isEmpty. Operand 66 states and 163 transitions. [2018-06-24 21:10:37,488 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:10:37,488 INFO ]: Found error trace [2018-06-24 21:10:37,488 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 21:10:37,488 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:37,488 INFO ]: Analyzing trace with hash -1846083110, now seen corresponding path program 7 times [2018-06-24 21:10:37,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:37,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:37,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:37,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:37,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:38,284 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 39 [2018-06-24 21:10:38,636 WARN ]: Spent 299.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2018-06-24 21:10:38,991 WARN ]: Spent 316.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2018-06-24 21:10:38,992 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:38,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:38,992 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:10:38,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:39,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:39,058 INFO ]: Computing forward predicates... [2018-06-24 21:10:39,316 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:39,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:39,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 21:10:39,335 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:10:39,432 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:10:39,432 INFO ]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:10:39,433 INFO ]: Start difference. First operand 66 states and 163 transitions. Second operand 18 states. [2018-06-24 21:10:39,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:39,469 INFO ]: Finished difference Result 70 states and 175 transitions. [2018-06-24 21:10:39,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:10:39,469 INFO ]: Start accepts. Automaton has 18 states. Word has length 12 [2018-06-24 21:10:39,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:39,469 INFO ]: With dead ends: 70 [2018-06-24 21:10:39,469 INFO ]: Without dead ends: 70 [2018-06-24 21:10:39,470 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:10:39,470 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:10:39,476 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-24 21:10:39,476 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 21:10:39,477 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 175 transitions. [2018-06-24 21:10:39,477 INFO ]: Start accepts. Automaton has 70 states and 175 transitions. Word has length 12 [2018-06-24 21:10:39,478 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:39,478 INFO ]: Abstraction has 70 states and 175 transitions. [2018-06-24 21:10:39,478 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:10:39,478 INFO ]: Start isEmpty. Operand 70 states and 175 transitions. [2018-06-24 21:10:39,478 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:10:39,478 INFO ]: Found error trace [2018-06-24 21:10:39,478 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:39,478 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:39,479 INFO ]: Analyzing trace with hash -1101100747, now seen corresponding path program 5 times [2018-06-24 21:10:39,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:39,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:39,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:39,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:10:39,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:39,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:39,738 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-24 21:10:40,036 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-06-24 21:10:40,584 WARN ]: Spent 473.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-06-24 21:10:40,708 INFO ]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:10:40,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:40,708 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) [2018-06-24 21:10:40,722 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:40,814 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:10:40,814 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:40,817 INFO ]: Computing forward predicates... [2018-06-24 21:10:40,902 INFO ]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:40,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:40,921 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-24 21:10:40,922 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:10:40,922 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:10:40,922 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:10:40,922 INFO ]: Start difference. First operand 70 states and 175 transitions. Second operand 14 states. [2018-06-24 21:10:41,553 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-06-24 21:10:42,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:42,177 INFO ]: Finished difference Result 159 states and 407 transitions. [2018-06-24 21:10:42,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:10:42,177 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-24 21:10:42,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:42,178 INFO ]: With dead ends: 159 [2018-06-24 21:10:42,178 INFO ]: Without dead ends: 159 [2018-06-24 21:10:42,179 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:10:42,179 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-24 21:10:42,187 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 117. [2018-06-24 21:10:42,187 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-24 21:10:42,188 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2018-06-24 21:10:42,188 INFO ]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 12 [2018-06-24 21:10:42,189 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:42,189 INFO ]: Abstraction has 117 states and 298 transitions. [2018-06-24 21:10:42,189 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:10:42,189 INFO ]: Start isEmpty. Operand 117 states and 298 transitions. [2018-06-24 21:10:42,190 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:10:42,190 INFO ]: Found error trace [2018-06-24 21:10:42,190 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-06-24 21:10:42,190 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:42,190 INFO ]: Analyzing trace with hash -889985590, now seen corresponding path program 4 times [2018-06-24 21:10:42,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:42,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:42,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:42,191 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:42,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:42,207 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:42,707 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-06-24 21:10:42,903 INFO ]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:42,903 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:42,903 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:42,908 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:10:42,949 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:10:42,950 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:42,952 INFO ]: Computing forward predicates... [2018-06-24 21:10:43,294 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:10:43,898 WARN ]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-06-24 21:10:43,947 INFO ]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:43,965 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:43,965 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-24 21:10:43,965 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:10:43,966 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:10:43,966 INFO ]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:10:43,966 INFO ]: Start difference. First operand 117 states and 298 transitions. Second operand 16 states. [2018-06-24 21:10:44,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:44,240 INFO ]: Finished difference Result 183 states and 461 transitions. [2018-06-24 21:10:44,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:10:44,240 INFO ]: Start accepts. Automaton has 16 states. Word has length 12 [2018-06-24 21:10:44,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:44,241 INFO ]: With dead ends: 183 [2018-06-24 21:10:44,241 INFO ]: Without dead ends: 183 [2018-06-24 21:10:44,241 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:10:44,241 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-24 21:10:44,248 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 154. [2018-06-24 21:10:44,248 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-24 21:10:44,250 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 391 transitions. [2018-06-24 21:10:44,250 INFO ]: Start accepts. Automaton has 154 states and 391 transitions. Word has length 12 [2018-06-24 21:10:44,250 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:44,250 INFO ]: Abstraction has 154 states and 391 transitions. [2018-06-24 21:10:44,250 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:10:44,250 INFO ]: Start isEmpty. Operand 154 states and 391 transitions. [2018-06-24 21:10:44,251 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:10:44,251 INFO ]: Found error trace [2018-06-24 21:10:44,251 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 21:10:44,251 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:44,251 INFO ]: Analyzing trace with hash -1394072569, now seen corresponding path program 8 times [2018-06-24 21:10:44,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:44,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:44,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:44,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:44,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:44,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:44,744 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-24 21:10:45,340 WARN ]: Spent 237.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 45 [2018-06-24 21:10:45,819 WARN ]: Spent 331.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2018-06-24 21:10:46,190 WARN ]: Spent 306.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 55 [2018-06-24 21:10:46,192 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:10:46,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:46,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:46,198 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:10:46,291 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:10:46,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:46,296 INFO ]: Computing forward predicates... [2018-06-24 21:10:46,708 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:10:46,726 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:46,726 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 21:10:46,726 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:10:46,727 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:10:46,727 INFO ]: CoverageRelationStatistics Valid=153, Invalid=227, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:10:46,727 INFO ]: Start difference. First operand 154 states and 391 transitions. Second operand 20 states. [2018-06-24 21:10:46,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:46,763 INFO ]: Finished difference Result 172 states and 443 transitions. [2018-06-24 21:10:46,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:10:46,763 INFO ]: Start accepts. Automaton has 20 states. Word has length 13 [2018-06-24 21:10:46,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:46,764 INFO ]: With dead ends: 172 [2018-06-24 21:10:46,764 INFO ]: Without dead ends: 172 [2018-06-24 21:10:46,765 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=227, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:10:46,765 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-24 21:10:46,775 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 159. [2018-06-24 21:10:46,775 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-24 21:10:46,785 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 406 transitions. [2018-06-24 21:10:46,785 INFO ]: Start accepts. Automaton has 159 states and 406 transitions. Word has length 13 [2018-06-24 21:10:46,785 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:46,785 INFO ]: Abstraction has 159 states and 406 transitions. [2018-06-24 21:10:46,785 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:10:46,785 INFO ]: Start isEmpty. Operand 159 states and 406 transitions. [2018-06-24 21:10:46,786 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:10:46,786 INFO ]: Found error trace [2018-06-24 21:10:46,786 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 21:10:46,786 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:46,786 INFO ]: Analyzing trace with hash -266647686, now seen corresponding path program 9 times [2018-06-24 21:10:46,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:46,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:46,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:46,786 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:46,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:46,803 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:47,376 WARN ]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-24 21:10:47,579 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-06-24 21:10:48,168 WARN ]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2018-06-24 21:10:48,553 WARN ]: Spent 322.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 50 [2018-06-24 21:10:49,083 WARN ]: Spent 470.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 68 [2018-06-24 21:10:49,554 WARN ]: Spent 381.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 60 [2018-06-24 21:10:49,556 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:49,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:49,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:49,562 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:10:49,639 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:10:49,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:49,643 INFO ]: Computing forward predicates... [2018-06-24 21:10:49,919 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:49,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:49,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-24 21:10:49,951 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:10:49,951 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:10:49,951 INFO ]: CoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:10:49,951 INFO ]: Start difference. First operand 159 states and 406 transitions. Second operand 22 states. [2018-06-24 21:10:50,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:50,255 INFO ]: Finished difference Result 179 states and 464 transitions. [2018-06-24 21:10:50,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:10:50,255 INFO ]: Start accepts. Automaton has 22 states. Word has length 14 [2018-06-24 21:10:50,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:50,256 INFO ]: With dead ends: 179 [2018-06-24 21:10:50,256 INFO ]: Without dead ends: 179 [2018-06-24 21:10:50,257 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:10:50,257 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-24 21:10:50,264 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 164. [2018-06-24 21:10:50,264 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-24 21:10:50,266 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 421 transitions. [2018-06-24 21:10:50,266 INFO ]: Start accepts. Automaton has 164 states and 421 transitions. Word has length 14 [2018-06-24 21:10:50,266 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:50,266 INFO ]: Abstraction has 164 states and 421 transitions. [2018-06-24 21:10:50,266 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:10:50,266 INFO ]: Start isEmpty. Operand 164 states and 421 transitions. [2018-06-24 21:10:50,267 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:10:50,267 INFO ]: Found error trace [2018-06-24 21:10:50,267 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:10:50,267 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:50,267 INFO ]: Analyzing trace with hash 1352075357, now seen corresponding path program 6 times [2018-06-24 21:10:50,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:50,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:50,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:50,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:50,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:50,294 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:51,021 INFO ]: Checked inductivity of 45 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:51,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:51,021 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:51,027 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:10:51,090 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 21:10:51,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:51,094 INFO ]: Computing forward predicates... [2018-06-24 21:10:51,323 INFO ]: Checked inductivity of 45 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:10:51,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:51,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 21:10:51,342 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:10:51,342 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:10:51,343 INFO ]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:10:51,343 INFO ]: Start difference. First operand 164 states and 421 transitions. Second operand 20 states. [2018-06-24 21:10:55,150 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2018-06-24 21:10:56,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:56,872 INFO ]: Finished difference Result 659 states and 1654 transitions. [2018-06-24 21:10:56,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-06-24 21:10:56,873 INFO ]: Start accepts. Automaton has 20 states. Word has length 14 [2018-06-24 21:10:56,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:56,876 INFO ]: With dead ends: 659 [2018-06-24 21:10:56,876 INFO ]: Without dead ends: 659 [2018-06-24 21:10:56,879 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1390, Invalid=9740, Unknown=0, NotChecked=0, Total=11130 [2018-06-24 21:10:56,879 INFO ]: Start minimizeSevpa. Operand 659 states. [2018-06-24 21:10:56,893 INFO ]: Finished minimizeSevpa. Reduced states from 659 to 340. [2018-06-24 21:10:56,894 INFO ]: Start removeUnreachable. Operand 340 states. [2018-06-24 21:10:56,896 INFO ]: Finished removeUnreachable. Reduced from 340 states to 340 states and 873 transitions. [2018-06-24 21:10:56,896 INFO ]: Start accepts. Automaton has 340 states and 873 transitions. Word has length 14 [2018-06-24 21:10:56,896 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:56,896 INFO ]: Abstraction has 340 states and 873 transitions. [2018-06-24 21:10:56,896 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:10:56,896 INFO ]: Start isEmpty. Operand 340 states and 873 transitions. [2018-06-24 21:10:56,897 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:10:56,898 INFO ]: Found error trace [2018-06-24 21:10:56,898 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-06-24 21:10:56,899 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:56,899 INFO ]: Analyzing trace with hash -583596603, now seen corresponding path program 5 times [2018-06-24 21:10:56,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:56,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:56,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:56,899 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:56,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:56,919 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:57,139 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:10:57,312 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:10:57,504 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 21:10:58,098 WARN ]: Spent 497.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-06-24 21:10:58,526 INFO ]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:58,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:10:58,526 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:10:58,532 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:10:58,589 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 21:10:58,589 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:10:58,593 INFO ]: Computing forward predicates... [2018-06-24 21:10:58,774 INFO ]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:10:58,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:10:58,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-24 21:10:58,794 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:10:58,795 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:10:58,795 INFO ]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:10:58,795 INFO ]: Start difference. First operand 340 states and 873 transitions. Second operand 16 states. [2018-06-24 21:10:59,398 WARN ]: Spent 316.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 24 [2018-06-24 21:10:59,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:10:59,552 INFO ]: Finished difference Result 528 states and 1349 transitions. [2018-06-24 21:10:59,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:10:59,552 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 21:10:59,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:10:59,555 INFO ]: With dead ends: 528 [2018-06-24 21:10:59,555 INFO ]: Without dead ends: 528 [2018-06-24 21:10:59,556 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:10:59,556 INFO ]: Start minimizeSevpa. Operand 528 states. [2018-06-24 21:10:59,568 INFO ]: Finished minimizeSevpa. Reduced states from 528 to 412. [2018-06-24 21:10:59,568 INFO ]: Start removeUnreachable. Operand 412 states. [2018-06-24 21:10:59,571 INFO ]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1054 transitions. [2018-06-24 21:10:59,571 INFO ]: Start accepts. Automaton has 412 states and 1054 transitions. Word has length 14 [2018-06-24 21:10:59,571 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:10:59,571 INFO ]: Abstraction has 412 states and 1054 transitions. [2018-06-24 21:10:59,571 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:10:59,571 INFO ]: Start isEmpty. Operand 412 states and 1054 transitions. [2018-06-24 21:10:59,575 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:10:59,575 INFO ]: Found error trace [2018-06-24 21:10:59,575 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 21:10:59,575 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:10:59,575 INFO ]: Analyzing trace with hash 323785319, now seen corresponding path program 10 times [2018-06-24 21:10:59,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:10:59,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:10:59,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,576 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:10:59,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:10:59,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:00,328 WARN ]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-24 21:11:00,879 WARN ]: Spent 473.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-06-24 21:11:01,301 WARN ]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2018-06-24 21:11:01,607 WARN ]: Spent 240.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2018-06-24 21:11:02,139 WARN ]: Spent 436.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 61 [2018-06-24 21:11:02,815 WARN ]: Spent 573.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 85 [2018-06-24 21:11:03,472 WARN ]: Spent 527.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 74 [2018-06-24 21:11:03,474 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:03,474 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:03,474 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:03,479 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:11:03,563 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:11:03,563 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:03,570 INFO ]: Computing forward predicates... [2018-06-24 21:11:03,923 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:03,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:03,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-24 21:11:03,942 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:11:03,942 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:11:03,943 INFO ]: CoverageRelationStatistics Valid=220, Invalid=332, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:11:03,943 INFO ]: Start difference. First operand 412 states and 1054 transitions. Second operand 24 states. [2018-06-24 21:11:04,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:04,004 INFO ]: Finished difference Result 471 states and 1231 transitions. [2018-06-24 21:11:04,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:11:04,005 INFO ]: Start accepts. Automaton has 24 states. Word has length 15 [2018-06-24 21:11:04,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:04,007 INFO ]: With dead ends: 471 [2018-06-24 21:11:04,008 INFO ]: Without dead ends: 471 [2018-06-24 21:11:04,008 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=220, Invalid=332, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:11:04,008 INFO ]: Start minimizeSevpa. Operand 471 states. [2018-06-24 21:11:04,019 INFO ]: Finished minimizeSevpa. Reduced states from 471 to 418. [2018-06-24 21:11:04,019 INFO ]: Start removeUnreachable. Operand 418 states. [2018-06-24 21:11:04,022 INFO ]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1072 transitions. [2018-06-24 21:11:04,023 INFO ]: Start accepts. Automaton has 418 states and 1072 transitions. Word has length 15 [2018-06-24 21:11:04,023 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:04,023 INFO ]: Abstraction has 418 states and 1072 transitions. [2018-06-24 21:11:04,023 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:11:04,023 INFO ]: Start isEmpty. Operand 418 states and 1072 transitions. [2018-06-24 21:11:04,026 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:11:04,026 INFO ]: Found error trace [2018-06-24 21:11:04,026 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:04,026 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:04,026 INFO ]: Analyzing trace with hash -1035407900, now seen corresponding path program 7 times [2018-06-24 21:11:04,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:04,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:04,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:04,027 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:04,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:04,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:04,948 INFO ]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:04,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:04,949 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:04,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:05,006 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:05,010 INFO ]: Computing forward predicates... [2018-06-24 21:11:05,030 INFO ]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:05,049 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:05,049 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 21:11:05,049 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:11:05,049 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:11:05,049 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:11:05,049 INFO ]: Start difference. First operand 418 states and 1072 transitions. Second operand 14 states. [2018-06-24 21:11:05,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:05,347 INFO ]: Finished difference Result 687 states and 1753 transitions. [2018-06-24 21:11:05,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:11:05,347 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 21:11:05,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:05,351 INFO ]: With dead ends: 687 [2018-06-24 21:11:05,351 INFO ]: Without dead ends: 601 [2018-06-24 21:11:05,351 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:11:05,352 INFO ]: Start minimizeSevpa. Operand 601 states. [2018-06-24 21:11:05,368 INFO ]: Finished minimizeSevpa. Reduced states from 601 to 509. [2018-06-24 21:11:05,368 INFO ]: Start removeUnreachable. Operand 509 states. [2018-06-24 21:11:05,370 INFO ]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1282 transitions. [2018-06-24 21:11:05,370 INFO ]: Start accepts. Automaton has 509 states and 1282 transitions. Word has length 15 [2018-06-24 21:11:05,370 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:05,370 INFO ]: Abstraction has 509 states and 1282 transitions. [2018-06-24 21:11:05,370 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:11:05,370 INFO ]: Start isEmpty. Operand 509 states and 1282 transitions. [2018-06-24 21:11:05,371 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:11:05,371 INFO ]: Found error trace [2018-06-24 21:11:05,371 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 21:11:05,372 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:05,372 INFO ]: Analyzing trace with hash 1447339290, now seen corresponding path program 11 times [2018-06-24 21:11:05,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:05,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:05,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:05,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:11:05,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:05,401 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:06,386 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-24 21:11:06,886 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2018-06-24 21:11:07,155 WARN ]: Spent 240.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2018-06-24 21:11:07,524 WARN ]: Spent 317.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2018-06-24 21:11:08,300 WARN ]: Spent 597.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 77 [2018-06-24 21:11:09,268 WARN ]: Spent 744.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 88 [2018-06-24 21:11:10,172 WARN ]: Spent 724.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 80 [2018-06-24 21:11:10,176 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:10,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:10,176 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:10,181 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:11:10,292 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:11:10,292 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:10,299 INFO ]: Computing forward predicates... [2018-06-24 21:11:11,008 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:11,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:11,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-24 21:11:11,027 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:11:11,028 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:11:11,028 INFO ]: CoverageRelationStatistics Valid=258, Invalid=392, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:11:11,028 INFO ]: Start difference. First operand 509 states and 1282 transitions. Second operand 26 states. [2018-06-24 21:11:11,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:11,206 INFO ]: Finished difference Result 523 states and 1316 transitions. [2018-06-24 21:11:11,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:11:11,207 INFO ]: Start accepts. Automaton has 26 states. Word has length 16 [2018-06-24 21:11:11,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:11,209 INFO ]: With dead ends: 523 [2018-06-24 21:11:11,209 INFO ]: Without dead ends: 523 [2018-06-24 21:11:11,210 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=258, Invalid=392, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:11:11,210 INFO ]: Start minimizeSevpa. Operand 523 states. [2018-06-24 21:11:11,224 INFO ]: Finished minimizeSevpa. Reduced states from 523 to 515. [2018-06-24 21:11:11,225 INFO ]: Start removeUnreachable. Operand 515 states. [2018-06-24 21:11:11,226 INFO ]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1300 transitions. [2018-06-24 21:11:11,226 INFO ]: Start accepts. Automaton has 515 states and 1300 transitions. Word has length 16 [2018-06-24 21:11:11,227 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:11,227 INFO ]: Abstraction has 515 states and 1300 transitions. [2018-06-24 21:11:11,227 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:11:11,227 INFO ]: Start isEmpty. Operand 515 states and 1300 transitions. [2018-06-24 21:11:11,228 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:11:11,228 INFO ]: Found error trace [2018-06-24 21:11:11,228 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:11:11,228 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:11,228 INFO ]: Analyzing trace with hash 87252341, now seen corresponding path program 8 times [2018-06-24 21:11:11,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:11,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:11,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:11,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:11,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:11,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:12,045 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-06-24 21:11:12,282 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-06-24 21:11:12,440 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-06-24 21:11:12,548 INFO ]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:12,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:12,548 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:12,554 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:11:12,613 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:11:12,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:12,617 INFO ]: Computing forward predicates... [2018-06-24 21:11:12,824 INFO ]: Checked inductivity of 66 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:11:12,843 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:12,843 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-06-24 21:11:12,843 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:11:12,843 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:11:12,843 INFO ]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:11:12,843 INFO ]: Start difference. First operand 515 states and 1300 transitions. Second operand 20 states. [2018-06-24 21:11:14,147 WARN ]: Spent 552.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-06-24 21:11:16,402 WARN ]: Spent 330.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-06-24 21:11:16,833 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-06-24 21:11:17,418 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-06-24 21:11:18,507 WARN ]: Spent 371.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-06-24 21:11:18,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:18,857 INFO ]: Finished difference Result 1167 states and 2799 transitions. [2018-06-24 21:11:18,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-06-24 21:11:18,857 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-24 21:11:18,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:18,862 INFO ]: With dead ends: 1167 [2018-06-24 21:11:18,862 INFO ]: Without dead ends: 921 [2018-06-24 21:11:18,864 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3019 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1238, Invalid=8268, Unknown=0, NotChecked=0, Total=9506 [2018-06-24 21:11:18,866 INFO ]: Start minimizeSevpa. Operand 921 states. [2018-06-24 21:11:18,886 INFO ]: Finished minimizeSevpa. Reduced states from 921 to 545. [2018-06-24 21:11:18,886 INFO ]: Start removeUnreachable. Operand 545 states. [2018-06-24 21:11:18,888 INFO ]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1344 transitions. [2018-06-24 21:11:18,888 INFO ]: Start accepts. Automaton has 545 states and 1344 transitions. Word has length 16 [2018-06-24 21:11:18,888 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:18,888 INFO ]: Abstraction has 545 states and 1344 transitions. [2018-06-24 21:11:18,888 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:11:18,888 INFO ]: Start isEmpty. Operand 545 states and 1344 transitions. [2018-06-24 21:11:18,889 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:11:18,889 INFO ]: Found error trace [2018-06-24 21:11:18,889 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-06-24 21:11:18,889 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:18,890 INFO ]: Analyzing trace with hash 1798443776, now seen corresponding path program 6 times [2018-06-24 21:11:18,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:18,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:18,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:18,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:18,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:18,908 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:19,347 WARN ]: Spent 314.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-06-24 21:11:19,505 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:11:19,933 WARN ]: Spent 354.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-06-24 21:11:20,449 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2018-06-24 21:11:20,588 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2018-06-24 21:11:20,768 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2018-06-24 21:11:20,770 INFO ]: Checked inductivity of 66 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:20,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:11:20,770 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:11:20,785 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:11:20,853 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:11:20,853 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:11:20,858 INFO ]: Computing forward predicates... [2018-06-24 21:11:21,076 INFO ]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:11:21,095 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:11:21,095 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-06-24 21:11:21,095 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:11:21,095 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:11:21,095 INFO ]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:11:21,095 INFO ]: Start difference. First operand 545 states and 1344 transitions. Second operand 18 states. [2018-06-24 21:11:21,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:11:21,510 INFO ]: Finished difference Result 759 states and 1829 transitions. [2018-06-24 21:11:21,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:11:21,510 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-24 21:11:21,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:11:21,514 INFO ]: With dead ends: 759 [2018-06-24 21:11:21,514 INFO ]: Without dead ends: 759 [2018-06-24 21:11:21,514 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:11:21,514 INFO ]: Start minimizeSevpa. Operand 759 states. [2018-06-24 21:11:21,532 INFO ]: Finished minimizeSevpa. Reduced states from 759 to 641. [2018-06-24 21:11:21,532 INFO ]: Start removeUnreachable. Operand 641 states. [2018-06-24 21:11:21,534 INFO ]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1571 transitions. [2018-06-24 21:11:21,534 INFO ]: Start accepts. Automaton has 641 states and 1571 transitions. Word has length 16 [2018-06-24 21:11:21,534 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:11:21,534 INFO ]: Abstraction has 641 states and 1571 transitions. [2018-06-24 21:11:21,534 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:11:21,534 INFO ]: Start isEmpty. Operand 641 states and 1571 transitions. [2018-06-24 21:11:21,536 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:11:21,536 INFO ]: Found error trace [2018-06-24 21:11:21,536 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 21:11:21,536 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:11:21,536 INFO ]: Analyzing trace with hash 1917774023, now seen corresponding path program 12 times [2018-06-24 21:11:21,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:11:21,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:11:21,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:21,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:11:21,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:11:21,553 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 21:11:22,974 WARN ]: Verification canceled [2018-06-24 21:11:22,976 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:11:22,977 WARN ]: Timeout [2018-06-24 21:11:22,977 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:11:22 BasicIcfg [2018-06-24 21:11:22,977 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:11:22,979 INFO ]: Toolchain (without parser) took 57135.74 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 824.2 MB). Free memory was 259.5 MB in the beginning and 994.3 MB in the end (delta: -734.8 MB). Peak memory consumption was 89.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:22,979 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:11:22,979 INFO ]: ChcToBoogie took 63.75 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 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:11:22,980 INFO ]: Boogie Preprocessor took 35.34 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 256.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 21:11:22,980 INFO ]: RCFGBuilder took 406.21 ms. Allocated memory is still 305.1 MB. Free memory was 256.5 MB in the beginning and 245.5 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:11:22,980 INFO ]: BlockEncodingV2 took 313.54 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 232.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:22,981 INFO ]: TraceAbstraction took 56307.87 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 824.2 MB). Free memory was 232.4 MB in the beginning and 994.3 MB in the end (delta: -761.9 MB). Peak memory consumption was 62.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:11:22,984 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 16 locations, 18 edges - StatisticsResult: Encoded RCFG 6 locations, 9 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.75 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.34 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 256.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 406.21 ms. Allocated memory is still 305.1 MB. Free memory was 256.5 MB in the beginning and 245.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 313.54 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 232.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56307.87 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 824.2 MB). Free memory was 232.4 MB in the beginning and 994.3 MB in the end (delta: -761.9 MB). Peak memory consumption was 62.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 16 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 56.2s OverallTime, 29 OverallIterations, 12 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 75 SDslu, 650 SDs, 0 SdLazy, 2663 SolverSat, 463 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 176 SyntacticMatches, 19 SemanticMatches, 541 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9100 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=28, 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.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 1198 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 583 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 138519 SizeOfPredicates, 1034 NumberOfNonLiveVariables, 9865 ConjunctsInSsa, 2155 ConjunctsInUnsatCore, 53 InterpolantComputations, 3 PerfectInterpolantSequences, 152/1392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-11-22-993.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-11-22-993.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-11-22-993.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-11-22-993.csv Completed graceful shutdown