java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.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/loop_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:13:38,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:13:38,446 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:13:38,459 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:13:38,459 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:13:38,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:13:38,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:13:38,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:13:38,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:13:38,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:13:38,469 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:13:38,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:13:38,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:13:38,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:13:38,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:13:38,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:13:38,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:13:38,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:13:38,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:13:38,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:13:38,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:13:38,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:13:38,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:13:38,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:13:38,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:13:38,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:13:38,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:13:38,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:13:38,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:13:38,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:13:38,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:13:38,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:13:38,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:13:38,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:13:38,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:13:38,506 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:13:38,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:13:38,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:13:38,528 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:13:38,529 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:13:38,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:13:38,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:13:38,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:13:38,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:13:38,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:13:38,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:13:38,531 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:13:38,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:13:38,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:13:38,531 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:13:38,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:13:38,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:13:38,534 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:13:38,536 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:13:38,536 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:13:38,584 INFO ]: Repository-Root is: /tmp [2018-06-22 01:13:38,597 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:13:38,601 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:13:38,603 INFO ]: Initializing SmtParser... [2018-06-22 01:13:38,603 INFO ]: SmtParser initialized [2018-06-22 01:13:38,604 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 [2018-06-22 01:13:38,605 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-22 01:13:38,692 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 unknown [2018-06-22 01:13:38,825 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 [2018-06-22 01:13:38,829 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:13:38,837 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:13:38,837 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:13:38,837 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:13:38,837 INFO ]: ChcToBoogie initialized [2018-06-22 01:13:38,843 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,894 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38 Unit [2018-06-22 01:13:38,894 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:13:38,895 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:13:38,895 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:13:38,895 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:13:38,920 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,920 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,927 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,927 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,930 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,933 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,934 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... [2018-06-22 01:13:38,936 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:13:38,936 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:13:38,936 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:13:38,936 INFO ]: RCFGBuilder initialized [2018-06-22 01:13:38,937 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:13:38,951 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:13:38,951 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:13:38,951 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:13:38,952 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:13:38,952 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:13:38,952 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:13:39,322 INFO ]: Using library mode [2018-06-22 01:13:39,322 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:13:39 BoogieIcfgContainer [2018-06-22 01:13:39,322 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:13:39,323 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:13:39,323 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:13:39,326 INFO ]: TraceAbstraction initialized [2018-06-22 01:13:39,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:13:38" (1/3) ... [2018-06-22 01:13:39,327 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e09afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:13:39, skipping insertion in model container [2018-06-22 01:13:39,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:38" (2/3) ... [2018-06-22 01:13:39,328 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e09afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:13:39, skipping insertion in model container [2018-06-22 01:13:39,328 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:13:39" (3/3) ... [2018-06-22 01:13:39,329 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:13:39,340 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:13:39,348 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:13:39,391 INFO ]: Using default assertion order modulation [2018-06-22 01:13:39,391 INFO ]: Interprodecural is true [2018-06-22 01:13:39,391 INFO ]: Hoare is false [2018-06-22 01:13:39,391 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:13:39,391 INFO ]: Backedges is TWOTRACK [2018-06-22 01:13:39,392 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:13:39,392 INFO ]: Difference is false [2018-06-22 01:13:39,392 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:13:39,392 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:13:39,409 INFO ]: Start isEmpty. Operand 14 states. [2018-06-22 01:13:39,421 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:13:39,421 INFO ]: Found error trace [2018-06-22 01:13:39,421 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:39,421 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:39,425 INFO ]: Analyzing trace with hash 249545043, now seen corresponding path program 1 times [2018-06-22 01:13:39,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:39,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:39,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:39,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:39,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:39,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:39,610 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:39,612 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:39,612 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:13:39,613 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:13:39,623 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:13:39,623 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:13:39,625 INFO ]: Start difference. First operand 14 states. Second operand 4 states. [2018-06-22 01:13:39,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:39,751 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-22 01:13:39,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:13:39,753 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:13:39,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:39,759 INFO ]: With dead ends: 14 [2018-06-22 01:13:39,759 INFO ]: Without dead ends: 12 [2018-06-22 01:13:39,761 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-22 01:13:39,779 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:13:39,804 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:13:39,805 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:13:39,805 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-06-22 01:13:39,806 INFO ]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 8 [2018-06-22 01:13:39,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:39,806 INFO ]: Abstraction has 12 states and 15 transitions. [2018-06-22 01:13:39,806 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:13:39,806 INFO ]: Start isEmpty. Operand 12 states and 15 transitions. [2018-06-22 01:13:39,807 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:13:39,807 INFO ]: Found error trace [2018-06-22 01:13:39,807 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:39,807 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:39,807 INFO ]: Analyzing trace with hash -542490762, now seen corresponding path program 1 times [2018-06-22 01:13:39,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:39,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:39,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:39,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:39,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:39,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:39,879 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:39,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:39,879 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:39,880 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:39,880 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:39,881 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:39,881 INFO ]: Start difference. First operand 12 states and 15 transitions. Second operand 5 states. [2018-06-22 01:13:40,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:40,175 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-22 01:13:40,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:40,176 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:13:40,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:40,179 INFO ]: With dead ends: 25 [2018-06-22 01:13:40,179 INFO ]: Without dead ends: 24 [2018-06-22 01:13:40,184 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:40,184 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:13:40,189 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 13. [2018-06-22 01:13:40,189 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:13:40,189 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-22 01:13:40,189 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2018-06-22 01:13:40,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:40,190 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-22 01:13:40,190 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:40,190 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-22 01:13:40,190 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:13:40,190 INFO ]: Found error trace [2018-06-22 01:13:40,190 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:40,190 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:40,190 INFO ]: Analyzing trace with hash 1031517897, now seen corresponding path program 1 times [2018-06-22 01:13:40,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:40,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:40,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:40,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,212 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:40,340 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:40,340 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:40,340 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:13:40,340 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:13:40,341 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:13:40,341 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:13:40,341 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-06-22 01:13:40,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:40,399 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-22 01:13:40,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:13:40,399 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:13:40,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:40,400 INFO ]: With dead ends: 19 [2018-06-22 01:13:40,400 INFO ]: Without dead ends: 18 [2018-06-22 01:13:40,400 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:40,400 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:13:40,402 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-22 01:13:40,402 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:13:40,402 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-22 01:13:40,402 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-06-22 01:13:40,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:40,403 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-22 01:13:40,403 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:13:40,403 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-22 01:13:40,403 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:13:40,403 INFO ]: Found error trace [2018-06-22 01:13:40,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:40,403 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:40,403 INFO ]: Analyzing trace with hash 422410701, now seen corresponding path program 1 times [2018-06-22 01:13:40,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:40,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:40,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:40,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:40,463 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:40,463 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:40,463 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:40,463 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:40,463 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:40,463 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:40,463 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-06-22 01:13:40,606 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 01:13:40,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:40,633 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-22 01:13:40,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:40,633 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:13:40,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:40,634 INFO ]: With dead ends: 16 [2018-06-22 01:13:40,634 INFO ]: Without dead ends: 14 [2018-06-22 01:13:40,634 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:40,634 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:13:40,636 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-22 01:13:40,636 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:13:40,636 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-22 01:13:40,637 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-06-22 01:13:40,637 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:40,637 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-22 01:13:40,637 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:40,637 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-22 01:13:40,637 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:13:40,637 INFO ]: Found error trace [2018-06-22 01:13:40,637 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:40,637 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:40,637 INFO ]: Analyzing trace with hash 1972038874, now seen corresponding path program 1 times [2018-06-22 01:13:40,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:40,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:40,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:40,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:40,777 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:40,778 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:40,778 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:40,778 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:40,778 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:40,778 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:40,778 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-06-22 01:13:40,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:40,918 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-22 01:13:40,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:40,921 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:13:40,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:40,921 INFO ]: With dead ends: 17 [2018-06-22 01:13:40,921 INFO ]: Without dead ends: 16 [2018-06-22 01:13:40,921 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:40,922 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:13:40,923 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-22 01:13:40,923 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:13:40,923 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 01:13:40,923 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2018-06-22 01:13:40,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:40,924 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 01:13:40,924 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:40,924 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 01:13:40,926 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:13:40,926 INFO ]: Found error trace [2018-06-22 01:13:40,927 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:40,927 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:40,927 INFO ]: Analyzing trace with hash -465369124, now seen corresponding path program 1 times [2018-06-22 01:13:40,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:40,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:40,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:40,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:40,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:41,057 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:41,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:41,057 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-22 01:13:41,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:41,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:41,107 INFO ]: Computing forward predicates... [2018-06-22 01:13:41,412 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:41,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:41,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:13:41,446 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:13:41,446 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:13:41,447 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:13:41,447 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-06-22 01:13:41,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:41,703 INFO ]: Finished difference Result 30 states and 36 transitions. [2018-06-22 01:13:41,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:13:41,704 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:13:41,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:41,705 INFO ]: With dead ends: 30 [2018-06-22 01:13:41,705 INFO ]: Without dead ends: 29 [2018-06-22 01:13:41,705 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:13:41,705 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:13:41,707 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-06-22 01:13:41,707 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:13:41,708 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-22 01:13:41,708 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2018-06-22 01:13:41,708 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:41,708 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-22 01:13:41,708 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:13:41,708 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-22 01:13:41,708 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:13:41,708 INFO ]: Found error trace [2018-06-22 01:13:41,709 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:41,709 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:41,709 INFO ]: Analyzing trace with hash -1626346583, now seen corresponding path program 1 times [2018-06-22 01:13:41,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:41,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:41,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:41,710 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:41,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:41,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:41,788 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:41,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:41,789 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:41,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:41,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:41,824 INFO ]: Computing forward predicates... [2018-06-22 01:13:41,899 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:41,918 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:13:41,918 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-06-22 01:13:41,919 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:13:41,919 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:13:41,919 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:13:41,919 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 10 states. [2018-06-22 01:13:42,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:42,136 INFO ]: Finished difference Result 25 states and 29 transitions. [2018-06-22 01:13:42,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:13:42,137 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-22 01:13:42,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:42,137 INFO ]: With dead ends: 25 [2018-06-22 01:13:42,137 INFO ]: Without dead ends: 24 [2018-06-22 01:13:42,138 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:13:42,138 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:13:42,140 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-06-22 01:13:42,140 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:13:42,140 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:13:42,140 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-22 01:13:42,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:42,141 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:13:42,141 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:13:42,141 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:13:42,141 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:42,141 INFO ]: Found error trace [2018-06-22 01:13:42,141 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:42,141 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:42,141 INFO ]: Analyzing trace with hash -1481785817, now seen corresponding path program 1 times [2018-06-22 01:13:42,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:42,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:42,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:42,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:42,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:42,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:42,270 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:42,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:42,270 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-22 01:13:42,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:42,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:42,297 INFO ]: Computing forward predicates... [2018-06-22 01:13:42,384 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:42,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:42,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 01:13:42,403 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:13:42,403 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:13:42,403 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:13:42,404 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-06-22 01:13:42,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:42,492 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-22 01:13:42,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:13:42,492 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-22 01:13:42,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:42,493 INFO ]: With dead ends: 22 [2018-06-22 01:13:42,493 INFO ]: Without dead ends: 19 [2018-06-22 01:13:42,493 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:13:42,493 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:13:42,494 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-06-22 01:13:42,494 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:13:42,495 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-22 01:13:42,495 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-22 01:13:42,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:42,495 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-22 01:13:42,495 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:13:42,495 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-22 01:13:42,495 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:42,496 INFO ]: Found error trace [2018-06-22 01:13:42,496 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:42,496 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:42,496 INFO ]: Analyzing trace with hash 1182618618, now seen corresponding path program 1 times [2018-06-22 01:13:42,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:42,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:42,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:42,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:42,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:42,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:42,646 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:42,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:42,646 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-22 01:13:42,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:42,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:42,683 INFO ]: Computing forward predicates... [2018-06-22 01:13:43,146 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 01:13:43,312 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:43,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:43,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:13:43,339 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:13:43,339 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:13:43,339 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:13:43,339 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-06-22 01:13:43,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:43,752 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-22 01:13:43,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:13:43,753 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-22 01:13:43,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:43,754 INFO ]: With dead ends: 28 [2018-06-22 01:13:43,754 INFO ]: Without dead ends: 27 [2018-06-22 01:13:43,754 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:13:43,754 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:13:43,756 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 01:13:43,756 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:13:43,756 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-22 01:13:43,756 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2018-06-22 01:13:43,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:43,757 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-22 01:13:43,757 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:13:43,757 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-22 01:13:43,757 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:13:43,757 INFO ]: Found error trace [2018-06-22 01:13:43,757 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:43,757 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:43,757 INFO ]: Analyzing trace with hash -1933773367, now seen corresponding path program 2 times [2018-06-22 01:13:43,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:43,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:43,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:43,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:43,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:43,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:43,837 INFO ]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:13:43,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:43,837 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-22 01:13:43,849 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:43,865 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:43,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:43,867 INFO ]: Computing forward predicates... [2018-06-22 01:13:43,884 INFO ]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:13:43,904 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:13:43,904 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-06-22 01:13:43,904 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:13:43,904 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:13:43,904 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:43,904 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 7 states. [2018-06-22 01:13:43,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:43,956 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-22 01:13:43,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:43,957 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-22 01:13:43,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:43,957 INFO ]: With dead ends: 23 [2018-06-22 01:13:43,957 INFO ]: Without dead ends: 16 [2018-06-22 01:13:43,957 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:43,958 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:13:43,959 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:13:43,959 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:13:43,959 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-22 01:13:43,959 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-22 01:13:43,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:43,959 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-22 01:13:43,959 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:13:43,960 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-22 01:13:43,960 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:13:43,960 INFO ]: Found error trace [2018-06-22 01:13:43,960 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:43,960 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:43,960 INFO ]: Analyzing trace with hash -921943624, now seen corresponding path program 2 times [2018-06-22 01:13:43,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:43,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:43,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:43,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:43,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:43,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:44,075 INFO ]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:44,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:44,075 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-22 01:13:44,082 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:44,130 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:44,130 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:44,132 INFO ]: Computing forward predicates... [2018-06-22 01:13:44,493 INFO ]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:44,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:44,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:13:44,514 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:13:44,514 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:13:44,515 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:13:44,515 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 11 states. [2018-06-22 01:13:44,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:44,686 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-22 01:13:44,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:13:44,686 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:13:44,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:44,686 INFO ]: With dead ends: 26 [2018-06-22 01:13:44,686 INFO ]: Without dead ends: 25 [2018-06-22 01:13:44,687 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:13:44,687 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:13:44,689 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-06-22 01:13:44,689 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:13:44,689 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-22 01:13:44,689 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-06-22 01:13:44,689 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:44,689 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-22 01:13:44,689 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:13:44,689 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-22 01:13:44,689 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:13:44,689 INFO ]: Found error trace [2018-06-22 01:13:44,690 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:44,690 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:44,691 INFO ]: Analyzing trace with hash 1544273867, now seen corresponding path program 3 times [2018-06-22 01:13:44,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:44,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:44,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:44,692 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:44,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:44,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:44,790 INFO ]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:44,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:44,790 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-22 01:13:44,796 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:44,854 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:13:44,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:44,856 INFO ]: Computing forward predicates... [2018-06-22 01:13:45,021 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:45,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:45,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 01:13:45,055 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:13:45,055 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:13:45,055 INFO ]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:13:45,055 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2018-06-22 01:13:45,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:45,256 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-22 01:13:45,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:13:45,257 INFO ]: Start accepts. Automaton has 16 states. Word has length 16 [2018-06-22 01:13:45,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:45,258 INFO ]: With dead ends: 23 [2018-06-22 01:13:45,258 INFO ]: Without dead ends: 19 [2018-06-22 01:13:45,258 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:13:45,259 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:13:45,260 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-22 01:13:45,260 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:13:45,261 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-22 01:13:45,261 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-22 01:13:45,261 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:45,261 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-22 01:13:45,261 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:13:45,261 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-22 01:13:45,261 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:13:45,261 INFO ]: Found error trace [2018-06-22 01:13:45,261 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:45,261 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:45,262 INFO ]: Analyzing trace with hash 215491849, now seen corresponding path program 4 times [2018-06-22 01:13:45,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:45,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:45,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:45,262 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:45,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:45,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:45,395 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:45,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:45,395 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-22 01:13:45,401 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:13:45,431 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:45,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:45,434 INFO ]: Computing forward predicates... [2018-06-22 01:13:45,486 INFO ]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:45,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:45,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 01:13:45,506 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:13:45,508 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:13:45,508 INFO ]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:13:45,508 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 14 states. [2018-06-22 01:13:45,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:45,609 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 01:13:45,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:13:45,609 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 01:13:45,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:45,609 INFO ]: With dead ends: 21 [2018-06-22 01:13:45,609 INFO ]: Without dead ends: 20 [2018-06-22 01:13:45,610 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:13:45,610 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:13:45,611 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-22 01:13:45,611 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:13:45,612 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 01:13:45,612 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-22 01:13:45,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:45,612 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 01:13:45,612 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:13:45,612 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 01:13:45,612 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:13:45,612 INFO ]: Found error trace [2018-06-22 01:13:45,612 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:45,612 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:45,613 INFO ]: Analyzing trace with hash -1849932134, now seen corresponding path program 5 times [2018-06-22 01:13:45,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:45,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:45,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:45,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:45,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:45,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:45,776 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:45,777 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:45,777 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-22 01:13:45,783 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:13:45,804 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:13:45,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:45,807 INFO ]: Computing forward predicates... [2018-06-22 01:13:45,978 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:46,000 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:46,000 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:13:46,000 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:13:46,000 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:13:46,000 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:13:46,001 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2018-06-22 01:13:46,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:46,287 INFO ]: Finished difference Result 30 states and 33 transitions. [2018-06-22 01:13:46,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:13:46,288 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 01:13:46,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:46,288 INFO ]: With dead ends: 30 [2018-06-22 01:13:46,288 INFO ]: Without dead ends: 29 [2018-06-22 01:13:46,288 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:13:46,288 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:13:46,290 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-06-22 01:13:46,290 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:13:46,291 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-22 01:13:46,291 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2018-06-22 01:13:46,291 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:46,291 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-22 01:13:46,291 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:13:46,291 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-22 01:13:46,291 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:13:46,291 INFO ]: Found error trace [2018-06-22 01:13:46,291 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:46,291 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:46,291 INFO ]: Analyzing trace with hash -1453566167, now seen corresponding path program 6 times [2018-06-22 01:13:46,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:46,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:46,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:46,292 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:46,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:46,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:46,441 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:46,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:46,441 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-22 01:13:46,446 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:13:46,467 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:13:46,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:46,469 INFO ]: Computing forward predicates... [2018-06-22 01:13:46,565 INFO ]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:46,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:46,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 01:13:46,586 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:13:46,586 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:13:46,586 INFO ]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:13:46,587 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 20 states. [2018-06-22 01:13:46,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:46,893 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-22 01:13:46,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:13:46,893 INFO ]: Start accepts. Automaton has 20 states. Word has length 19 [2018-06-22 01:13:46,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:46,893 INFO ]: With dead ends: 27 [2018-06-22 01:13:46,893 INFO ]: Without dead ends: 22 [2018-06-22 01:13:46,894 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:13:46,894 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:13:46,895 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-22 01:13:46,895 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:13:46,895 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 01:13:46,896 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-22 01:13:46,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:46,896 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 01:13:46,896 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:13:46,896 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 01:13:46,896 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:13:46,896 INFO ]: Found error trace [2018-06-22 01:13:46,896 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:46,896 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:46,896 INFO ]: Analyzing trace with hash 493245865, now seen corresponding path program 7 times [2018-06-22 01:13:46,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:46,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:46,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:46,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:46,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:46,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,020 INFO ]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:47,020 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-22 01:13:47,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:47,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,048 INFO ]: Computing forward predicates... [2018-06-22 01:13:47,204 INFO ]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:47,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-22 01:13:47,227 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:13:47,227 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:13:47,227 INFO ]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:13:47,228 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2018-06-22 01:13:47,590 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:13:47,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:47,600 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-22 01:13:47,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:13:47,600 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-22 01:13:47,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:47,600 INFO ]: With dead ends: 24 [2018-06-22 01:13:47,600 INFO ]: Without dead ends: 23 [2018-06-22 01:13:47,601 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:13:47,601 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:13:47,603 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-22 01:13:47,603 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:13:47,603 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-22 01:13:47,603 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-22 01:13:47,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:47,603 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-22 01:13:47,603 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:13:47,603 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-22 01:13:47,604 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:13:47,604 INFO ]: Found error trace [2018-06-22 01:13:47,604 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:47,604 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:47,604 INFO ]: Analyzing trace with hash -1829492230, now seen corresponding path program 8 times [2018-06-22 01:13:47,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:47,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:47,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:47,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,826 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:47,826 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-22 01:13:47,841 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:47,867 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:47,867 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,869 INFO ]: Computing forward predicates... [2018-06-22 01:13:47,944 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:47,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-22 01:13:47,963 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:13:47,963 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:13:47,963 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:13:47,963 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 17 states. [2018-06-22 01:13:48,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:48,234 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-22 01:13:48,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:13:48,234 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 01:13:48,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:48,235 INFO ]: With dead ends: 34 [2018-06-22 01:13:48,235 INFO ]: Without dead ends: 33 [2018-06-22 01:13:48,235 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:13:48,235 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:13:48,237 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-06-22 01:13:48,237 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:13:48,237 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-22 01:13:48,237 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2018-06-22 01:13:48,238 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:48,238 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-22 01:13:48,238 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:13:48,238 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-22 01:13:48,238 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:13:48,238 INFO ]: Found error trace [2018-06-22 01:13:48,238 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:48,238 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:48,238 INFO ]: Analyzing trace with hash -819929143, now seen corresponding path program 9 times [2018-06-22 01:13:48,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:48,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:48,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:48,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:48,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:48,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:48,635 INFO ]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:48,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:48,635 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-22 01:13:48,641 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:48,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:13:48,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:48,670 INFO ]: Computing forward predicates... [2018-06-22 01:13:48,868 INFO ]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:48,887 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:48,887 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-22 01:13:48,887 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:13:48,887 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:13:48,888 INFO ]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:13:48,888 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 24 states. [2018-06-22 01:13:49,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:49,129 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-22 01:13:49,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:13:49,132 INFO ]: Start accepts. Automaton has 24 states. Word has length 22 [2018-06-22 01:13:49,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:49,132 INFO ]: With dead ends: 31 [2018-06-22 01:13:49,133 INFO ]: Without dead ends: 25 [2018-06-22 01:13:49,133 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:13:49,133 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:13:49,135 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-22 01:13:49,135 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:13:49,135 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-22 01:13:49,135 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-22 01:13:49,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:49,135 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-22 01:13:49,135 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:13:49,135 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-22 01:13:49,136 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:13:49,136 INFO ]: Found error trace [2018-06-22 01:13:49,136 INFO ]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:49,136 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:49,136 INFO ]: Analyzing trace with hash 1977781387, now seen corresponding path program 10 times [2018-06-22 01:13:49,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:49,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:49,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,136 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:49,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:49,470 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:49,470 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:49,470 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-22 01:13:49,476 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:13:49,500 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:49,500 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:49,502 INFO ]: Computing forward predicates... [2018-06-22 01:13:49,607 INFO ]: Checked inductivity of 31 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:49,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:49,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-22 01:13:49,626 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:13:49,626 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:13:49,626 INFO ]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:13:49,626 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 22 states. [2018-06-22 01:13:49,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:49,812 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-22 01:13:49,813 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:13:49,813 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-22 01:13:49,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:49,813 INFO ]: With dead ends: 27 [2018-06-22 01:13:49,813 INFO ]: Without dead ends: 26 [2018-06-22 01:13:49,813 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:13:49,813 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:13:49,815 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-22 01:13:49,815 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:13:49,815 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 01:13:49,815 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-22 01:13:49,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:49,815 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 01:13:49,815 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:13:49,815 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 01:13:49,816 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:13:49,816 INFO ]: Found error trace [2018-06-22 01:13:49,816 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:49,816 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:49,816 INFO ]: Analyzing trace with hash 1241435992, now seen corresponding path program 11 times [2018-06-22 01:13:49,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:49,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:49,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,819 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:49,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,072 INFO ]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,072 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:50,072 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:50,078 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:13:50,116 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:13:50,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,119 INFO ]: Computing forward predicates... [2018-06-22 01:13:50,227 INFO ]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:50,246 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 01:13:50,246 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:13:50,246 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:13:50,246 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:13:50,246 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 20 states. [2018-06-22 01:13:50,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:50,705 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 01:13:50,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:13:50,706 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-22 01:13:50,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:50,706 INFO ]: With dead ends: 38 [2018-06-22 01:13:50,706 INFO ]: Without dead ends: 37 [2018-06-22 01:13:50,707 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:13:50,707 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:13:50,709 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-06-22 01:13:50,709 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:13:50,710 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-22 01:13:50,712 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2018-06-22 01:13:50,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:50,712 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-22 01:13:50,712 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:13:50,712 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-22 01:13:50,713 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:13:50,713 INFO ]: Found error trace [2018-06-22 01:13:50,713 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:50,713 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:50,713 INFO ]: Analyzing trace with hash -110434773, now seen corresponding path program 12 times [2018-06-22 01:13:50,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:50,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:50,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,714 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:50,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,318 INFO ]: Checked inductivity of 40 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,318 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:51,318 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-22 01:13:51,324 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:13:51,420 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:13:51,420 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,422 INFO ]: Computing forward predicates... [2018-06-22 01:13:51,614 INFO ]: Checked inductivity of 40 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:51,634 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-06-22 01:13:51,634 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:13:51,634 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:13:51,634 INFO ]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:13:51,635 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 28 states. [2018-06-22 01:13:51,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,946 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-22 01:13:51,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:13:51,946 INFO ]: Start accepts. Automaton has 28 states. Word has length 25 [2018-06-22 01:13:51,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,947 INFO ]: With dead ends: 35 [2018-06-22 01:13:51,947 INFO ]: Without dead ends: 28 [2018-06-22 01:13:51,947 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:13:51,947 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:13:51,948 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-06-22 01:13:51,949 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:13:51,949 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:13:51,949 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-22 01:13:51,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,949 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:13:51,949 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:13:51,949 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:13:51,950 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:13:51,950 INFO ]: Found error trace [2018-06-22 01:13:51,950 INFO ]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,950 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,950 INFO ]: Analyzing trace with hash -2061560025, now seen corresponding path program 13 times [2018-06-22 01:13:51,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,950 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:51,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:52,866 INFO ]: Checked inductivity of 46 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:52,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:52,866 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-22 01:13:52,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:52,900 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:52,902 INFO ]: Computing forward predicates... [2018-06-22 01:13:53,004 INFO ]: Checked inductivity of 46 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:53,023 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:53,023 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 26 [2018-06-22 01:13:53,024 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:13:53,024 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:13:53,024 INFO ]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:13:53,024 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 26 states. [2018-06-22 01:13:53,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:53,256 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-22 01:13:53,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:13:53,283 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-22 01:13:53,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:53,283 INFO ]: With dead ends: 30 [2018-06-22 01:13:53,283 INFO ]: Without dead ends: 29 [2018-06-22 01:13:53,284 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=431, Invalid=1291, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:13:53,284 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:13:53,286 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-06-22 01:13:53,286 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:13:53,286 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-22 01:13:53,286 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-22 01:13:53,286 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:53,286 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-22 01:13:53,286 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:13:53,286 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-22 01:13:53,287 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:13:53,287 INFO ]: Found error trace [2018-06-22 01:13:53,287 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:53,287 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:53,287 INFO ]: Analyzing trace with hash 575903804, now seen corresponding path program 14 times [2018-06-22 01:13:53,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:53,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:53,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:53,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:53,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:53,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:53,749 INFO ]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:53,749 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:53,749 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-22 01:13:53,755 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:53,786 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:53,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:53,789 INFO ]: Computing forward predicates... [2018-06-22 01:13:54,027 INFO ]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:54,046 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:54,046 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 01:13:54,046 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:13:54,046 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:13:54,047 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:13:54,047 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 23 states. [2018-06-22 01:13:54,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:54,549 INFO ]: Finished difference Result 42 states and 45 transitions. [2018-06-22 01:13:54,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:13:54,552 INFO ]: Start accepts. Automaton has 23 states. Word has length 27 [2018-06-22 01:13:54,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:54,552 INFO ]: With dead ends: 42 [2018-06-22 01:13:54,552 INFO ]: Without dead ends: 41 [2018-06-22 01:13:54,552 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=1721, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:13:54,552 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:13:54,554 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-06-22 01:13:54,554 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:13:54,555 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-22 01:13:54,555 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-06-22 01:13:54,555 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:54,555 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-22 01:13:54,555 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:13:54,555 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-22 01:13:54,556 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:13:54,556 INFO ]: Found error trace [2018-06-22 01:13:54,556 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:54,556 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:54,556 INFO ]: Analyzing trace with hash 732903879, now seen corresponding path program 15 times [2018-06-22 01:13:54,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:54,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:54,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:54,557 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:54,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:54,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,126 INFO ]: Checked inductivity of 57 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:55,126 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-22 01:13:55,132 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:55,167 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:13:55,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,169 INFO ]: Computing forward predicates... [2018-06-22 01:13:55,444 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:55,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 32 [2018-06-22 01:13:55,464 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:13:55,464 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:13:55,464 INFO ]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:13:55,464 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 32 states. [2018-06-22 01:13:56,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:56,217 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-22 01:13:56,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:13:56,217 INFO ]: Start accepts. Automaton has 32 states. Word has length 28 [2018-06-22 01:13:56,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:56,217 INFO ]: With dead ends: 39 [2018-06-22 01:13:56,217 INFO ]: Without dead ends: 31 [2018-06-22 01:13:56,218 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=504, Invalid=2148, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:13:56,218 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:13:56,219 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-06-22 01:13:56,219 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:13:56,219 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-22 01:13:56,219 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-22 01:13:56,220 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:56,220 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-22 01:13:56,220 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:13:56,220 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-22 01:13:56,220 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:13:56,220 INFO ]: Found error trace [2018-06-22 01:13:56,220 INFO ]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:56,220 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:56,220 INFO ]: Analyzing trace with hash -1277687283, now seen corresponding path program 16 times [2018-06-22 01:13:56,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:56,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:56,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:56,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,500 INFO ]: Checked inductivity of 64 backedges. 43 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:56,500 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-22 01:13:56,509 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:13:56,539 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:56,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,541 INFO ]: Computing forward predicates... [2018-06-22 01:13:56,669 INFO ]: Checked inductivity of 64 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,688 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:56,688 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 30 [2018-06-22 01:13:56,689 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:13:56,689 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:13:56,689 INFO ]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:13:56,689 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 30 states. [2018-06-22 01:13:57,136 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 01:13:57,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:57,141 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-22 01:13:57,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:13:57,143 INFO ]: Start accepts. Automaton has 30 states. Word has length 29 [2018-06-22 01:13:57,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:57,143 INFO ]: With dead ends: 33 [2018-06-22 01:13:57,143 INFO ]: Without dead ends: 32 [2018-06-22 01:13:57,144 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=585, Invalid=1767, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:13:57,144 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:13:57,146 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-06-22 01:13:57,146 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:13:57,146 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 01:13:57,146 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-22 01:13:57,146 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:57,146 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 01:13:57,146 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:13:57,146 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 01:13:57,147 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:13:57,147 INFO ]: Found error trace [2018-06-22 01:13:57,147 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:57,147 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:57,147 INFO ]: Analyzing trace with hash -893844970, now seen corresponding path program 17 times [2018-06-22 01:13:57,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:57,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:57,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:57,148 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:57,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:57,161 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:57,525 INFO ]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:57,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:57,525 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-22 01:13:57,530 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:13:57,566 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:13:57,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:57,569 INFO ]: Computing forward predicates... [2018-06-22 01:13:57,689 INFO ]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:57,707 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:57,707 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 01:13:57,708 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:13:57,708 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:13:57,708 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:13:57,708 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 26 states. [2018-06-22 01:13:58,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:58,302 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-22 01:13:58,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:13:58,344 INFO ]: Start accepts. Automaton has 26 states. Word has length 30 [2018-06-22 01:13:58,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:58,345 INFO ]: With dead ends: 46 [2018-06-22 01:13:58,345 INFO ]: Without dead ends: 45 [2018-06-22 01:13:58,345 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 19 SyntacticMatches, 12 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:13:58,345 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:13:58,347 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-06-22 01:13:58,347 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:13:58,348 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-22 01:13:58,348 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2018-06-22 01:13:58,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:58,348 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-22 01:13:58,348 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:13:58,348 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-22 01:13:58,348 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:13:58,348 INFO ]: Found error trace [2018-06-22 01:13:58,348 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:58,348 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:58,349 INFO ]: Analyzing trace with hash -1879635155, now seen corresponding path program 18 times [2018-06-22 01:13:58,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:58,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:58,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:58,349 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:58,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:58,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:58,836 INFO ]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:58,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:58,836 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-22 01:13:58,847 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:13:58,887 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:13:58,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:58,890 INFO ]: Computing forward predicates... [2018-06-22 01:13:59,156 INFO ]: Checked inductivity of 77 backedges. 28 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:59,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 36 [2018-06-22 01:13:59,176 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:13:59,176 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:13:59,177 INFO ]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:13:59,177 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 36 states. [2018-06-22 01:13:59,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:59,692 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 01:13:59,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:13:59,692 INFO ]: Start accepts. Automaton has 36 states. Word has length 31 [2018-06-22 01:13:59,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:59,692 INFO ]: With dead ends: 43 [2018-06-22 01:13:59,692 INFO ]: Without dead ends: 34 [2018-06-22 01:13:59,693 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:13:59,693 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:13:59,694 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-06-22 01:13:59,694 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:13:59,695 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-22 01:13:59,695 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-22 01:13:59,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:59,695 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-22 01:13:59,695 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:13:59,695 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-22 01:13:59,695 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:13:59,695 INFO ]: Found error trace [2018-06-22 01:13:59,695 INFO ]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:59,695 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:59,695 INFO ]: Analyzing trace with hash -831393115, now seen corresponding path program 19 times [2018-06-22 01:13:59,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:59,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:59,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,696 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:59,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,974 INFO ]: Checked inductivity of 85 backedges. 57 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:59,975 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-22 01:13:59,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:00,015 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:00,018 INFO ]: Computing forward predicates... [2018-06-22 01:14:00,196 INFO ]: Checked inductivity of 85 backedges. 64 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:00,215 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:00,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 34 [2018-06-22 01:14:00,215 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:14:00,215 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:14:00,215 INFO ]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:00,215 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 34 states. [2018-06-22 01:14:00,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:00,558 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-22 01:14:00,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:14:00,559 INFO ]: Start accepts. Automaton has 34 states. Word has length 32 [2018-06-22 01:14:00,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:00,559 INFO ]: With dead ends: 36 [2018-06-22 01:14:00,559 INFO ]: Without dead ends: 35 [2018-06-22 01:14:00,559 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=763, Invalid=2317, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:14:00,560 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:14:00,561 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-06-22 01:14:00,561 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:14:00,561 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-22 01:14:00,561 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-22 01:14:00,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:00,561 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-22 01:14:00,561 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:14:00,561 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-22 01:14:00,562 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:14:00,562 INFO ]: Found error trace [2018-06-22 01:14:00,562 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:00,562 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:00,562 INFO ]: Analyzing trace with hash 56372350, now seen corresponding path program 20 times [2018-06-22 01:14:00,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:00,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:00,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:00,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:01,276 INFO ]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:01,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:01,276 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-22 01:14:01,282 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:01,350 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:01,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:01,355 INFO ]: Computing forward predicates... [2018-06-22 01:14:02,230 INFO ]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:02,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:02,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-22 01:14:02,250 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:14:02,250 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:14:02,250 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:14:02,250 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 29 states. [2018-06-22 01:14:03,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:03,181 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-22 01:14:03,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:14:03,182 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-22 01:14:03,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:03,182 INFO ]: With dead ends: 50 [2018-06-22 01:14:03,182 INFO ]: Without dead ends: 49 [2018-06-22 01:14:03,183 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=2861, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:14:03,183 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:14:03,184 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 37. [2018-06-22 01:14:03,184 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:14:03,185 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-22 01:14:03,185 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2018-06-22 01:14:03,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:03,185 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-22 01:14:03,185 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:14:03,185 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-22 01:14:03,185 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:14:03,185 INFO ]: Found error trace [2018-06-22 01:14:03,185 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:03,185 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:03,185 INFO ]: Analyzing trace with hash 1807297989, now seen corresponding path program 21 times [2018-06-22 01:14:03,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:03,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:03,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:03,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:03,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:03,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:03,900 INFO ]: Checked inductivity of 100 backedges. 21 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:03,900 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:03,900 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-22 01:14:03,910 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:03,962 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:14:03,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:03,965 INFO ]: Computing forward predicates... [2018-06-22 01:14:04,380 INFO ]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:04,400 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:04,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 40 [2018-06-22 01:14:04,400 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:14:04,400 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:14:04,400 INFO ]: CoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:14:04,401 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 40 states. [2018-06-22 01:14:04,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:04,838 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-22 01:14:04,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:14:04,838 INFO ]: Start accepts. Automaton has 40 states. Word has length 34 [2018-06-22 01:14:04,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:04,839 INFO ]: With dead ends: 47 [2018-06-22 01:14:04,839 INFO ]: Without dead ends: 37 [2018-06-22 01:14:04,840 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=788, Invalid=3502, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:14:04,840 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:14:04,841 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-06-22 01:14:04,841 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:14:04,841 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-22 01:14:04,841 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-22 01:14:04,842 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:04,842 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-22 01:14:04,842 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:14:04,842 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-22 01:14:04,842 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:14:04,842 INFO ]: Found error trace [2018-06-22 01:14:04,842 INFO ]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:04,842 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:04,842 INFO ]: Analyzing trace with hash 838745487, now seen corresponding path program 22 times [2018-06-22 01:14:04,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:04,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:04,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:04,843 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:04,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:04,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:05,364 INFO ]: Checked inductivity of 109 backedges. 73 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:05,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:05,364 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-22 01:14:05,373 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:05,417 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:05,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:05,420 INFO ]: Computing forward predicates... [2018-06-22 01:14:05,614 INFO ]: Checked inductivity of 109 backedges. 81 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:05,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:05,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 38 [2018-06-22 01:14:05,642 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:14:05,642 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:14:05,642 INFO ]: CoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:05,643 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 38 states. [2018-06-22 01:14:06,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:06,233 INFO ]: Finished difference Result 39 states and 40 transitions. [2018-06-22 01:14:06,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:14:06,234 INFO ]: Start accepts. Automaton has 38 states. Word has length 35 [2018-06-22 01:14:06,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:06,234 INFO ]: With dead ends: 39 [2018-06-22 01:14:06,234 INFO ]: Without dead ends: 38 [2018-06-22 01:14:06,235 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=2941, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:14:06,235 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:14:06,236 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-06-22 01:14:06,236 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:14:06,236 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-22 01:14:06,236 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-06-22 01:14:06,236 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:06,236 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-22 01:14:06,237 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:14:06,237 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-22 01:14:06,237 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:14:06,237 INFO ]: Found error trace [2018-06-22 01:14:06,237 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:06,237 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:06,237 INFO ]: Analyzing trace with hash 291061460, now seen corresponding path program 23 times [2018-06-22 01:14:06,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:06,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:06,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:06,237 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:06,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:06,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:06,837 INFO ]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:06,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:06,837 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-22 01:14:06,843 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:06,888 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:14:06,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:06,893 INFO ]: Computing forward predicates... [2018-06-22 01:14:07,085 INFO ]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:07,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:07,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 01:14:07,105 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:14:07,105 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:14:07,105 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:14:07,105 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 32 states. [2018-06-22 01:14:07,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:07,996 INFO ]: Finished difference Result 54 states and 57 transitions. [2018-06-22 01:14:07,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:14:07,997 INFO ]: Start accepts. Automaton has 32 states. Word has length 36 [2018-06-22 01:14:07,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:07,997 INFO ]: With dead ends: 54 [2018-06-22 01:14:07,997 INFO ]: Without dead ends: 53 [2018-06-22 01:14:07,998 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 15 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=3539, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:14:07,998 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:14:07,999 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-06-22 01:14:07,999 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:14:08,000 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-22 01:14:08,000 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 36 [2018-06-22 01:14:08,000 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:08,000 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-22 01:14:08,000 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:14:08,000 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-22 01:14:08,000 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:14:08,000 INFO ]: Found error trace [2018-06-22 01:14:08,000 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:08,000 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:08,000 INFO ]: Analyzing trace with hash 492725807, now seen corresponding path program 24 times [2018-06-22 01:14:08,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:08,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:08,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:08,001 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:08,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:08,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:08,992 INFO ]: Checked inductivity of 126 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:08,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:08,992 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-22 01:14:08,998 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:09,046 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 01:14:09,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:09,049 INFO ]: Computing forward predicates... [2018-06-22 01:14:09,368 INFO ]: Checked inductivity of 126 backedges. 45 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:09,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:09,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 44 [2018-06-22 01:14:09,387 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:14:09,387 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:14:09,388 INFO ]: CoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:14:09,388 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 44 states. [2018-06-22 01:14:09,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:09,828 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-22 01:14:09,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:14:09,828 INFO ]: Start accepts. Automaton has 44 states. Word has length 37 [2018-06-22 01:14:09,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:09,828 INFO ]: With dead ends: 51 [2018-06-22 01:14:09,828 INFO ]: Without dead ends: 40 [2018-06-22 01:14:09,828 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=954, Invalid=4302, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 01:14:09,829 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:14:09,830 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-06-22 01:14:09,830 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:14:09,830 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-22 01:14:09,830 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-22 01:14:09,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:09,830 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-22 01:14:09,830 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:14:09,830 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-22 01:14:09,831 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:14:09,831 INFO ]: Found error trace [2018-06-22 01:14:09,831 INFO ]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:09,831 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:09,831 INFO ]: Analyzing trace with hash -818329565, now seen corresponding path program 25 times [2018-06-22 01:14:09,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:09,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:09,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:09,831 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:09,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:09,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:10,225 INFO ]: Checked inductivity of 136 backedges. 91 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:10,225 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:10,225 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-22 01:14:10,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:10,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:10,277 INFO ]: Computing forward predicates... [2018-06-22 01:14:10,552 INFO ]: Checked inductivity of 136 backedges. 100 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:10,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:10,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 42 [2018-06-22 01:14:10,571 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:14:10,571 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:14:10,572 INFO ]: CoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:14:10,572 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 42 states. [2018-06-22 01:14:11,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:11,291 INFO ]: Finished difference Result 42 states and 43 transitions. [2018-06-22 01:14:11,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:14:11,292 INFO ]: Start accepts. Automaton has 42 states. Word has length 38 [2018-06-22 01:14:11,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:11,292 INFO ]: With dead ends: 42 [2018-06-22 01:14:11,292 INFO ]: Without dead ends: 41 [2018-06-22 01:14:11,292 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1191, Invalid=3639, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:14:11,292 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:14:11,293 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-06-22 01:14:11,293 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:14:11,293 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-22 01:14:11,293 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-22 01:14:11,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:11,293 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-22 01:14:11,293 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:14:11,293 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-22 01:14:11,294 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:14:11,294 INFO ]: Found error trace [2018-06-22 01:14:11,294 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:11,294 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:11,294 INFO ]: Analyzing trace with hash 461342400, now seen corresponding path program 26 times [2018-06-22 01:14:11,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:11,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:11,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:11,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:11,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:11,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:11,983 INFO ]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:11,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:11,983 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-22 01:14:11,989 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:12,033 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:12,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:12,039 INFO ]: Computing forward predicates... [2018-06-22 01:14:12,260 INFO ]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:12,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:12,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-22 01:14:12,280 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:14:12,280 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:14:12,280 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:14:12,280 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 35 states. [2018-06-22 01:14:13,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:13,446 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-22 01:14:13,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:14:13,446 INFO ]: Start accepts. Automaton has 35 states. Word has length 39 [2018-06-22 01:14:13,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:13,447 INFO ]: With dead ends: 58 [2018-06-22 01:14:13,447 INFO ]: Without dead ends: 57 [2018-06-22 01:14:13,447 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 24 SyntacticMatches, 16 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=4289, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:14:13,447 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:14:13,448 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-06-22 01:14:13,448 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:14:13,448 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-06-22 01:14:13,448 INFO ]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 39 [2018-06-22 01:14:13,448 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:13,448 INFO ]: Abstraction has 43 states and 45 transitions. [2018-06-22 01:14:13,448 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:14:13,448 INFO ]: Start isEmpty. Operand 43 states and 45 transitions. [2018-06-22 01:14:13,448 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:14:13,448 INFO ]: Found error trace [2018-06-22 01:14:13,448 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:13,448 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:13,449 INFO ]: Analyzing trace with hash 1476467651, now seen corresponding path program 27 times [2018-06-22 01:14:13,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:13,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:13,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:13,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:13,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:13,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:13,965 INFO ]: Checked inductivity of 155 backedges. 36 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:13,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:13,987 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-22 01:14:13,992 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:14,048 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 01:14:14,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:14,052 INFO ]: Computing forward predicates... [2018-06-22 01:14:14,383 INFO ]: Checked inductivity of 155 backedges. 55 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:14,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:14,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 48 [2018-06-22 01:14:14,402 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:14:14,402 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:14:14,402 INFO ]: CoverageRelationStatistics Valid=362, Invalid=1894, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:14:14,402 INFO ]: Start difference. First operand 43 states and 45 transitions. Second operand 48 states. [2018-06-22 01:14:14,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:14,958 INFO ]: Finished difference Result 55 states and 57 transitions. [2018-06-22 01:14:14,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:14:14,958 INFO ]: Start accepts. Automaton has 48 states. Word has length 40 [2018-06-22 01:14:14,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:14,959 INFO ]: With dead ends: 55 [2018-06-22 01:14:14,959 INFO ]: Without dead ends: 43 [2018-06-22 01:14:14,959 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1136, Invalid=5184, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:14:14,959 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:14:14,960 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-06-22 01:14:14,960 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:14:14,961 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-22 01:14:14,961 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-22 01:14:14,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:14,961 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-22 01:14:14,961 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:14:14,961 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-22 01:14:14,961 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:14:14,961 INFO ]: Found error trace [2018-06-22 01:14:14,961 INFO ]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:14,961 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:14,961 INFO ]: Analyzing trace with hash 366659345, now seen corresponding path program 28 times [2018-06-22 01:14:14,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:14,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:14,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:14,962 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:14,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:14,971 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:15,431 INFO ]: Checked inductivity of 166 backedges. 111 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:15,431 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:15,431 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-22 01:14:15,437 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:15,480 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:15,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:15,483 INFO ]: Computing forward predicates... [2018-06-22 01:14:15,696 INFO ]: Checked inductivity of 166 backedges. 121 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:15,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:15,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 46 [2018-06-22 01:14:15,715 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:14:15,716 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:14:15,716 INFO ]: CoverageRelationStatistics Valid=336, Invalid=1734, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:14:15,716 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 46 states. [2018-06-22 01:14:16,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:16,521 INFO ]: Finished difference Result 45 states and 46 transitions. [2018-06-22 01:14:16,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:14:16,521 INFO ]: Start accepts. Automaton has 46 states. Word has length 41 [2018-06-22 01:14:16,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:16,521 INFO ]: With dead ends: 45 [2018-06-22 01:14:16,521 INFO ]: Without dead ends: 44 [2018-06-22 01:14:16,522 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1441, Invalid=4411, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 01:14:16,522 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:14:16,523 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-06-22 01:14:16,523 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:14:16,523 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-22 01:14:16,523 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-06-22 01:14:16,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:16,523 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-22 01:14:16,523 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:14:16,523 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-22 01:14:16,523 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:14:16,523 INFO ]: Found error trace [2018-06-22 01:14:16,523 INFO ]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:16,523 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:16,523 INFO ]: Analyzing trace with hash -1458707054, now seen corresponding path program 29 times [2018-06-22 01:14:16,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:16,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:16,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:16,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:16,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:16,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:17,259 INFO ]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:17,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:17,259 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-22 01:14:17,264 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:17,322 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:14:17,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:17,329 INFO ]: Computing forward predicates... [2018-06-22 01:14:17,644 INFO ]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:17,664 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:17,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-22 01:14:17,664 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:14:17,664 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:14:17,664 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:17,665 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 38 states. [2018-06-22 01:14:18,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:18,911 INFO ]: Finished difference Result 62 states and 65 transitions. [2018-06-22 01:14:18,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:14:18,916 INFO ]: Start accepts. Automaton has 38 states. Word has length 42 [2018-06-22 01:14:18,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:18,916 INFO ]: With dead ends: 62 [2018-06-22 01:14:18,916 INFO ]: Without dead ends: 61 [2018-06-22 01:14:18,917 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=291, Invalid=5111, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:14:18,917 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:14:18,918 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-06-22 01:14:18,918 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:14:18,919 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-06-22 01:14:18,919 INFO ]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 42 [2018-06-22 01:14:18,919 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:18,919 INFO ]: Abstraction has 46 states and 48 transitions. [2018-06-22 01:14:18,919 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:14:18,919 INFO ]: Start isEmpty. Operand 46 states and 48 transitions. [2018-06-22 01:14:18,919 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:14:18,919 INFO ]: Found error trace [2018-06-22 01:14:18,919 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:18,919 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:18,919 INFO ]: Analyzing trace with hash 2084476721, now seen corresponding path program 30 times [2018-06-22 01:14:18,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:18,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:18,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:18,921 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:18,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:18,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:19,399 INFO ]: Checked inductivity of 187 backedges. 45 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:19,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:19,399 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-22 01:14:19,404 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:19,465 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 01:14:19,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:19,469 INFO ]: Computing forward predicates... [2018-06-22 01:14:20,247 INFO ]: Checked inductivity of 187 backedges. 66 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:20,266 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:20,266 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 52 [2018-06-22 01:14:20,266 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:14:20,266 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:14:20,267 INFO ]: CoverageRelationStatistics Valid=424, Invalid=2228, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:14:20,267 INFO ]: Start difference. First operand 46 states and 48 transitions. Second operand 52 states. [2018-06-22 01:14:20,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:20,887 INFO ]: Finished difference Result 59 states and 61 transitions. [2018-06-22 01:14:20,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:14:20,887 INFO ]: Start accepts. Automaton has 52 states. Word has length 43 [2018-06-22 01:14:20,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:20,887 INFO ]: With dead ends: 59 [2018-06-22 01:14:20,887 INFO ]: Without dead ends: 46 [2018-06-22 01:14:20,888 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1334, Invalid=6148, Unknown=0, NotChecked=0, Total=7482 [2018-06-22 01:14:20,888 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:14:20,889 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-06-22 01:14:20,889 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:14:20,890 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-06-22 01:14:20,890 INFO ]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-06-22 01:14:20,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:20,890 INFO ]: Abstraction has 45 states and 46 transitions. [2018-06-22 01:14:20,890 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:14:20,890 INFO ]: Start isEmpty. Operand 45 states and 46 transitions. [2018-06-22 01:14:20,890 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:14:20,890 INFO ]: Found error trace [2018-06-22 01:14:20,890 INFO ]: trace histogram [12, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:20,890 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:20,890 INFO ]: Analyzing trace with hash -368085087, now seen corresponding path program 31 times [2018-06-22 01:14:20,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:20,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:20,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:20,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:20,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:20,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:21,346 INFO ]: Checked inductivity of 199 backedges. 133 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:21,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:21,346 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-22 01:14:21,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:21,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:21,402 INFO ]: Computing forward predicates... [2018-06-22 01:14:21,822 INFO ]: Checked inductivity of 199 backedges. 144 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:21,841 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:21,841 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 50 [2018-06-22 01:14:21,841 INFO ]: Interpolant automaton has 50 states [2018-06-22 01:14:21,842 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 01:14:21,842 INFO ]: CoverageRelationStatistics Valid=396, Invalid=2054, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:14:21,842 INFO ]: Start difference. First operand 45 states and 46 transitions. Second operand 50 states. [2018-06-22 01:14:22,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:22,613 INFO ]: Finished difference Result 48 states and 49 transitions. [2018-06-22 01:14:22,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:14:22,614 INFO ]: Start accepts. Automaton has 50 states. Word has length 44 [2018-06-22 01:14:22,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:22,614 INFO ]: With dead ends: 48 [2018-06-22 01:14:22,614 INFO ]: Without dead ends: 47 [2018-06-22 01:14:22,614 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1715, Invalid=5257, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 01:14:22,615 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:14:22,616 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-06-22 01:14:22,616 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:14:22,616 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-06-22 01:14:22,616 INFO ]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-06-22 01:14:22,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:22,616 INFO ]: Abstraction has 46 states and 47 transitions. [2018-06-22 01:14:22,616 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:14:22,616 INFO ]: Start isEmpty. Operand 46 states and 47 transitions. [2018-06-22 01:14:22,616 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:14:22,616 INFO ]: Found error trace [2018-06-22 01:14:22,616 INFO ]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:22,616 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:22,616 INFO ]: Analyzing trace with hash 1534019330, now seen corresponding path program 32 times [2018-06-22 01:14:22,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:22,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:22,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:22,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:22,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:22,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:23,986 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:23,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:23,986 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-22 01:14:23,993 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:24,045 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:24,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:24,049 INFO ]: Computing forward predicates... [2018-06-22 01:14:24,290 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:24,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:24,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-06-22 01:14:24,309 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:14:24,309 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:14:24,309 INFO ]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:14:24,310 INFO ]: Start difference. First operand 46 states and 47 transitions. Second operand 41 states. [2018-06-22 01:14:25,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:25,938 INFO ]: Finished difference Result 66 states and 69 transitions. [2018-06-22 01:14:25,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:14:25,938 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-22 01:14:25,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:25,938 INFO ]: With dead ends: 66 [2018-06-22 01:14:25,938 INFO ]: Without dead ends: 65 [2018-06-22 01:14:25,938 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 28 SyntacticMatches, 18 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=315, Invalid=6005, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:14:25,939 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:14:25,940 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 49. [2018-06-22 01:14:25,940 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:14:25,940 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-06-22 01:14:25,940 INFO ]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2018-06-22 01:14:25,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:25,940 INFO ]: Abstraction has 49 states and 51 transitions. [2018-06-22 01:14:25,940 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:14:25,940 INFO ]: Start isEmpty. Operand 49 states and 51 transitions. [2018-06-22 01:14:25,941 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:14:25,941 INFO ]: Found error trace [2018-06-22 01:14:25,941 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:25,941 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:25,941 INFO ]: Analyzing trace with hash 369714113, now seen corresponding path program 33 times [2018-06-22 01:14:25,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:25,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:25,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:25,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:25,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:25,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:26,470 INFO ]: Checked inductivity of 222 backedges. 55 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:26,470 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:26,470 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-22 01:14:26,477 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:26,551 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 01:14:26,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:26,555 INFO ]: Computing forward predicates... [2018-06-22 01:14:26,987 INFO ]: Checked inductivity of 222 backedges. 78 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:27,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:27,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 56 [2018-06-22 01:14:27,008 INFO ]: Interpolant automaton has 56 states [2018-06-22 01:14:27,008 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 01:14:27,008 INFO ]: CoverageRelationStatistics Valid=491, Invalid=2589, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:14:27,009 INFO ]: Start difference. First operand 49 states and 51 transitions. Second operand 56 states. [2018-06-22 01:14:27,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:27,789 INFO ]: Finished difference Result 63 states and 65 transitions. [2018-06-22 01:14:27,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:14:27,789 INFO ]: Start accepts. Automaton has 56 states. Word has length 46 [2018-06-22 01:14:27,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:27,790 INFO ]: With dead ends: 63 [2018-06-22 01:14:27,790 INFO ]: Without dead ends: 49 [2018-06-22 01:14:27,790 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1548, Invalid=7194, Unknown=0, NotChecked=0, Total=8742 [2018-06-22 01:14:27,790 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:14:27,791 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-06-22 01:14:27,791 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:14:27,792 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-06-22 01:14:27,792 INFO ]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-06-22 01:14:27,792 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:27,792 INFO ]: Abstraction has 48 states and 49 transitions. [2018-06-22 01:14:27,792 INFO ]: Interpolant automaton has 56 states. [2018-06-22 01:14:27,792 INFO ]: Start isEmpty. Operand 48 states and 49 transitions. [2018-06-22 01:14:27,792 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:14:27,792 INFO ]: Found error trace [2018-06-22 01:14:27,792 INFO ]: trace histogram [13, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:27,792 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:27,792 INFO ]: Analyzing trace with hash 825443987, now seen corresponding path program 34 times [2018-06-22 01:14:27,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:27,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:27,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:27,793 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:27,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:27,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:28,309 INFO ]: Checked inductivity of 235 backedges. 157 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:28,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:28,309 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-22 01:14:28,315 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:28,369 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:28,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:28,373 INFO ]: Computing forward predicates... [2018-06-22 01:14:28,667 INFO ]: Checked inductivity of 235 backedges. 169 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:28,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:28,686 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 54 [2018-06-22 01:14:28,686 INFO ]: Interpolant automaton has 54 states [2018-06-22 01:14:28,686 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 01:14:28,686 INFO ]: CoverageRelationStatistics Valid=461, Invalid=2401, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:14:28,686 INFO ]: Start difference. First operand 48 states and 49 transitions. Second operand 54 states. [2018-06-22 01:14:29,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:29,641 INFO ]: Finished difference Result 51 states and 52 transitions. [2018-06-22 01:14:29,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:14:29,641 INFO ]: Start accepts. Automaton has 54 states. Word has length 47 [2018-06-22 01:14:29,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:29,641 INFO ]: With dead ends: 51 [2018-06-22 01:14:29,641 INFO ]: Without dead ends: 50 [2018-06-22 01:14:29,642 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2013, Invalid=6177, Unknown=0, NotChecked=0, Total=8190 [2018-06-22 01:14:29,642 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:14:29,643 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-06-22 01:14:29,643 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:14:29,643 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-06-22 01:14:29,644 INFO ]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-06-22 01:14:29,644 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:29,644 INFO ]: Abstraction has 49 states and 50 transitions. [2018-06-22 01:14:29,644 INFO ]: Interpolant automaton has 54 states. [2018-06-22 01:14:29,644 INFO ]: Start isEmpty. Operand 49 states and 50 transitions. [2018-06-22 01:14:29,645 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:14:29,645 INFO ]: Found error trace [2018-06-22 01:14:29,645 INFO ]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:29,645 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:29,645 INFO ]: Analyzing trace with hash -121285040, now seen corresponding path program 35 times [2018-06-22 01:14:29,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:29,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:29,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:29,645 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:29,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:29,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:31,116 INFO ]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:31,116 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:31,116 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-22 01:14:31,121 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:31,187 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-22 01:14:31,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:31,193 INFO ]: Computing forward predicates... [2018-06-22 01:14:31,492 INFO ]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:31,511 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:31,511 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-06-22 01:14:31,511 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:14:31,511 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:14:31,511 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:14:31,511 INFO ]: Start difference. First operand 49 states and 50 transitions. Second operand 44 states. [2018-06-22 01:14:33,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:33,194 INFO ]: Finished difference Result 70 states and 73 transitions. [2018-06-22 01:14:33,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:14:33,194 INFO ]: Start accepts. Automaton has 44 states. Word has length 48 [2018-06-22 01:14:33,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:33,195 INFO ]: With dead ends: 70 [2018-06-22 01:14:33,195 INFO ]: Without dead ends: 69 [2018-06-22 01:14:33,195 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 29 SyntacticMatches, 20 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=339, Invalid=6971, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 01:14:33,196 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:14:33,197 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-06-22 01:14:33,197 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:14:33,198 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-06-22 01:14:33,198 INFO ]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2018-06-22 01:14:33,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:33,198 INFO ]: Abstraction has 52 states and 54 transitions. [2018-06-22 01:14:33,198 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:14:33,198 INFO ]: Start isEmpty. Operand 52 states and 54 transitions. [2018-06-22 01:14:33,198 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:14:33,198 INFO ]: Found error trace [2018-06-22 01:14:33,198 INFO ]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:33,198 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:33,198 INFO ]: Analyzing trace with hash 594886195, now seen corresponding path program 36 times [2018-06-22 01:14:33,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:33,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:33,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:33,199 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:33,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:33,212 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:33,765 INFO ]: Checked inductivity of 260 backedges. 66 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:33,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:33,765 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-22 01:14:33,771 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:33,839 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 01:14:33,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:33,843 INFO ]: Computing forward predicates... [2018-06-22 01:14:35,483 INFO ]: Checked inductivity of 260 backedges. 91 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:35,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:35,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 60 [2018-06-22 01:14:35,502 INFO ]: Interpolant automaton has 60 states [2018-06-22 01:14:35,502 INFO ]: Constructing interpolant automaton starting with 60 interpolants. [2018-06-22 01:14:35,502 INFO ]: CoverageRelationStatistics Valid=563, Invalid=2977, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:14:35,502 INFO ]: Start difference. First operand 52 states and 54 transitions. Second operand 60 states. [2018-06-22 01:14:36,310 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:36,310 INFO ]: Finished difference Result 67 states and 69 transitions. [2018-06-22 01:14:36,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:14:36,311 INFO ]: Start accepts. Automaton has 60 states. Word has length 49 [2018-06-22 01:14:36,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:36,311 INFO ]: With dead ends: 67 [2018-06-22 01:14:36,311 INFO ]: Without dead ends: 52 [2018-06-22 01:14:36,311 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2619 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1778, Invalid=8322, Unknown=0, NotChecked=0, Total=10100 [2018-06-22 01:14:36,311 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:14:36,312 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-06-22 01:14:36,312 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:14:36,313 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-06-22 01:14:36,313 INFO ]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 49 [2018-06-22 01:14:36,313 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:36,313 INFO ]: Abstraction has 51 states and 52 transitions. [2018-06-22 01:14:36,313 INFO ]: Interpolant automaton has 60 states. [2018-06-22 01:14:36,313 INFO ]: Start isEmpty. Operand 51 states and 52 transitions. [2018-06-22 01:14:36,313 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 01:14:36,313 INFO ]: Found error trace [2018-06-22 01:14:36,313 INFO ]: trace histogram [14, 14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:36,313 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:36,313 INFO ]: Analyzing trace with hash 474931487, now seen corresponding path program 37 times [2018-06-22 01:14:36,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:36,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:36,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:36,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:36,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:36,329 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:14:37,435 WARN ]: Removed 4 from assertion stack [2018-06-22 01:14:37,435 WARN ]: Verification canceled [2018-06-22 01:14:37,540 WARN ]: Timeout [2018-06-22 01:14:37,540 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:14:37 BoogieIcfgContainer [2018-06-22 01:14:37,540 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:14:37,541 INFO ]: Toolchain (without parser) took 58710.94 ms. Allocated memory was 308.3 MB in the beginning and 793.2 MB in the end (delta: 485.0 MB). Free memory was 262.7 MB in the beginning and 765.2 MB in the end (delta: -502.5 MB). Peak memory consumption was 164.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:37,542 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:14:37,542 INFO ]: ChcToBoogie took 57.29 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:37,542 INFO ]: Boogie Preprocessor took 41.06 ms. Allocated memory is still 308.3 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:14:37,542 INFO ]: RCFGBuilder took 386.07 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 250.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:37,543 INFO ]: TraceAbstraction took 58216.75 ms. Allocated memory was 308.3 MB in the beginning and 793.2 MB in the end (delta: 485.0 MB). Free memory was 250.7 MB in the beginning and 765.2 MB in the end (delta: -514.5 MB). Peak memory consumption was 152.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:37,545 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.29 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.06 ms. Allocated memory is still 308.3 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 386.07 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 250.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58216.75 ms. Allocated memory was 308.3 MB in the beginning and 793.2 MB in the end (delta: 485.0 MB). Free memory was 250.7 MB in the beginning and 765.2 MB in the end (delta: -514.5 MB). Peak memory consumption was 152.5 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 (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 13. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 58.1s OverallTime, 46 OverallIterations, 14 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 433 SDtfs, 1402 SDslu, 5808 SDs, 0 SdLazy, 15784 SolverSat, 2055 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3027 GetRequests, 852 SyntacticMatches, 159 SemanticMatches, 2016 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25376 ImplicationChecksByTransitivity, 41.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=44, 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, 45 MinimizatonAttempts, 210 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 230 NumberOfCheckSat, 2329 ConstructedInterpolants, 0 QuantifiedInterpolants, 394334 SizeOfPredicates, 975 NumberOfNonLiveVariables, 13327 ConjunctsInSsa, 3100 ConjunctsInUnsatCore, 85 InterpolantComputations, 7 PerfectInterpolantSequences, 2305/7134 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/loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-14-37-554.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-14-37-554.csv Completed graceful shutdown