java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:53:03,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:53:03,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:53:03,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:53:03,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:53:03,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:53:03,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:53:03,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:53:03,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:53:03,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:53:03,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:53:03,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:53:03,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:53:03,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:53:03,461 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:53:03,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:53:03,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:53:03,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:53:03,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:53:03,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:53:03,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:53:03,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:53:03,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:53:03,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:53:03,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:53:03,474 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:53:03,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:53:03,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:53:03,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:53:03,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:53:03,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:53:03,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:53:03,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:53:03,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:53:03,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:53:03,480 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:53:03,494 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:53:03,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:53:03,495 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:53:03,495 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:53:03,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:53:03,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:53:03,497 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:53:03,497 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:53:03,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:53:03,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:53:03,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:53:03,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:53:03,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:53:03,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:53:03,499 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:53:03,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:53:03,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:53:03,500 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:53:03,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:53:03,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:53:03,500 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:53:03,502 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:53:03,502 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:53:03,535 INFO ]: Repository-Root is: /tmp [2018-06-24 20:53:03,548 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:53:03,551 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:53:03,553 INFO ]: Initializing SmtParser... [2018-06-24 20:53:03,553 INFO ]: SmtParser initialized [2018-06-24 20:53:03,554 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-24 20:53:03,555 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 20:53:03,645 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 unknown [2018-06-24 20:53:03,847 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-24 20:53:03,853 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:53:03,859 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:53:03,859 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:53:03,859 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:53:03,860 INFO ]: ChcToBoogie initialized [2018-06-24 20:53:03,862 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,913 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03 Unit [2018-06-24 20:53:03,913 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:53:03,914 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:53:03,914 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:53:03,914 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:53:03,929 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,929 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,934 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,934 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,937 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,938 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,939 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (1/1) ... [2018-06-24 20:53:03,942 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:53:03,942 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:53:03,942 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:53:03,942 INFO ]: RCFGBuilder initialized [2018-06-24 20:53:03,943 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:53:03,957 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:53:03,958 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:53:03,958 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:53:03,958 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:53:03,958 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:53:03,958 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:53:04,206 INFO ]: Using library mode [2018-06-24 20:53:04,207 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:53:04 BoogieIcfgContainer [2018-06-24 20:53:04,207 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:53:04,207 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:53:04,207 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:53:04,208 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:53:04,209 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:53:04" (1/1) ... [2018-06-24 20:53:04,224 INFO ]: Initial Icfg 14 locations, 16 edges [2018-06-24 20:53:04,225 INFO ]: Using Remove infeasible edges [2018-06-24 20:53:04,229 INFO ]: Using Maximize final states [2018-06-24 20:53:04,230 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:53:04,230 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:53:04,232 INFO ]: Using Remove sink states [2018-06-24 20:53:04,232 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:53:04,232 INFO ]: Using Use SBE [2018-06-24 20:53:04,242 INFO ]: SBE split 0 edges [2018-06-24 20:53:04,252 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:53:04,254 INFO ]: 0 new accepting states [2018-06-24 20:53:04,302 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-24 20:53:04,304 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:53:04,318 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:53:04,318 INFO ]: 0 new accepting states [2018-06-24 20:53:04,318 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:53:04,318 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:53:04,319 INFO ]: Encoded RCFG 8 locations, 10 edges [2018-06-24 20:53:04,319 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:53:04 BasicIcfg [2018-06-24 20:53:04,319 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:53:04,320 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:53:04,320 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:53:04,326 INFO ]: TraceAbstraction initialized [2018-06-24 20:53:04,326 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:53:03" (1/4) ... [2018-06-24 20:53:04,327 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322e0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:53:04, skipping insertion in model container [2018-06-24 20:53:04,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:53:03" (2/4) ... [2018-06-24 20:53:04,327 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322e0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:53:04, skipping insertion in model container [2018-06-24 20:53:04,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:53:04" (3/4) ... [2018-06-24 20:53:04,327 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322e0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:53:04, skipping insertion in model container [2018-06-24 20:53:04,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:53:04" (4/4) ... [2018-06-24 20:53:04,328 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:53:04,338 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:53:04,346 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:53:04,380 INFO ]: Using default assertion order modulation [2018-06-24 20:53:04,381 INFO ]: Interprodecural is true [2018-06-24 20:53:04,381 INFO ]: Hoare is false [2018-06-24 20:53:04,381 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:53:04,381 INFO ]: Backedges is TWOTRACK [2018-06-24 20:53:04,381 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:53:04,381 INFO ]: Difference is false [2018-06-24 20:53:04,381 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:53:04,381 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:53:04,391 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 20:53:04,400 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:53:04,400 INFO ]: Found error trace [2018-06-24 20:53:04,401 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:04,401 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:04,406 INFO ]: Analyzing trace with hash -1173083044, now seen corresponding path program 1 times [2018-06-24 20:53:04,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:04,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:04,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:04,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:04,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:04,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:04,574 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:04,576 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:53:04,576 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:53:04,578 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:53:04,589 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:53:04,590 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:53:04,591 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-24 20:53:04,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:04,725 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-24 20:53:04,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:53:04,727 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:53:04,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:04,738 INFO ]: With dead ends: 13 [2018-06-24 20:53:04,738 INFO ]: Without dead ends: 13 [2018-06-24 20:53:04,740 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:53:04,753 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:53:04,780 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:53:04,784 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:53:04,785 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-24 20:53:04,786 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-06-24 20:53:04,786 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:04,786 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-24 20:53:04,786 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:53:04,786 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-24 20:53:04,787 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:53:04,787 INFO ]: Found error trace [2018-06-24 20:53:04,787 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:04,788 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:04,788 INFO ]: Analyzing trace with hash -2007083269, now seen corresponding path program 1 times [2018-06-24 20:53:04,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:04,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:04,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:04,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:04,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:04,814 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:05,161 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:05,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:05,162 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 20:53:05,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:05,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:05,226 INFO ]: Computing forward predicates... [2018-06-24 20:53:05,565 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:05,586 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:53:05,586 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-24 20:53:05,586 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:53:05,586 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:53:05,586 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:53:05,587 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 9 states. [2018-06-24 20:53:05,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:05,787 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-24 20:53:05,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:53:05,787 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 20:53:05,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:05,787 INFO ]: With dead ends: 12 [2018-06-24 20:53:05,787 INFO ]: Without dead ends: 9 [2018-06-24 20:53:05,788 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:53:05,788 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:53:05,790 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:53:05,790 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:53:05,790 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 20:53:05,790 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-24 20:53:05,790 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:05,790 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 20:53:05,790 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:53:05,790 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 20:53:05,790 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:53:05,790 INFO ]: Found error trace [2018-06-24 20:53:05,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:05,791 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:05,791 INFO ]: Analyzing trace with hash -1980301160, now seen corresponding path program 1 times [2018-06-24 20:53:05,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:05,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:05,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:05,792 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:05,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:05,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:05,853 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:05,853 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:53:05,853 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:53:05,853 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:53:05,854 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:53:05,854 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:53:05,854 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-24 20:53:05,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:05,936 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-24 20:53:05,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:53:05,937 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:53:05,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:05,937 INFO ]: With dead ends: 11 [2018-06-24 20:53:05,937 INFO ]: Without dead ends: 10 [2018-06-24 20:53:05,937 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:53:05,937 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:53:05,938 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:53:05,939 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:53:05,939 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:53:05,939 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-24 20:53:05,939 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:05,939 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:53:05,939 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:53:05,939 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:53:05,939 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:53:05,939 INFO ]: Found error trace [2018-06-24 20:53:05,939 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:05,939 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:05,940 INFO ]: Analyzing trace with hash -1261041089, now seen corresponding path program 1 times [2018-06-24 20:53:05,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:05,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:05,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:05,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:05,940 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:05,953 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:06,053 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:06,053 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:53:06,053 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:53:06,053 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:53:06,053 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:53:06,053 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:53:06,054 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-24 20:53:06,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:06,185 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-24 20:53:06,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:53:06,188 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:53:06,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:06,189 INFO ]: With dead ends: 11 [2018-06-24 20:53:06,189 INFO ]: Without dead ends: 11 [2018-06-24 20:53:06,189 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:53:06,189 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:53:06,190 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:53:06,190 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:53:06,191 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 20:53:06,191 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-24 20:53:06,191 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:06,191 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 20:53:06,191 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:53:06,191 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 20:53:06,191 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:53:06,191 INFO ]: Found error trace [2018-06-24 20:53:06,191 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:06,191 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:06,192 INFO ]: Analyzing trace with hash -437802474, now seen corresponding path program 1 times [2018-06-24 20:53:06,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:06,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:06,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:06,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:06,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:06,212 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:06,416 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:06,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:06,416 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:53:06,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:06,464 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:06,467 INFO ]: Computing forward predicates... [2018-06-24 20:53:06,921 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:06,941 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:06,941 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-24 20:53:06,942 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:53:06,942 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:53:06,942 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:53:06,942 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-24 20:53:07,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:07,060 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-24 20:53:07,060 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:53:07,060 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-24 20:53:07,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:07,061 INFO ]: With dead ends: 18 [2018-06-24 20:53:07,061 INFO ]: Without dead ends: 18 [2018-06-24 20:53:07,061 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:53:07,061 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:53:07,062 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 20:53:07,062 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:53:07,063 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-24 20:53:07,063 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-24 20:53:07,063 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:07,063 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-24 20:53:07,063 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:53:07,063 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-24 20:53:07,063 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:53:07,063 INFO ]: Found error trace [2018-06-24 20:53:07,063 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:07,063 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:07,063 INFO ]: Analyzing trace with hash -718608899, now seen corresponding path program 2 times [2018-06-24 20:53:07,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:07,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:07,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:07,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:07,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:07,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:07,214 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:07,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:07,214 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 20:53:07,220 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:07,243 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:07,243 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:07,245 INFO ]: Computing forward predicates... [2018-06-24 20:53:07,330 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:07,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:07,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-24 20:53:07,356 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:53:07,356 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:53:07,356 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:53:07,356 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2018-06-24 20:53:08,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:08,022 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-24 20:53:08,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:53:08,022 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:53:08,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:08,023 INFO ]: With dead ends: 23 [2018-06-24 20:53:08,023 INFO ]: Without dead ends: 17 [2018-06-24 20:53:08,023 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:53:08,023 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:53:08,025 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-24 20:53:08,025 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:53:08,025 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-24 20:53:08,025 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-24 20:53:08,025 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:08,025 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-24 20:53:08,025 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:53:08,025 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-24 20:53:08,026 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:53:08,026 INFO ]: Found error trace [2018-06-24 20:53:08,026 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:08,026 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:08,026 INFO ]: Analyzing trace with hash -750805926, now seen corresponding path program 3 times [2018-06-24 20:53:08,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:08,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:08,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,027 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:08,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,117 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:08,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:08,117 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 20:53:08,123 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:08,152 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:53:08,152 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,155 INFO ]: Computing forward predicates... [2018-06-24 20:53:08,192 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:53:08,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:08,211 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:53:08,211 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:53:08,211 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:53:08,211 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:53:08,211 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2018-06-24 20:53:08,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:08,257 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:53:08,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:53:08,258 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:53:08,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:08,258 INFO ]: With dead ends: 16 [2018-06-24 20:53:08,258 INFO ]: Without dead ends: 16 [2018-06-24 20:53:08,259 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:53:08,259 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:53:08,260 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 20:53:08,260 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:53:08,261 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 20:53:08,261 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-24 20:53:08,261 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:08,261 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 20:53:08,261 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:53:08,261 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 20:53:08,261 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:53:08,261 INFO ]: Found error trace [2018-06-24 20:53:08,261 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:08,261 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:08,261 INFO ]: Analyzing trace with hash -1800381605, now seen corresponding path program 4 times [2018-06-24 20:53:08,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:08,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:08,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,263 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:08,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,277 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,336 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:08,336 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:08,336 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 20:53:08,345 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:08,374 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:08,374 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,376 INFO ]: Computing forward predicates... [2018-06-24 20:53:08,431 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:08,451 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:08,451 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 20:53:08,451 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:53:08,451 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:53:08,451 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:53:08,451 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 11 states. [2018-06-24 20:53:08,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:08,505 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-24 20:53:08,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:53:08,506 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:53:08,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:08,506 INFO ]: With dead ends: 17 [2018-06-24 20:53:08,506 INFO ]: Without dead ends: 14 [2018-06-24 20:53:08,506 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:53:08,507 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:53:08,508 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:53:08,508 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:53:08,508 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:53:08,508 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-24 20:53:08,508 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:08,508 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:53:08,508 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:53:08,508 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:53:08,509 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:53:08,509 INFO ]: Found error trace [2018-06-24 20:53:08,509 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:08,509 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:08,509 INFO ]: Analyzing trace with hash -950880420, now seen corresponding path program 5 times [2018-06-24 20:53:08,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:08,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:08,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:08,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:08,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,651 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:08,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:08,651 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 20:53:08,660 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:08,704 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:08,704 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:08,707 INFO ]: Computing forward predicates... [2018-06-24 20:53:09,168 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:09,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:09,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 20:53:09,199 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:53:09,199 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:53:09,199 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:53:09,200 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 15 states. [2018-06-24 20:53:09,478 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 20:53:09,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:09,523 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-24 20:53:09,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:53:09,528 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:53:09,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:09,528 INFO ]: With dead ends: 23 [2018-06-24 20:53:09,528 INFO ]: Without dead ends: 23 [2018-06-24 20:53:09,529 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:53:09,529 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:53:09,531 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-24 20:53:09,531 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:53:09,531 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-24 20:53:09,531 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2018-06-24 20:53:09,531 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:09,531 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-24 20:53:09,531 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:53:09,531 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-24 20:53:09,532 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:53:09,532 INFO ]: Found error trace [2018-06-24 20:53:09,532 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:09,532 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:09,532 INFO ]: Analyzing trace with hash -386147461, now seen corresponding path program 6 times [2018-06-24 20:53:09,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:09,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:09,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:09,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:09,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:09,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:09,737 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:09,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:09,737 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 20:53:09,744 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:09,776 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:53:09,776 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:09,778 INFO ]: Computing forward predicates... [2018-06-24 20:53:10,022 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:10,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:10,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-24 20:53:10,041 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:53:10,041 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:53:10,042 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:53:10,042 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. [2018-06-24 20:53:10,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:10,506 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-24 20:53:10,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:53:10,506 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:53:10,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:10,507 INFO ]: With dead ends: 29 [2018-06-24 20:53:10,507 INFO ]: Without dead ends: 21 [2018-06-24 20:53:10,507 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:53:10,507 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:53:10,509 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-24 20:53:10,509 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:53:10,509 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-24 20:53:10,509 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-24 20:53:10,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:10,510 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-24 20:53:10,510 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:53:10,510 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-24 20:53:10,510 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:53:10,510 INFO ]: Found error trace [2018-06-24 20:53:10,510 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:10,510 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:10,510 INFO ]: Analyzing trace with hash -1262719336, now seen corresponding path program 7 times [2018-06-24 20:53:10,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:10,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:10,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:10,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:10,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:10,520 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:10,575 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:10,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:10,575 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 20:53:10,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:10,612 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:10,617 INFO ]: Computing forward predicates... [2018-06-24 20:53:10,710 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:53:10,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:10,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:53:10,730 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:53:10,730 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:53:10,730 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:53:10,730 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 13 states. [2018-06-24 20:53:10,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:10,786 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-24 20:53:10,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:53:10,787 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:53:10,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:10,787 INFO ]: With dead ends: 20 [2018-06-24 20:53:10,787 INFO ]: Without dead ends: 20 [2018-06-24 20:53:10,787 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:53:10,787 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:53:10,789 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-24 20:53:10,789 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:53:10,789 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:53:10,789 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-06-24 20:53:10,789 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:10,789 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:53:10,789 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:53:10,789 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:53:10,790 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:53:10,790 INFO ]: Found error trace [2018-06-24 20:53:10,790 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:10,790 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:10,790 INFO ]: Analyzing trace with hash -489828131, now seen corresponding path program 8 times [2018-06-24 20:53:10,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:10,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:10,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:10,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:10,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:10,801 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:10,887 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:10,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:10,887 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 20:53:10,893 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:10,913 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:10,913 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:10,914 INFO ]: Computing forward predicates... [2018-06-24 20:53:11,023 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:11,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:11,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 20:53:11,042 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:53:11,042 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:53:11,042 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:53:11,043 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2018-06-24 20:53:11,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:11,311 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-24 20:53:11,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:53:11,312 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-24 20:53:11,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:11,312 INFO ]: With dead ends: 21 [2018-06-24 20:53:11,312 INFO ]: Without dead ends: 17 [2018-06-24 20:53:11,312 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:53:11,313 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:53:11,314 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:53:11,314 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:53:11,314 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-24 20:53:11,314 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-24 20:53:11,314 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:11,314 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-24 20:53:11,314 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:53:11,314 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-24 20:53:11,315 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:53:11,315 INFO ]: Found error trace [2018-06-24 20:53:11,315 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:11,315 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:11,315 INFO ]: Analyzing trace with hash 1884608662, now seen corresponding path program 9 times [2018-06-24 20:53:11,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:11,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:11,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:11,316 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:11,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:11,337 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:11,521 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:11,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:11,521 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 20:53:11,529 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:11,571 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:53:11,571 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:11,574 INFO ]: Computing forward predicates... [2018-06-24 20:53:11,831 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:11,858 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:11,858 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-24 20:53:11,858 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:53:11,858 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:53:11,859 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:53:11,859 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 19 states. [2018-06-24 20:53:12,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:12,087 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-24 20:53:12,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:53:12,087 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-24 20:53:12,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:12,088 INFO ]: With dead ends: 28 [2018-06-24 20:53:12,088 INFO ]: Without dead ends: 28 [2018-06-24 20:53:12,088 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:53:12,088 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:53:12,090 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-24 20:53:12,090 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:53:12,091 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-24 20:53:12,091 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-24 20:53:12,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:12,091 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-24 20:53:12,091 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:53:12,091 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-24 20:53:12,091 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:53:12,091 INFO ]: Found error trace [2018-06-24 20:53:12,091 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:12,091 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:12,091 INFO ]: Analyzing trace with hash -1817262083, now seen corresponding path program 10 times [2018-06-24 20:53:12,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:12,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:12,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:12,092 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:12,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:12,104 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:12,365 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:12,366 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:12,366 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 20:53:12,372 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:12,393 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:12,393 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:12,395 INFO ]: Computing forward predicates... [2018-06-24 20:53:12,483 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:12,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:12,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-24 20:53:12,515 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:53:12,515 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:53:12,515 INFO ]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:53:12,515 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 19 states. [2018-06-24 20:53:12,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:12,932 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-24 20:53:12,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:53:12,932 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-24 20:53:12,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:12,933 INFO ]: With dead ends: 27 [2018-06-24 20:53:12,933 INFO ]: Without dead ends: 18 [2018-06-24 20:53:12,933 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:53:12,933 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:53:12,934 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:53:12,934 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:53:12,935 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:53:12,935 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2018-06-24 20:53:12,935 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:12,935 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:53:12,935 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:53:12,935 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:53:12,935 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:53:12,935 INFO ]: Found error trace [2018-06-24 20:53:12,935 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:12,935 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:12,936 INFO ]: Analyzing trace with hash 1905723354, now seen corresponding path program 11 times [2018-06-24 20:53:12,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:12,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:12,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:12,936 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:12,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:12,946 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:13,062 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:13,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:13,062 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 20:53:13,068 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:13,091 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:53:13,091 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:13,093 INFO ]: Computing forward predicates... [2018-06-24 20:53:13,148 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:53:13,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:13,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 20:53:13,169 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:53:13,169 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:53:13,169 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:53:13,169 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-24 20:53:13,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:13,265 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-24 20:53:13,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:53:13,266 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 20:53:13,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:13,266 INFO ]: With dead ends: 19 [2018-06-24 20:53:13,266 INFO ]: Without dead ends: 19 [2018-06-24 20:53:13,267 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:53:13,267 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:53:13,268 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:53:13,268 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:53:13,268 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-24 20:53:13,268 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2018-06-24 20:53:13,268 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:13,268 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-24 20:53:13,268 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:53:13,268 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-24 20:53:13,269 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:53:13,269 INFO ]: Found error trace [2018-06-24 20:53:13,269 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:13,269 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:13,269 INFO ]: Analyzing trace with hash -1052352549, now seen corresponding path program 12 times [2018-06-24 20:53:13,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:13,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:13,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:13,270 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:13,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:13,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:13,855 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:13,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:13,855 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 20:53:13,860 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:13,884 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:53:13,884 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:13,886 INFO ]: Computing forward predicates... [2018-06-24 20:53:14,016 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:14,039 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:14,039 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-24 20:53:14,039 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:53:14,040 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:53:14,040 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:53:14,040 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 20 states. [2018-06-24 20:53:14,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:14,234 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-24 20:53:14,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:53:14,236 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-24 20:53:14,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:14,236 INFO ]: With dead ends: 25 [2018-06-24 20:53:14,236 INFO ]: Without dead ends: 20 [2018-06-24 20:53:14,236 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:53:14,236 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:53:14,237 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:53:14,237 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:53:14,238 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:53:14,238 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-06-24 20:53:14,238 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:14,238 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:53:14,238 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:53:14,238 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:53:14,238 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:53:14,238 INFO ]: Found error trace [2018-06-24 20:53:14,238 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:14,238 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:14,239 INFO ]: Analyzing trace with hash -1684401572, now seen corresponding path program 13 times [2018-06-24 20:53:14,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:14,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:14,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:14,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:14,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:14,256 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:14,463 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:14,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:14,463 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 20:53:14,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:14,506 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:14,509 INFO ]: Computing forward predicates... [2018-06-24 20:53:14,772 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:14,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:14,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-24 20:53:14,791 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:53:14,791 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:53:14,791 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:53:14,791 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-24 20:53:15,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:15,020 INFO ]: Finished difference Result 33 states and 38 transitions. [2018-06-24 20:53:15,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:53:15,020 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-24 20:53:15,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:15,020 INFO ]: With dead ends: 33 [2018-06-24 20:53:15,020 INFO ]: Without dead ends: 33 [2018-06-24 20:53:15,021 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:53:15,021 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:53:15,022 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-24 20:53:15,022 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:53:15,023 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-24 20:53:15,023 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2018-06-24 20:53:15,023 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:15,023 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-24 20:53:15,023 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:53:15,023 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-24 20:53:15,023 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:53:15,023 INFO ]: Found error trace [2018-06-24 20:53:15,023 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:15,024 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:15,024 INFO ]: Analyzing trace with hash 196915195, now seen corresponding path program 14 times [2018-06-24 20:53:15,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:15,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:15,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:15,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:15,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:15,035 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:15,845 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:15,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:15,845 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 20:53:15,861 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:15,891 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:15,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:15,893 INFO ]: Computing forward predicates... [2018-06-24 20:53:16,164 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:16,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:16,185 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-24 20:53:16,185 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:53:16,185 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:53:16,185 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:53:16,186 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 24 states. [2018-06-24 20:53:16,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:16,809 INFO ]: Finished difference Result 41 states and 47 transitions. [2018-06-24 20:53:16,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:53:16,810 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-24 20:53:16,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:16,810 INFO ]: With dead ends: 41 [2018-06-24 20:53:16,810 INFO ]: Without dead ends: 29 [2018-06-24 20:53:16,811 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:16,811 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:53:16,812 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-24 20:53:16,812 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:53:16,813 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-24 20:53:16,813 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-24 20:53:16,813 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:16,813 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-24 20:53:16,813 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:53:16,813 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-24 20:53:16,813 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:53:16,813 INFO ]: Found error trace [2018-06-24 20:53:16,813 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:16,813 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:16,814 INFO ]: Analyzing trace with hash 278162584, now seen corresponding path program 15 times [2018-06-24 20:53:16,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:16,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:16,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:16,814 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:16,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:16,824 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:17,014 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:17,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:17,014 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 20:53:17,028 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:17,057 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:53:17,057 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:17,059 INFO ]: Computing forward predicates... [2018-06-24 20:53:17,139 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:53:17,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:17,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-24 20:53:17,169 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:53:17,169 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:53:17,169 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:53:17,169 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2018-06-24 20:53:17,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:17,563 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-24 20:53:17,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:53:17,563 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-24 20:53:17,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:17,563 INFO ]: With dead ends: 29 [2018-06-24 20:53:17,563 INFO ]: Without dead ends: 23 [2018-06-24 20:53:17,563 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:53:17,563 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:53:17,564 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:53:17,564 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:53:17,565 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-24 20:53:17,565 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-24 20:53:17,565 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:17,565 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-24 20:53:17,565 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:53:17,565 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-24 20:53:17,565 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:53:17,565 INFO ]: Found error trace [2018-06-24 20:53:17,565 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:17,565 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:17,565 INFO ]: Analyzing trace with hash -1952286954, now seen corresponding path program 16 times [2018-06-24 20:53:17,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:17,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:17,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:17,566 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:17,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:17,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:18,019 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:18,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:18,020 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 20:53:18,026 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:18,061 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:18,061 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:18,068 INFO ]: Computing forward predicates... [2018-06-24 20:53:18,589 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:18,609 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:18,609 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-06-24 20:53:18,609 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:53:18,609 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:53:18,609 INFO ]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:53:18,609 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 27 states. [2018-06-24 20:53:19,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:19,368 INFO ]: Finished difference Result 38 states and 43 transitions. [2018-06-24 20:53:19,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:53:19,368 INFO ]: Start accepts. Automaton has 27 states. Word has length 22 [2018-06-24 20:53:19,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:19,369 INFO ]: With dead ends: 38 [2018-06-24 20:53:19,369 INFO ]: Without dead ends: 38 [2018-06-24 20:53:19,369 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:53:19,369 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:53:19,371 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 25. [2018-06-24 20:53:19,371 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:53:19,371 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-06-24 20:53:19,371 INFO ]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2018-06-24 20:53:19,371 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:19,371 INFO ]: Abstraction has 25 states and 28 transitions. [2018-06-24 20:53:19,372 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:53:19,372 INFO ]: Start isEmpty. Operand 25 states and 28 transitions. [2018-06-24 20:53:19,372 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:53:19,372 INFO ]: Found error trace [2018-06-24 20:53:19,372 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:19,372 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:19,372 INFO ]: Analyzing trace with hash 932321789, now seen corresponding path program 17 times [2018-06-24 20:53:19,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:19,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:19,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:19,373 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:19,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:19,385 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:19,689 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:19,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:19,689 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 20:53:19,701 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:19,735 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:53:19,735 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:19,737 INFO ]: Computing forward predicates... [2018-06-24 20:53:19,906 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:19,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:19,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-24 20:53:19,926 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:53:19,926 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:53:19,926 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:53:19,926 INFO ]: Start difference. First operand 25 states and 28 transitions. Second operand 25 states. [2018-06-24 20:53:20,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:20,053 INFO ]: Finished difference Result 37 states and 41 transitions. [2018-06-24 20:53:20,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:53:20,055 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-24 20:53:20,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:20,055 INFO ]: With dead ends: 37 [2018-06-24 20:53:20,055 INFO ]: Without dead ends: 24 [2018-06-24 20:53:20,055 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:53:20,056 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:53:20,057 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:53:20,057 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:53:20,057 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:53:20,057 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2018-06-24 20:53:20,057 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:20,057 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:53:20,057 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:53:20,057 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:53:20,058 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:53:20,058 INFO ]: Found error trace [2018-06-24 20:53:20,058 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:20,058 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:20,058 INFO ]: Analyzing trace with hash 1701651290, now seen corresponding path program 18 times [2018-06-24 20:53:20,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:20,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:20,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:20,059 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:20,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:20,069 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:20,211 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:20,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:20,211 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 20:53:20,216 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:20,248 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:53:20,248 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:20,251 INFO ]: Computing forward predicates... [2018-06-24 20:53:20,348 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:53:20,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:20,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-24 20:53:20,368 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:53:20,368 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:53:20,368 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:53:20,368 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2018-06-24 20:53:20,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:20,727 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-24 20:53:20,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:53:20,728 INFO ]: Start accepts. Automaton has 23 states. Word has length 23 [2018-06-24 20:53:20,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:20,728 INFO ]: With dead ends: 33 [2018-06-24 20:53:20,728 INFO ]: Without dead ends: 26 [2018-06-24 20:53:20,729 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:20,729 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:53:20,731 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:53:20,731 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:53:20,731 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:53:20,731 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-24 20:53:20,731 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:20,731 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:53:20,731 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:53:20,731 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:53:20,733 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:53:20,733 INFO ]: Found error trace [2018-06-24 20:53:20,733 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:20,733 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:20,733 INFO ]: Analyzing trace with hash 1283341660, now seen corresponding path program 19 times [2018-06-24 20:53:20,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:20,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:20,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:20,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:20,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:20,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:21,145 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:21,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:21,145 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 20:53:21,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:21,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:21,189 INFO ]: Computing forward predicates... [2018-06-24 20:53:21,618 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:21,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:21,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-06-24 20:53:21,637 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:53:21,637 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:53:21,637 INFO ]: CoverageRelationStatistics Valid=66, Invalid=864, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:53:21,637 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 31 states. [2018-06-24 20:53:22,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:22,079 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-24 20:53:22,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:53:22,080 INFO ]: Start accepts. Automaton has 31 states. Word has length 25 [2018-06-24 20:53:22,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:22,081 INFO ]: With dead ends: 43 [2018-06-24 20:53:22,081 INFO ]: Without dead ends: 43 [2018-06-24 20:53:22,081 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:53:22,081 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:53:22,083 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-06-24 20:53:22,083 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:53:22,083 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-24 20:53:22,083 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2018-06-24 20:53:22,083 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:22,083 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-24 20:53:22,083 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:53:22,084 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-24 20:53:22,084 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:53:22,084 INFO ]: Found error trace [2018-06-24 20:53:22,084 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:22,084 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:22,084 INFO ]: Analyzing trace with hash -779824005, now seen corresponding path program 20 times [2018-06-24 20:53:22,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:22,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:22,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:22,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:22,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:22,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:22,414 INFO ]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:22,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:22,414 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 20:53:22,420 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:22,460 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:22,460 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:22,463 INFO ]: Computing forward predicates... [2018-06-24 20:53:22,651 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:22,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:22,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-24 20:53:22,670 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:53:22,670 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:53:22,671 INFO ]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:53:22,671 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 32 states. [2018-06-24 20:53:23,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:23,365 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-24 20:53:23,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:53:23,365 INFO ]: Start accepts. Automaton has 32 states. Word has length 26 [2018-06-24 20:53:23,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:23,366 INFO ]: With dead ends: 53 [2018-06-24 20:53:23,366 INFO ]: Without dead ends: 37 [2018-06-24 20:53:23,366 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=772, Invalid=2420, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 20:53:23,366 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:53:23,368 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-24 20:53:23,368 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:53:23,368 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-24 20:53:23,368 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-24 20:53:23,369 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:23,369 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-24 20:53:23,369 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:53:23,369 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-24 20:53:23,369 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:53:23,369 INFO ]: Found error trace [2018-06-24 20:53:23,369 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:23,369 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:23,369 INFO ]: Analyzing trace with hash -188548456, now seen corresponding path program 21 times [2018-06-24 20:53:23,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:23,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:23,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:23,370 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:23,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:23,382 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:24,199 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:24,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:24,199 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 20:53:24,208 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:24,254 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:53:24,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:24,257 INFO ]: Computing forward predicates... [2018-06-24 20:53:24,897 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:53:24,916 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:24,916 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-24 20:53:24,916 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:53:24,916 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:53:24,916 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:53:24,916 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 25 states. [2018-06-24 20:53:25,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:25,122 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-24 20:53:25,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:53:25,123 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:53:25,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:25,123 INFO ]: With dead ends: 36 [2018-06-24 20:53:25,123 INFO ]: Without dead ends: 36 [2018-06-24 20:53:25,123 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:53:25,123 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:53:25,124 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-24 20:53:25,124 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:53:25,125 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:53:25,125 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-06-24 20:53:25,125 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:25,125 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:53:25,125 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:53:25,125 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:53:25,125 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:53:25,125 INFO ]: Found error trace [2018-06-24 20:53:25,125 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:25,125 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:25,125 INFO ]: Analyzing trace with hash -1550269219, now seen corresponding path program 22 times [2018-06-24 20:53:25,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:25,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:25,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:25,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:25,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:25,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:25,852 INFO ]: Checked inductivity of 77 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:25,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:25,875 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 20:53:25,881 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:25,916 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:25,916 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:25,919 INFO ]: Computing forward predicates... [2018-06-24 20:53:26,048 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:26,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:26,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-24 20:53:26,069 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:53:26,069 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:53:26,069 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:53:26,069 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-24 20:53:26,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:26,190 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-24 20:53:26,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:53:26,191 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:53:26,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:26,191 INFO ]: With dead ends: 37 [2018-06-24 20:53:26,191 INFO ]: Without dead ends: 29 [2018-06-24 20:53:26,191 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:53:26,191 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:53:26,193 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:53:26,193 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:53:26,194 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:53:26,194 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-24 20:53:26,194 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:26,194 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:53:26,194 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:53:26,194 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:53:26,195 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:53:26,195 INFO ]: Found error trace [2018-06-24 20:53:26,195 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:26,195 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:26,195 INFO ]: Analyzing trace with hash 152864150, now seen corresponding path program 23 times [2018-06-24 20:53:26,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:26,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:26,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:26,196 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:26,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:26,215 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:26,469 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:26,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:26,469 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 20:53:26,475 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:26,575 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:53:26,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:26,583 INFO ]: Computing forward predicates... [2018-06-24 20:53:27,740 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:27,759 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:27,759 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-06-24 20:53:27,759 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:53:27,759 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:53:27,760 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1115, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:53:27,760 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 35 states. [2018-06-24 20:53:28,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:28,253 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-24 20:53:28,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:53:28,254 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-24 20:53:28,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:28,254 INFO ]: With dead ends: 48 [2018-06-24 20:53:28,254 INFO ]: Without dead ends: 48 [2018-06-24 20:53:28,255 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:28,255 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:53:28,257 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-06-24 20:53:28,257 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:53:28,257 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-06-24 20:53:28,257 INFO ]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2018-06-24 20:53:28,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:28,257 INFO ]: Abstraction has 31 states and 34 transitions. [2018-06-24 20:53:28,257 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:53:28,257 INFO ]: Start isEmpty. Operand 31 states and 34 transitions. [2018-06-24 20:53:28,258 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:53:28,258 INFO ]: Found error trace [2018-06-24 20:53:28,258 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:28,258 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:28,258 INFO ]: Analyzing trace with hash 1410391037, now seen corresponding path program 24 times [2018-06-24 20:53:28,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:28,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:28,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:28,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:28,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:28,271 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:29,140 INFO ]: Checked inductivity of 92 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:29,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:29,140 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:29,147 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:29,186 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:53:29,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:29,188 INFO ]: Computing forward predicates... [2018-06-24 20:53:29,421 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:29,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:29,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-24 20:53:29,440 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:53:29,440 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:53:29,440 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:53:29,440 INFO ]: Start difference. First operand 31 states and 34 transitions. Second operand 36 states. [2018-06-24 20:53:30,123 WARN ]: Spent 366.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-24 20:53:30,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:30,676 INFO ]: Finished difference Result 59 states and 65 transitions. [2018-06-24 20:53:30,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:53:30,676 INFO ]: Start accepts. Automaton has 36 states. Word has length 29 [2018-06-24 20:53:30,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:30,676 INFO ]: With dead ends: 59 [2018-06-24 20:53:30,676 INFO ]: Without dead ends: 41 [2018-06-24 20:53:30,677 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 20:53:30,677 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:53:30,678 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-24 20:53:30,678 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:53:30,678 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-24 20:53:30,678 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-24 20:53:30,678 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:30,678 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-24 20:53:30,678 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:53:30,678 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-24 20:53:30,680 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:53:30,680 INFO ]: Found error trace [2018-06-24 20:53:30,680 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:30,680 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:30,680 INFO ]: Analyzing trace with hash -1604456742, now seen corresponding path program 25 times [2018-06-24 20:53:30,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:30,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:30,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:30,681 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:30,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:30,692 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:30,907 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:30,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:30,926 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:30,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:30,973 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:30,975 INFO ]: Computing forward predicates... [2018-06-24 20:53:31,434 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:53:31,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:31,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-24 20:53:31,454 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:53:31,454 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:53:31,454 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:53:31,454 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 28 states. [2018-06-24 20:53:31,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:31,617 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-24 20:53:31,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:53:31,620 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 20:53:31,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:31,621 INFO ]: With dead ends: 40 [2018-06-24 20:53:31,621 INFO ]: Without dead ends: 40 [2018-06-24 20:53:31,621 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:53:31,621 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:53:31,622 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-06-24 20:53:31,622 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:53:31,622 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-24 20:53:31,622 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2018-06-24 20:53:31,622 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:31,623 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-24 20:53:31,623 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:53:31,623 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-24 20:53:31,623 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:53:31,623 INFO ]: Found error trace [2018-06-24 20:53:31,623 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:31,623 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:31,623 INFO ]: Analyzing trace with hash 1801214171, now seen corresponding path program 26 times [2018-06-24 20:53:31,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:31,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:31,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:31,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:31,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:31,637 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:31,947 INFO ]: Checked inductivity of 100 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:31,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:31,947 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:31,953 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:31,994 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:31,994 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:31,996 INFO ]: Computing forward predicates... [2018-06-24 20:53:32,395 INFO ]: Checked inductivity of 100 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:32,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:32,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-24 20:53:32,415 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:53:32,415 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:53:32,415 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:53:32,415 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 36 states. [2018-06-24 20:53:33,064 WARN ]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-24 20:53:33,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:33,250 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-24 20:53:33,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:53:33,250 INFO ]: Start accepts. Automaton has 36 states. Word has length 30 [2018-06-24 20:53:33,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:33,250 INFO ]: With dead ends: 41 [2018-06-24 20:53:33,250 INFO ]: Without dead ends: 32 [2018-06-24 20:53:33,251 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:53:33,251 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:53:33,252 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:53:33,252 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:53:33,252 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:53:33,252 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-24 20:53:33,252 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:33,252 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:53:33,252 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:53:33,252 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:53:33,253 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:53:33,253 INFO ]: Found error trace [2018-06-24 20:53:33,253 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:33,253 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:33,253 INFO ]: Analyzing trace with hash -91015076, now seen corresponding path program 27 times [2018-06-24 20:53:33,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:33,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:33,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:33,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:33,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:33,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:33,576 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:33,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:33,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:33,582 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:33,628 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:53:33,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:33,642 INFO ]: Computing forward predicates... [2018-06-24 20:53:34,751 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:53:34,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:34,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 48 [2018-06-24 20:53:34,772 INFO ]: Interpolant automaton has 48 states [2018-06-24 20:53:34,772 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 20:53:34,773 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2154, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:53:34,773 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 48 states. [2018-06-24 20:53:36,064 WARN ]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-06-24 20:53:37,015 WARN ]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-06-24 20:53:37,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:37,830 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-24 20:53:37,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:53:37,830 INFO ]: Start accepts. Automaton has 48 states. Word has length 31 [2018-06-24 20:53:37,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:37,831 INFO ]: With dead ends: 63 [2018-06-24 20:53:37,831 INFO ]: Without dead ends: 53 [2018-06-24 20:53:37,832 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=471, Invalid=4221, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 20:53:37,832 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:53:37,833 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-06-24 20:53:37,833 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:53:37,834 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-24 20:53:37,834 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2018-06-24 20:53:37,834 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:37,834 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-24 20:53:37,834 INFO ]: Interpolant automaton has 48 states. [2018-06-24 20:53:37,834 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-24 20:53:37,834 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:53:37,834 INFO ]: Found error trace [2018-06-24 20:53:37,834 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:37,834 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:37,834 INFO ]: Analyzing trace with hash 1379420411, now seen corresponding path program 28 times [2018-06-24 20:53:37,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:37,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:37,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:37,836 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:37,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:37,860 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:38,549 INFO ]: Checked inductivity of 117 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:38,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:38,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:38,554 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:38,592 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:38,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:38,596 INFO ]: Computing forward predicates... [2018-06-24 20:53:38,851 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:38,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:38,870 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-24 20:53:38,870 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:53:38,870 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:53:38,870 INFO ]: CoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:53:38,870 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 34 states. [2018-06-24 20:53:39,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:39,048 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-24 20:53:39,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:53:39,048 INFO ]: Start accepts. Automaton has 34 states. Word has length 32 [2018-06-24 20:53:39,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:39,048 INFO ]: With dead ends: 52 [2018-06-24 20:53:39,048 INFO ]: Without dead ends: 33 [2018-06-24 20:53:39,049 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=470, Invalid=1510, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:53:39,049 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:53:39,051 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:53:39,051 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:53:39,051 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-24 20:53:39,051 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 32 [2018-06-24 20:53:39,051 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:39,051 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-24 20:53:39,051 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:53:39,051 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-24 20:53:39,051 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:53:39,051 INFO ]: Found error trace [2018-06-24 20:53:39,051 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:39,052 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:39,052 INFO ]: Analyzing trace with hash -1081337704, now seen corresponding path program 29 times [2018-06-24 20:53:39,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:39,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:39,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:39,052 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:39,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:39,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:39,391 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:39,391 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:39,391 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:39,397 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:39,441 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:53:39,441 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:39,445 INFO ]: Computing forward predicates... [2018-06-24 20:53:39,616 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:53:39,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:39,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 20:53:39,635 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:53:39,635 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:53:39,636 INFO ]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:53:39,636 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 31 states. [2018-06-24 20:53:39,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:39,824 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-24 20:53:39,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:53:39,825 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 20:53:39,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:39,825 INFO ]: With dead ends: 34 [2018-06-24 20:53:39,825 INFO ]: Without dead ends: 34 [2018-06-24 20:53:39,826 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:53:39,826 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:53:39,827 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:53:39,827 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:53:39,827 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:53:39,827 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2018-06-24 20:53:39,827 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:39,827 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:53:39,827 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:53:39,827 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:53:39,828 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:53:39,828 INFO ]: Found error trace [2018-06-24 20:53:39,828 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:39,828 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:39,828 INFO ]: Analyzing trace with hash 838035165, now seen corresponding path program 30 times [2018-06-24 20:53:39,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:39,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:39,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:39,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:39,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:39,839 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:40,132 INFO ]: Checked inductivity of 126 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:40,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:40,133 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:40,138 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:40,181 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:53:40,181 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:40,184 INFO ]: Computing forward predicates... [2018-06-24 20:53:40,462 INFO ]: Checked inductivity of 126 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:40,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:40,481 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-24 20:53:40,481 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:53:40,481 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:53:40,481 INFO ]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:53:40,481 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 40 states. [2018-06-24 20:53:41,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:41,067 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-24 20:53:41,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:53:41,067 INFO ]: Start accepts. Automaton has 40 states. Word has length 33 [2018-06-24 20:53:41,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:41,068 INFO ]: With dead ends: 45 [2018-06-24 20:53:41,068 INFO ]: Without dead ends: 35 [2018-06-24 20:53:41,068 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=807, Invalid=2733, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:53:41,068 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:53:41,070 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:53:41,070 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:53:41,070 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-24 20:53:41,070 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-24 20:53:41,070 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:41,070 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-24 20:53:41,070 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:53:41,070 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-24 20:53:41,070 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:53:41,070 INFO ]: Found error trace [2018-06-24 20:53:41,070 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:41,070 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:41,070 INFO ]: Analyzing trace with hash 1594819606, now seen corresponding path program 31 times [2018-06-24 20:53:41,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:41,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:41,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:41,071 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:41,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:41,088 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:41,668 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:41,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:41,668 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:41,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:41,723 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:41,728 INFO ]: Computing forward predicates... [2018-06-24 20:53:42,453 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:42,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:42,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-06-24 20:53:42,472 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:53:42,472 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:53:42,472 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1713, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:53:42,472 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 43 states. [2018-06-24 20:53:43,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:43,222 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-24 20:53:43,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:53:43,222 INFO ]: Start accepts. Automaton has 43 states. Word has length 34 [2018-06-24 20:53:43,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:43,222 INFO ]: With dead ends: 58 [2018-06-24 20:53:43,222 INFO ]: Without dead ends: 58 [2018-06-24 20:53:43,222 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:53:43,222 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:53:43,224 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-06-24 20:53:43,224 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:53:43,224 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-24 20:53:43,224 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-06-24 20:53:43,224 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:43,224 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-24 20:53:43,224 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:53:43,224 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-24 20:53:43,225 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:53:43,225 INFO ]: Found error trace [2018-06-24 20:53:43,225 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:43,225 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:43,225 INFO ]: Analyzing trace with hash -714666499, now seen corresponding path program 32 times [2018-06-24 20:53:43,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:43,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:43,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:43,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:43,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:43,239 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:43,540 INFO ]: Checked inductivity of 145 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:43,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:43,540 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:43,545 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:43,603 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:43,603 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:43,605 INFO ]: Computing forward predicates... [2018-06-24 20:53:44,001 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:44,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:44,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-06-24 20:53:44,020 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:53:44,020 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:53:44,020 INFO ]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:53:44,020 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 44 states. [2018-06-24 20:53:45,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:45,398 INFO ]: Finished difference Result 71 states and 77 transitions. [2018-06-24 20:53:45,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-24 20:53:45,398 INFO ]: Start accepts. Automaton has 44 states. Word has length 35 [2018-06-24 20:53:45,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:45,399 INFO ]: With dead ends: 71 [2018-06-24 20:53:45,399 INFO ]: Without dead ends: 49 [2018-06-24 20:53:45,399 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1423, Invalid=4583, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 20:53:45,399 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:53:45,401 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-06-24 20:53:45,401 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:53:45,401 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-24 20:53:45,401 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-24 20:53:45,401 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:45,401 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-24 20:53:45,401 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:53:45,401 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-24 20:53:45,401 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:53:45,401 INFO ]: Found error trace [2018-06-24 20:53:45,401 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:45,401 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:45,401 INFO ]: Analyzing trace with hash 1023765082, now seen corresponding path program 33 times [2018-06-24 20:53:45,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:45,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:45,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:45,402 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:45,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:45,411 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:46,753 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:46,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:46,753 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:46,758 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:46,806 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:53:46,806 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:46,809 INFO ]: Computing forward predicates... [2018-06-24 20:53:46,999 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:53:47,018 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:47,018 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-24 20:53:47,018 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:53:47,018 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:53:47,018 INFO ]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:53:47,018 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 35 states. [2018-06-24 20:53:47,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:47,706 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-24 20:53:47,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 20:53:47,706 INFO ]: Start accepts. Automaton has 35 states. Word has length 35 [2018-06-24 20:53:47,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:47,707 INFO ]: With dead ends: 49 [2018-06-24 20:53:47,707 INFO ]: Without dead ends: 38 [2018-06-24 20:53:47,707 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1278, Invalid=3144, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 20:53:47,707 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:53:47,708 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:53:47,708 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:53:47,708 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:53:47,708 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-24 20:53:47,708 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:47,708 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:53:47,708 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:53:47,708 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:53:47,709 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:53:47,709 INFO ]: Found error trace [2018-06-24 20:53:47,709 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:47,709 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:47,709 INFO ]: Analyzing trace with hash 292356956, now seen corresponding path program 34 times [2018-06-24 20:53:47,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:47,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:47,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:47,709 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:47,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:47,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:48,282 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:48,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:48,282 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:48,288 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:53:48,335 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:53:48,335 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:48,340 INFO ]: Computing forward predicates... [2018-06-24 20:53:49,214 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:49,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:49,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-06-24 20:53:49,233 INFO ]: Interpolant automaton has 47 states [2018-06-24 20:53:49,233 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-24 20:53:49,233 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2060, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:53:49,234 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 47 states. [2018-06-24 20:53:50,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:50,107 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-24 20:53:50,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:53:50,107 INFO ]: Start accepts. Automaton has 47 states. Word has length 37 [2018-06-24 20:53:50,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:50,108 INFO ]: With dead ends: 63 [2018-06-24 20:53:50,108 INFO ]: Without dead ends: 63 [2018-06-24 20:53:50,108 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:53:50,108 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-24 20:53:50,109 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 40. [2018-06-24 20:53:50,109 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:53:50,109 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-24 20:53:50,109 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2018-06-24 20:53:50,109 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:50,109 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-24 20:53:50,109 INFO ]: Interpolant automaton has 47 states. [2018-06-24 20:53:50,109 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-24 20:53:50,110 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:53:50,110 INFO ]: Found error trace [2018-06-24 20:53:50,110 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:50,110 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:50,110 INFO ]: Analyzing trace with hash 482020731, now seen corresponding path program 35 times [2018-06-24 20:53:50,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:50,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:50,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:50,110 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:50,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:50,123 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:50,404 INFO ]: Checked inductivity of 176 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:50,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:50,404 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:50,409 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:53:50,463 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:53:50,463 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:50,468 INFO ]: Computing forward predicates... [2018-06-24 20:53:50,872 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:50,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:50,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-24 20:53:50,892 INFO ]: Interpolant automaton has 48 states [2018-06-24 20:53:50,892 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 20:53:50,893 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:53:50,893 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 48 states. [2018-06-24 20:53:52,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:52,174 INFO ]: Finished difference Result 77 states and 83 transitions. [2018-06-24 20:53:52,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-24 20:53:52,175 INFO ]: Start accepts. Automaton has 48 states. Word has length 38 [2018-06-24 20:53:52,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:52,175 INFO ]: With dead ends: 77 [2018-06-24 20:53:52,175 INFO ]: Without dead ends: 53 [2018-06-24 20:53:52,176 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1684, Invalid=5456, Unknown=0, NotChecked=0, Total=7140 [2018-06-24 20:53:52,176 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:53:52,176 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-24 20:53:52,176 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:53:52,177 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-24 20:53:52,177 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-24 20:53:52,177 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:52,177 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-24 20:53:52,177 INFO ]: Interpolant automaton has 48 states. [2018-06-24 20:53:52,177 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-24 20:53:52,177 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:53:52,177 INFO ]: Found error trace [2018-06-24 20:53:52,177 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:52,177 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:52,177 INFO ]: Analyzing trace with hash 372491928, now seen corresponding path program 36 times [2018-06-24 20:53:52,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:52,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:52,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:52,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:52,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:52,189 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:52,508 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:52,508 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:52,508 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:52,514 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:53:52,563 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:53:52,563 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:52,567 INFO ]: Computing forward predicates... [2018-06-24 20:53:52,780 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:53:52,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:52,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-24 20:53:52,799 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:53:52,799 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:53:52,799 INFO ]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:53:52,799 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 38 states. [2018-06-24 20:53:53,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:53,514 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-24 20:53:53,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-24 20:53:53,515 INFO ]: Start accepts. Automaton has 38 states. Word has length 38 [2018-06-24 20:53:53,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:53,515 INFO ]: With dead ends: 53 [2018-06-24 20:53:53,515 INFO ]: Without dead ends: 41 [2018-06-24 20:53:53,515 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1514, Invalid=3742, Unknown=0, NotChecked=0, Total=5256 [2018-06-24 20:53:53,515 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:53:53,516 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:53:53,516 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:53:53,517 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-24 20:53:53,517 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-24 20:53:53,517 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:53,517 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-24 20:53:53,517 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:53:53,517 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-24 20:53:53,517 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:53:53,517 INFO ]: Found error trace [2018-06-24 20:53:53,517 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:53,517 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:53,517 INFO ]: Analyzing trace with hash 1757803158, now seen corresponding path program 37 times [2018-06-24 20:53:53,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:53,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:53,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:53,518 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:53,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:53,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:54,489 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:54,489 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:54,489 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:54,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:54,547 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:54,553 INFO ]: Computing forward predicates... [2018-06-24 20:53:55,494 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:55,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:55,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-06-24 20:53:55,516 INFO ]: Interpolant automaton has 51 states [2018-06-24 20:53:55,516 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-24 20:53:55,517 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2439, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:53:55,517 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 51 states. [2018-06-24 20:53:56,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:56,473 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-24 20:53:56,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:53:56,474 INFO ]: Start accepts. Automaton has 51 states. Word has length 40 [2018-06-24 20:53:56,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:56,474 INFO ]: With dead ends: 68 [2018-06-24 20:53:56,474 INFO ]: Without dead ends: 68 [2018-06-24 20:53:56,474 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:53:56,474 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-24 20:53:56,475 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 43. [2018-06-24 20:53:56,475 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:53:56,475 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-06-24 20:53:56,475 INFO ]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-06-24 20:53:56,475 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:56,475 INFO ]: Abstraction has 43 states and 46 transitions. [2018-06-24 20:53:56,475 INFO ]: Interpolant automaton has 51 states. [2018-06-24 20:53:56,476 INFO ]: Start isEmpty. Operand 43 states and 46 transitions. [2018-06-24 20:53:56,476 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:53:56,476 INFO ]: Found error trace [2018-06-24 20:53:56,476 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:56,476 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:56,476 INFO ]: Analyzing trace with hash -1060065283, now seen corresponding path program 38 times [2018-06-24 20:53:56,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:56,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:56,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:56,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:53:56,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:56,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:56,861 INFO ]: Checked inductivity of 210 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:56,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:56,861 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:56,867 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:53:56,934 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:53:56,934 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:56,939 INFO ]: Computing forward predicates... [2018-06-24 20:53:57,464 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:57,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:53:57,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-06-24 20:53:57,486 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:53:57,487 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:53:57,487 INFO ]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:53:57,487 INFO ]: Start difference. First operand 43 states and 46 transitions. Second operand 52 states. [2018-06-24 20:53:59,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:53:59,035 INFO ]: Finished difference Result 83 states and 89 transitions. [2018-06-24 20:53:59,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 20:53:59,035 INFO ]: Start accepts. Automaton has 52 states. Word has length 41 [2018-06-24 20:53:59,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:53:59,035 INFO ]: With dead ends: 83 [2018-06-24 20:53:59,035 INFO ]: Without dead ends: 57 [2018-06-24 20:53:59,036 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1967, Invalid=6405, Unknown=0, NotChecked=0, Total=8372 [2018-06-24 20:53:59,036 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:53:59,037 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-24 20:53:59,037 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:53:59,037 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-24 20:53:59,037 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-24 20:53:59,037 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:53:59,037 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-24 20:53:59,037 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:53:59,037 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-24 20:53:59,038 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 20:53:59,038 INFO ]: Found error trace [2018-06-24 20:53:59,038 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:53:59,038 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:53:59,038 INFO ]: Analyzing trace with hash 1056937434, now seen corresponding path program 39 times [2018-06-24 20:53:59,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:53:59,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:53:59,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,038 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:53:59,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:53:59,049 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:59,721 INFO ]: Checked inductivity of 210 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:53:59,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:53:59,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:53:59,727 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:53:59,786 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:53:59,786 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:53:59,790 INFO ]: Computing forward predicates... [2018-06-24 20:54:00,056 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:54:00,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:00,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-24 20:54:00,075 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:54:00,075 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:54:00,075 INFO ]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:54:00,075 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 41 states. [2018-06-24 20:54:00,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:00,891 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-24 20:54:00,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-24 20:54:00,892 INFO ]: Start accepts. Automaton has 41 states. Word has length 41 [2018-06-24 20:54:00,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:00,892 INFO ]: With dead ends: 57 [2018-06-24 20:54:00,892 INFO ]: Without dead ends: 44 [2018-06-24 20:54:00,893 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=4392, Unknown=0, NotChecked=0, Total=6162 [2018-06-24 20:54:00,893 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 20:54:00,893 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-24 20:54:00,893 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:54:00,894 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-24 20:54:00,894 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-24 20:54:00,894 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:00,894 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-24 20:54:00,894 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:54:00,894 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-24 20:54:00,894 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 20:54:00,894 INFO ]: Found error trace [2018-06-24 20:54:00,894 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:00,894 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:00,894 INFO ]: Analyzing trace with hash -2019582372, now seen corresponding path program 40 times [2018-06-24 20:54:00,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:00,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:00,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:00,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:54:00,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:00,914 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:02,046 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-24 20:54:02,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:02,046 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:02,052 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:54:02,108 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:54:02,108 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:02,114 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-24 20:54:02,516 INFO ]: Timeout while computing interpolants [2018-06-24 20:54:02,717 WARN ]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:02,717 WARN ]: Verification canceled [2018-06-24 20:54:02,718 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:54:02,719 WARN ]: Timeout [2018-06-24 20:54:02,720 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:54:02 BasicIcfg [2018-06-24 20:54:02,720 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:54:02,720 INFO ]: Toolchain (without parser) took 58867.40 ms. Allocated memory was 307.2 MB in the beginning and 782.2 MB in the end (delta: 475.0 MB). Free memory was 263.8 MB in the beginning and 736.9 MB in the end (delta: -473.2 MB). Peak memory consumption was 435.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:02,722 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:54:02,722 INFO ]: ChcToBoogie took 54.38 ms. Allocated memory is still 307.2 MB. Free memory was 262.8 MB in the beginning and 260.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:02,723 INFO ]: Boogie Preprocessor took 27.67 ms. Allocated memory is still 307.2 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-24 20:54:02,723 INFO ]: RCFGBuilder took 264.65 ms. Allocated memory is still 307.2 MB. Free memory was 259.7 MB in the beginning and 250.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:02,723 INFO ]: BlockEncodingV2 took 111.88 ms. Allocated memory is still 307.2 MB. Free memory was 250.6 MB in the beginning and 247.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:02,724 INFO ]: TraceAbstraction took 58399.63 ms. Allocated memory was 307.2 MB in the beginning and 782.2 MB in the end (delta: 475.0 MB). Free memory was 247.7 MB in the beginning and 736.9 MB in the end (delta: -489.3 MB). Peak memory consumption was 419.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:54:02,729 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 16 edges - StatisticsResult: Encoded RCFG 8 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.38 ms. Allocated memory is still 307.2 MB. Free memory was 262.8 MB in the beginning and 260.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 27.67 ms. Allocated memory is still 307.2 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 264.65 ms. Allocated memory is still 307.2 MB. Free memory was 259.7 MB in the beginning and 250.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 111.88 ms. Allocated memory is still 307.2 MB. Free memory was 250.6 MB in the beginning and 247.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58399.63 ms. Allocated memory was 307.2 MB in the beginning and 782.2 MB in the end (delta: 475.0 MB). Free memory was 247.7 MB in the beginning and 736.9 MB in the end (delta: -489.3 MB). Peak memory consumption was 419.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 44 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 58.3s OverallTime, 44 OverallIterations, 12 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 917 SDslu, 3828 SDs, 0 SdLazy, 10687 SolverSat, 1871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2438 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 1634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14046 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=42, 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.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 258 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 2004 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 1921 ConstructedInterpolants, 75 QuantifiedInterpolants, 312519 SizeOfPredicates, 271 NumberOfNonLiveVariables, 12674 ConjunctsInSsa, 2916 ConjunctsInUnsatCore, 83 InterpolantComputations, 4 PerfectInterpolantSequences, 3412/6163 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/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-54-02-739.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-54-02-739.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-54-02-739.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-54-02-739.csv Completed graceful shutdown