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_No_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 11:01:44,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:01:44,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:01:44,718 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:01:44,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:01:44,719 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:01:44,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:01:44,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:01:44,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:01:44,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:01:44,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:01:44,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:01:44,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:01:44,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:01:44,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:01:44,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:01:44,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:01:44,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:01:44,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:01:44,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:01:44,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:01:44,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:01:44,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:01:44,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:01:44,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:01:44,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:01:44,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:01:44,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:01:44,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:01:44,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:01:44,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:01:44,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:01:44,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:01:44,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:01:44,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:01:44,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:01:44,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:01:44,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:01:44,778 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:01:44,778 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:01:44,779 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:01:44,779 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:01:44,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:01:44,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:01:44,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:01:44,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:01:44,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:01:44,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:01:44,780 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:01:44,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:01:44,781 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:01:44,781 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:01:44,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:01:44,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:01:44,782 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:01:44,785 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:01:44,785 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:01:44,842 INFO ]: Repository-Root is: /tmp [2018-06-22 11:01:44,856 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:01:44,861 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:01:44,862 INFO ]: Initializing SmtParser... [2018-06-22 11:01:44,862 INFO ]: SmtParser initialized [2018-06-22 11:01:44,864 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 [2018-06-22 11:01:44,865 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 11:01:44,956 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 unknown [2018-06-22 11:01:45,126 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_merged_safe.c-1.smt2 [2018-06-22 11:01:45,130 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:01:45,137 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:01:45,137 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:01:45,137 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:01:45,137 INFO ]: ChcToBoogie initialized [2018-06-22 11:01:45,140 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,178 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45 Unit [2018-06-22 11:01:45,178 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:01:45,179 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:01:45,179 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:01:45,179 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:01:45,204 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,204 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,212 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,212 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,214 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,216 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,218 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... [2018-06-22 11:01:45,219 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:01:45,220 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:01:45,220 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:01:45,220 INFO ]: RCFGBuilder initialized [2018-06-22 11:01:45,220 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure False [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure False [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure inv_main15 given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure inv_main15 [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure inv_main15 [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure inv_main8 given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure inv_main8 [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure inv_main8 [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure inv_main5 given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure inv_main5 [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure inv_main5 [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure inv_main12 given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure inv_main12 [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure inv_main12 [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure inv_main11 given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure inv_main11 [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure inv_main11 [2018-06-22 11:01:45,233 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:01:45,233 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:01:45,233 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:01:45,521 INFO ]: Using library mode [2018-06-22 11:01:45,524 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:01:45 BoogieIcfgContainer [2018-06-22 11:01:45,524 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:01:45,525 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:01:45,525 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:01:45,527 INFO ]: TraceAbstraction initialized [2018-06-22 11:01:45,527 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:01:45" (1/3) ... [2018-06-22 11:01:45,528 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d7900d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:01:45, skipping insertion in model container [2018-06-22 11:01:45,528 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:01:45" (2/3) ... [2018-06-22 11:01:45,528 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d7900d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:01:45, skipping insertion in model container [2018-06-22 11:01:45,528 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:01:45" (3/3) ... [2018-06-22 11:01:45,530 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:01:45,539 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:01:45,547 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:01:45,586 INFO ]: Using default assertion order modulation [2018-06-22 11:01:45,586 INFO ]: Interprodecural is true [2018-06-22 11:01:45,586 INFO ]: Hoare is false [2018-06-22 11:01:45,586 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:01:45,586 INFO ]: Backedges is TWOTRACK [2018-06-22 11:01:45,587 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:01:45,587 INFO ]: Difference is false [2018-06-22 11:01:45,587 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:01:45,587 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:01:45,600 INFO ]: Start isEmpty. Operand 33 states. [2018-06-22 11:01:45,610 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:01:45,610 INFO ]: Found error trace [2018-06-22 11:01:45,610 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:45,610 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:45,614 INFO ]: Analyzing trace with hash -1594673137, now seen corresponding path program 1 times [2018-06-22 11:01:45,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:45,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:45,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:45,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:45,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:45,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:45,899 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:01:45,902 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:01:45,902 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:01:45,904 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:01:45,915 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:01:45,916 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:01:45,917 INFO ]: Start difference. First operand 33 states. Second operand 6 states. [2018-06-22 11:01:46,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:46,150 INFO ]: Finished difference Result 33 states and 41 transitions. [2018-06-22 11:01:46,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:01:46,152 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:01:46,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:46,160 INFO ]: With dead ends: 33 [2018-06-22 11:01:46,160 INFO ]: Without dead ends: 32 [2018-06-22 11:01:46,162 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:01:46,176 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:01:46,209 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:01:46,211 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:01:46,213 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-06-22 11:01:46,215 INFO ]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-06-22 11:01:46,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:46,215 INFO ]: Abstraction has 30 states and 37 transitions. [2018-06-22 11:01:46,215 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:01:46,215 INFO ]: Start isEmpty. Operand 30 states and 37 transitions. [2018-06-22 11:01:46,217 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:01:46,217 INFO ]: Found error trace [2018-06-22 11:01:46,217 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:46,217 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:46,217 INFO ]: Analyzing trace with hash -806484195, now seen corresponding path program 1 times [2018-06-22 11:01:46,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:46,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:46,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:46,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:46,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:46,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:46,510 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 11:01:46,571 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:01:46,571 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:01:46,571 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:01:46,573 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:01:46,573 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:01:46,573 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:01:46,573 INFO ]: Start difference. First operand 30 states and 37 transitions. Second operand 6 states. [2018-06-22 11:01:46,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:46,689 INFO ]: Finished difference Result 32 states and 39 transitions. [2018-06-22 11:01:46,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:01:46,691 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:01:46,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:46,692 INFO ]: With dead ends: 32 [2018-06-22 11:01:46,692 INFO ]: Without dead ends: 32 [2018-06-22 11:01:46,693 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:01:46,693 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:01:46,703 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:01:46,703 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:01:46,704 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-06-22 11:01:46,704 INFO ]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 17 [2018-06-22 11:01:46,704 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:46,704 INFO ]: Abstraction has 32 states and 39 transitions. [2018-06-22 11:01:46,704 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:01:46,704 INFO ]: Start isEmpty. Operand 32 states and 39 transitions. [2018-06-22 11:01:46,705 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:01:46,705 INFO ]: Found error trace [2018-06-22 11:01:46,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:46,705 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:46,706 INFO ]: Analyzing trace with hash 898252184, now seen corresponding path program 1 times [2018-06-22 11:01:46,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:46,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:46,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:46,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:46,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:46,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:47,089 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:01:47,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:01:47,089 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:01:47,089 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:01:47,089 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:01:47,089 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:01:47,090 INFO ]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-06-22 11:01:47,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:47,234 INFO ]: Finished difference Result 36 states and 42 transitions. [2018-06-22 11:01:47,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:01:47,234 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:01:47,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:47,235 INFO ]: With dead ends: 36 [2018-06-22 11:01:47,235 INFO ]: Without dead ends: 31 [2018-06-22 11:01:47,236 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:01:47,236 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:01:47,240 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:01:47,240 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:01:47,242 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-06-22 11:01:47,242 INFO ]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 17 [2018-06-22 11:01:47,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:47,243 INFO ]: Abstraction has 29 states and 34 transitions. [2018-06-22 11:01:47,243 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:01:47,243 INFO ]: Start isEmpty. Operand 29 states and 34 transitions. [2018-06-22 11:01:47,244 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:01:47,244 INFO ]: Found error trace [2018-06-22 11:01:47,244 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:47,244 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:47,244 INFO ]: Analyzing trace with hash 1444113557, now seen corresponding path program 1 times [2018-06-22 11:01:47,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:47,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:47,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:47,245 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:47,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:47,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:47,355 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:01:47,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:01:47,355 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:01:47,355 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:01:47,355 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:01:47,355 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:01:47,355 INFO ]: Start difference. First operand 29 states and 34 transitions. Second operand 7 states. [2018-06-22 11:01:47,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:47,431 INFO ]: Finished difference Result 33 states and 39 transitions. [2018-06-22 11:01:47,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:01:47,432 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:01:47,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:47,445 INFO ]: With dead ends: 33 [2018-06-22 11:01:47,445 INFO ]: Without dead ends: 33 [2018-06-22 11:01:47,445 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:01:47,445 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:01:47,453 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:01:47,453 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:01:47,454 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-22 11:01:47,454 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-06-22 11:01:47,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:47,454 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-22 11:01:47,454 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:01:47,454 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-22 11:01:47,455 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:01:47,455 INFO ]: Found error trace [2018-06-22 11:01:47,455 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:47,455 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:47,455 INFO ]: Analyzing trace with hash -1195949286, now seen corresponding path program 1 times [2018-06-22 11:01:47,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:47,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:47,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:47,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:47,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:47,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:47,941 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:01:47,941 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:01:47,941 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:01:47,942 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:01:47,942 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:01:47,942 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:01:47,942 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 7 states. [2018-06-22 11:01:48,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:48,052 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-22 11:01:48,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:01:48,053 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:01:48,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:48,054 INFO ]: With dead ends: 31 [2018-06-22 11:01:48,054 INFO ]: Without dead ends: 30 [2018-06-22 11:01:48,054 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:01:48,054 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:01:48,057 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:01:48,057 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:01:48,058 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:01:48,058 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2018-06-22 11:01:48,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:48,058 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:01:48,058 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:01:48,058 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:01:48,059 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:01:48,059 INFO ]: Found error trace [2018-06-22 11:01:48,059 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:48,059 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:48,060 INFO ]: Analyzing trace with hash -1938291525, now seen corresponding path program 1 times [2018-06-22 11:01:48,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:48,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:48,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:48,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:48,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:48,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:48,264 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:01:48,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:48,265 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 11:01:48,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:48,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:48,331 INFO ]: Computing forward predicates... [2018-06-22 11:01:48,664 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 11:01:48,893 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:01:48,924 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:48,924 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 11:01:48,925 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:01:48,925 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:01:48,925 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:01:48,925 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 16 states. [2018-06-22 11:01:49,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:49,264 INFO ]: Finished difference Result 40 states and 44 transitions. [2018-06-22 11:01:49,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:01:49,264 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:01:49,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:49,265 INFO ]: With dead ends: 40 [2018-06-22 11:01:49,265 INFO ]: Without dead ends: 38 [2018-06-22 11:01:49,266 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:01:49,266 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:01:49,270 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:01:49,270 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:01:49,271 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 11:01:49,271 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2018-06-22 11:01:49,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:49,271 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 11:01:49,271 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:01:49,271 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 11:01:49,272 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:01:49,272 INFO ]: Found error trace [2018-06-22 11:01:49,273 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:49,273 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:49,273 INFO ]: Analyzing trace with hash -1629209443, now seen corresponding path program 1 times [2018-06-22 11:01:49,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:49,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:49,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:49,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:49,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:49,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:49,423 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:01:49,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:49,423 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 11:01:49,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:49,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:49,472 INFO ]: Computing forward predicates... [2018-06-22 11:01:49,690 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:01:49,711 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:49,711 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 11:01:49,728 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:01:49,728 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:01:49,728 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:01:49,728 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 15 states. [2018-06-22 11:01:50,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:50,113 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:01:50,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:01:50,114 INFO ]: Start accepts. Automaton has 15 states. Word has length 33 [2018-06-22 11:01:50,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:50,115 INFO ]: With dead ends: 42 [2018-06-22 11:01:50,115 INFO ]: Without dead ends: 42 [2018-06-22 11:01:50,115 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:01:50,115 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:01:50,119 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-06-22 11:01:50,119 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:01:50,120 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:01:50,120 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 33 [2018-06-22 11:01:50,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:50,120 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:01:50,120 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:01:50,120 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:01:50,122 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:01:50,122 INFO ]: Found error trace [2018-06-22 11:01:50,122 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:50,122 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:50,123 INFO ]: Analyzing trace with hash -493274399, now seen corresponding path program 2 times [2018-06-22 11:01:50,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:50,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:50,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:50,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:50,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:50,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:50,259 INFO ]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:01:50,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:50,260 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) [2018-06-22 11:01:50,276 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:50,303 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:01:50,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:50,306 INFO ]: Computing forward predicates... [2018-06-22 11:01:50,361 INFO ]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:01:50,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:50,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 11:01:50,382 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:01:50,382 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:01:50,382 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:01:50,382 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 13 states. [2018-06-22 11:01:50,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:50,504 INFO ]: Finished difference Result 42 states and 45 transitions. [2018-06-22 11:01:50,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:01:50,505 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 11:01:50,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:50,506 INFO ]: With dead ends: 42 [2018-06-22 11:01:50,506 INFO ]: Without dead ends: 36 [2018-06-22 11:01:50,506 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:01:50,506 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:01:50,510 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:01:50,510 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:01:50,510 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:01:50,510 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 37 [2018-06-22 11:01:50,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:50,511 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:01:50,511 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:01:50,511 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:01:50,512 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:01:50,512 INFO ]: Found error trace [2018-06-22 11:01:50,512 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:50,512 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:50,512 INFO ]: Analyzing trace with hash -1211571645, now seen corresponding path program 2 times [2018-06-22 11:01:50,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:50,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:50,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:50,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:50,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:50,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:50,747 INFO ]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:01:50,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:50,747 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 11:01:50,753 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:01:50,774 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:01:50,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:50,777 INFO ]: Computing forward predicates... [2018-06-22 11:01:51,163 INFO ]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:01:51,182 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:51,182 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2018-06-22 11:01:51,182 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:01:51,183 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:01:51,183 INFO ]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:01:51,183 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 26 states. [2018-06-22 11:01:51,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:51,629 INFO ]: Finished difference Result 50 states and 54 transitions. [2018-06-22 11:01:51,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:01:51,630 INFO ]: Start accepts. Automaton has 26 states. Word has length 41 [2018-06-22 11:01:51,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:51,631 INFO ]: With dead ends: 50 [2018-06-22 11:01:51,631 INFO ]: Without dead ends: 48 [2018-06-22 11:01:51,632 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:01:51,632 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:01:51,637 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-06-22 11:01:51,637 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:01:51,638 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-06-22 11:01:51,638 INFO ]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 41 [2018-06-22 11:01:51,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:51,638 INFO ]: Abstraction has 42 states and 46 transitions. [2018-06-22 11:01:51,638 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:01:51,638 INFO ]: Start isEmpty. Operand 42 states and 46 transitions. [2018-06-22 11:01:51,639 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:01:51,639 INFO ]: Found error trace [2018-06-22 11:01:51,640 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:51,640 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:51,640 INFO ]: Analyzing trace with hash 1282604325, now seen corresponding path program 3 times [2018-06-22 11:01:51,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:51,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:51,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:51,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:51,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:51,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:51,934 INFO ]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:01:51,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:51,934 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 11:01:51,940 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:01:51,994 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:01:51,994 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:51,998 INFO ]: Computing forward predicates... [2018-06-22 11:01:52,088 INFO ]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:01:52,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:52,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 20 [2018-06-22 11:01:52,107 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:01:52,107 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:01:52,107 INFO ]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:01:52,108 INFO ]: Start difference. First operand 42 states and 46 transitions. Second operand 20 states. [2018-06-22 11:01:52,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:52,398 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-22 11:01:52,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:01:52,398 INFO ]: Start accepts. Automaton has 20 states. Word has length 45 [2018-06-22 11:01:52,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:52,399 INFO ]: With dead ends: 52 [2018-06-22 11:01:52,399 INFO ]: Without dead ends: 52 [2018-06-22 11:01:52,400 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:01:52,400 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:01:52,404 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-06-22 11:01:52,404 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:01:52,405 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 11:01:52,405 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 45 [2018-06-22 11:01:52,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:52,406 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 11:01:52,406 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:01:52,406 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 11:01:52,407 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:01:52,407 INFO ]: Found error trace [2018-06-22 11:01:52,407 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:52,407 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:52,407 INFO ]: Analyzing trace with hash 1358816745, now seen corresponding path program 4 times [2018-06-22 11:01:52,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:52,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:52,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:52,408 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:52,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:52,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:52,537 INFO ]: Checked inductivity of 36 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:01:52,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:52,538 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 11:01:52,545 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:01:52,581 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:01:52,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:52,585 INFO ]: Computing forward predicates... [2018-06-22 11:01:52,724 INFO ]: Checked inductivity of 36 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:01:52,754 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:52,754 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-22 11:01:52,755 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:01:52,755 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:01:52,755 INFO ]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:01:52,755 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 19 states. [2018-06-22 11:01:52,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:52,913 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 11:01:52,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:01:52,914 INFO ]: Start accepts. Automaton has 19 states. Word has length 49 [2018-06-22 11:01:52,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:52,915 INFO ]: With dead ends: 52 [2018-06-22 11:01:52,915 INFO ]: Without dead ends: 42 [2018-06-22 11:01:52,916 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:01:52,916 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:01:52,920 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:01:52,920 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:01:52,920 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:01:52,920 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 49 [2018-06-22 11:01:52,921 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:52,921 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:01:52,921 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:01:52,921 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:01:52,922 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:01:52,922 INFO ]: Found error trace [2018-06-22 11:01:52,922 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:52,922 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:52,922 INFO ]: Analyzing trace with hash -629329845, now seen corresponding path program 5 times [2018-06-22 11:01:52,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:52,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:52,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:52,923 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:52,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:52,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:53,354 INFO ]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:01:53,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:53,354 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 11:01:53,362 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:01:53,386 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:01:53,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:53,390 INFO ]: Computing forward predicates... [2018-06-22 11:01:54,011 INFO ]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:01:54,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:54,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2018-06-22 11:01:54,030 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:01:54,030 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:01:54,030 INFO ]: CoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:01:54,030 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 32 states. [2018-06-22 11:01:54,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:54,514 INFO ]: Finished difference Result 60 states and 64 transitions. [2018-06-22 11:01:54,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:01:54,515 INFO ]: Start accepts. Automaton has 32 states. Word has length 53 [2018-06-22 11:01:54,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:54,518 INFO ]: With dead ends: 60 [2018-06-22 11:01:54,518 INFO ]: Without dead ends: 58 [2018-06-22 11:01:54,518 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=1437, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:01:54,518 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:01:54,523 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-06-22 11:01:54,523 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:01:54,524 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-22 11:01:54,524 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 53 [2018-06-22 11:01:54,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:54,524 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-22 11:01:54,524 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:01:54,524 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-22 11:01:54,525 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:01:54,525 INFO ]: Found error trace [2018-06-22 11:01:54,525 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:54,525 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:54,525 INFO ]: Analyzing trace with hash 277089837, now seen corresponding path program 6 times [2018-06-22 11:01:54,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:54,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:54,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:54,526 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:54,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:54,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:55,400 INFO ]: Checked inductivity of 54 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:01:55,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:55,400 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 11:01:55,406 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:01:55,431 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 11:01:55,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:55,434 INFO ]: Computing forward predicates... [2018-06-22 11:01:55,593 INFO ]: Checked inductivity of 54 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:01:55,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:55,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 24 [2018-06-22 11:01:55,620 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:01:55,620 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:01:55,620 INFO ]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:01:55,620 INFO ]: Start difference. First operand 48 states and 52 transitions. Second operand 24 states. [2018-06-22 11:01:55,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:55,949 INFO ]: Finished difference Result 62 states and 66 transitions. [2018-06-22 11:01:55,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:01:55,949 INFO ]: Start accepts. Automaton has 24 states. Word has length 57 [2018-06-22 11:01:55,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:55,950 INFO ]: With dead ends: 62 [2018-06-22 11:01:55,950 INFO ]: Without dead ends: 62 [2018-06-22 11:01:55,951 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:01:55,951 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:01:55,955 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-06-22 11:01:55,955 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:01:55,956 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-06-22 11:01:55,956 INFO ]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 57 [2018-06-22 11:01:55,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:55,957 INFO ]: Abstraction has 46 states and 49 transitions. [2018-06-22 11:01:55,957 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:01:55,957 INFO ]: Start isEmpty. Operand 46 states and 49 transitions. [2018-06-22 11:01:55,958 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:01:55,958 INFO ]: Found error trace [2018-06-22 11:01:55,958 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:55,958 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:55,958 INFO ]: Analyzing trace with hash 753631601, now seen corresponding path program 7 times [2018-06-22 11:01:55,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:55,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:55,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:55,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:55,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:55,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:56,324 INFO ]: Checked inductivity of 70 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:01:56,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:56,325 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 11:01:56,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:56,355 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:56,359 INFO ]: Computing forward predicates... [2018-06-22 11:01:56,465 INFO ]: Checked inductivity of 70 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:01:56,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:56,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 23 [2018-06-22 11:01:56,494 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:01:56,494 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:01:56,494 INFO ]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:01:56,494 INFO ]: Start difference. First operand 46 states and 49 transitions. Second operand 23 states. [2018-06-22 11:01:56,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:56,789 INFO ]: Finished difference Result 62 states and 65 transitions. [2018-06-22 11:01:56,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:01:56,792 INFO ]: Start accepts. Automaton has 23 states. Word has length 61 [2018-06-22 11:01:56,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:56,793 INFO ]: With dead ends: 62 [2018-06-22 11:01:56,793 INFO ]: Without dead ends: 48 [2018-06-22 11:01:56,794 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:01:56,794 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:01:56,797 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 11:01:56,797 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:01:56,798 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-06-22 11:01:56,798 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 61 [2018-06-22 11:01:56,798 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:56,799 INFO ]: Abstraction has 48 states and 51 transitions. [2018-06-22 11:01:56,799 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:01:56,799 INFO ]: Start isEmpty. Operand 48 states and 51 transitions. [2018-06-22 11:01:56,799 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:01:56,799 INFO ]: Found error trace [2018-06-22 11:01:56,799 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:56,800 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:56,800 INFO ]: Analyzing trace with hash 545869523, now seen corresponding path program 8 times [2018-06-22 11:01:56,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:56,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:56,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:56,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:56,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:56,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:57,235 INFO ]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:01:57,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:57,235 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 11:01:57,241 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:01:57,266 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:01:57,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:57,271 INFO ]: Computing forward predicates... [2018-06-22 11:01:57,783 INFO ]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:01:57,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:57,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-06-22 11:01:57,805 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:01:57,805 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:01:57,805 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:01:57,805 INFO ]: Start difference. First operand 48 states and 51 transitions. Second operand 38 states. [2018-06-22 11:01:58,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:58,619 INFO ]: Finished difference Result 70 states and 74 transitions. [2018-06-22 11:01:58,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:01:58,622 INFO ]: Start accepts. Automaton has 38 states. Word has length 65 [2018-06-22 11:01:58,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:58,623 INFO ]: With dead ends: 70 [2018-06-22 11:01:58,623 INFO ]: Without dead ends: 68 [2018-06-22 11:01:58,624 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=2105, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:01:58,624 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:01:58,633 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-06-22 11:01:58,633 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:01:58,633 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-06-22 11:01:58,633 INFO ]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 65 [2018-06-22 11:01:58,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:58,634 INFO ]: Abstraction has 54 states and 58 transitions. [2018-06-22 11:01:58,634 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:01:58,634 INFO ]: Start isEmpty. Operand 54 states and 58 transitions. [2018-06-22 11:01:58,634 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:01:58,634 INFO ]: Found error trace [2018-06-22 11:01:58,635 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:58,635 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:58,638 INFO ]: Analyzing trace with hash -942420043, now seen corresponding path program 9 times [2018-06-22 11:01:58,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:58,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:58,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:58,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:58,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:58,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:59,085 INFO ]: Checked inductivity of 96 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:01:59,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:59,085 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 11:01:59,097 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:01:59,183 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:01:59,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:59,187 INFO ]: Computing forward predicates... [2018-06-22 11:01:59,312 INFO ]: Checked inductivity of 96 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:01:59,334 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:59,334 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 28 [2018-06-22 11:01:59,334 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:01:59,334 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:01:59,334 INFO ]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:01:59,335 INFO ]: Start difference. First operand 54 states and 58 transitions. Second operand 28 states. [2018-06-22 11:01:59,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:59,625 INFO ]: Finished difference Result 72 states and 76 transitions. [2018-06-22 11:01:59,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:01:59,625 INFO ]: Start accepts. Automaton has 28 states. Word has length 69 [2018-06-22 11:01:59,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:59,626 INFO ]: With dead ends: 72 [2018-06-22 11:01:59,626 INFO ]: Without dead ends: 72 [2018-06-22 11:01:59,627 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:01:59,627 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:01:59,631 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-06-22 11:01:59,631 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:01:59,632 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-06-22 11:01:59,632 INFO ]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 69 [2018-06-22 11:01:59,632 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:59,632 INFO ]: Abstraction has 52 states and 55 transitions. [2018-06-22 11:01:59,632 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:01:59,632 INFO ]: Start isEmpty. Operand 52 states and 55 transitions. [2018-06-22 11:01:59,633 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:01:59,633 INFO ]: Found error trace [2018-06-22 11:01:59,633 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:59,633 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:59,633 INFO ]: Analyzing trace with hash 612789625, now seen corresponding path program 10 times [2018-06-22 11:01:59,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:59,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:59,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:59,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:59,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:59,643 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:59,832 INFO ]: Checked inductivity of 116 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 11:01:59,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:59,832 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 11:01:59,838 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:01:59,865 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:01:59,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:59,869 INFO ]: Computing forward predicates... [2018-06-22 11:02:00,016 INFO ]: Checked inductivity of 116 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:02:00,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:00,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 27 [2018-06-22 11:02:00,041 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:02:00,041 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:02:00,042 INFO ]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:02:00,042 INFO ]: Start difference. First operand 52 states and 55 transitions. Second operand 27 states. [2018-06-22 11:02:00,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:00,323 INFO ]: Finished difference Result 72 states and 75 transitions. [2018-06-22 11:02:00,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:02:00,323 INFO ]: Start accepts. Automaton has 27 states. Word has length 73 [2018-06-22 11:02:00,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:00,324 INFO ]: With dead ends: 72 [2018-06-22 11:02:00,324 INFO ]: Without dead ends: 54 [2018-06-22 11:02:00,324 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:02:00,325 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:02:00,328 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 11:02:00,328 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:02:00,329 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-06-22 11:02:00,329 INFO ]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 73 [2018-06-22 11:02:00,334 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:00,334 INFO ]: Abstraction has 54 states and 57 transitions. [2018-06-22 11:02:00,334 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:02:00,334 INFO ]: Start isEmpty. Operand 54 states and 57 transitions. [2018-06-22 11:02:00,334 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:02:00,334 INFO ]: Found error trace [2018-06-22 11:02:00,335 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:00,335 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:00,335 INFO ]: Analyzing trace with hash -1797677605, now seen corresponding path program 11 times [2018-06-22 11:02:00,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:00,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:00,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:00,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:00,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:00,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:00,869 INFO ]: Checked inductivity of 131 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:02:00,869 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:00,869 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 11:02:00,875 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:00,906 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:02:00,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:00,910 INFO ]: Computing forward predicates... [2018-06-22 11:02:01,503 INFO ]: Checked inductivity of 131 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:02:01,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:01,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2018-06-22 11:02:01,523 INFO ]: Interpolant automaton has 44 states [2018-06-22 11:02:01,523 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 11:02:01,524 INFO ]: CoverageRelationStatistics Valid=99, Invalid=1793, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:02:01,524 INFO ]: Start difference. First operand 54 states and 57 transitions. Second operand 44 states. [2018-06-22 11:02:02,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:02,241 INFO ]: Finished difference Result 80 states and 84 transitions. [2018-06-22 11:02:02,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:02:02,242 INFO ]: Start accepts. Automaton has 44 states. Word has length 77 [2018-06-22 11:02:02,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:02,242 INFO ]: With dead ends: 80 [2018-06-22 11:02:02,242 INFO ]: Without dead ends: 78 [2018-06-22 11:02:02,243 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=2901, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:02:02,243 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 11:02:02,247 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 60. [2018-06-22 11:02:02,247 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:02:02,248 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-06-22 11:02:02,248 INFO ]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 77 [2018-06-22 11:02:02,248 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:02,248 INFO ]: Abstraction has 60 states and 64 transitions. [2018-06-22 11:02:02,248 INFO ]: Interpolant automaton has 44 states. [2018-06-22 11:02:02,248 INFO ]: Start isEmpty. Operand 60 states and 64 transitions. [2018-06-22 11:02:02,251 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:02:02,251 INFO ]: Found error trace [2018-06-22 11:02:02,251 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:02,251 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:02,251 INFO ]: Analyzing trace with hash -1340694083, now seen corresponding path program 12 times [2018-06-22 11:02:02,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:02,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:02,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:02,252 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:02,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:02,265 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:03,015 INFO ]: Checked inductivity of 150 backedges. 12 proven. 76 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:02:03,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:03,015 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 11:02:03,021 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:03,056 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:02:03,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:03,059 INFO ]: Computing forward predicates... [2018-06-22 11:02:03,222 INFO ]: Checked inductivity of 150 backedges. 20 proven. 64 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:02:03,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:03,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 32 [2018-06-22 11:02:03,242 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:02:03,242 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:02:03,242 INFO ]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:02:03,242 INFO ]: Start difference. First operand 60 states and 64 transitions. Second operand 32 states. [2018-06-22 11:02:03,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:03,930 INFO ]: Finished difference Result 82 states and 86 transitions. [2018-06-22 11:02:03,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:02:03,930 INFO ]: Start accepts. Automaton has 32 states. Word has length 81 [2018-06-22 11:02:03,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:03,931 INFO ]: With dead ends: 82 [2018-06-22 11:02:03,931 INFO ]: Without dead ends: 82 [2018-06-22 11:02:03,932 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:02:03,932 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:02:03,939 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 58. [2018-06-22 11:02:03,939 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:02:03,939 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-06-22 11:02:03,939 INFO ]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 81 [2018-06-22 11:02:03,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:03,940 INFO ]: Abstraction has 58 states and 61 transitions. [2018-06-22 11:02:03,940 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:02:03,940 INFO ]: Start isEmpty. Operand 58 states and 61 transitions. [2018-06-22 11:02:03,940 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:02:03,940 INFO ]: Found error trace [2018-06-22 11:02:03,941 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:03,941 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:03,941 INFO ]: Analyzing trace with hash 2028669441, now seen corresponding path program 13 times [2018-06-22 11:02:03,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:03,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:03,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:03,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:03,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:03,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:04,479 INFO ]: Checked inductivity of 174 backedges. 72 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 11:02:04,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:04,479 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 11:02:04,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:04,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:04,521 INFO ]: Computing forward predicates... [2018-06-22 11:02:04,644 INFO ]: Checked inductivity of 174 backedges. 72 proven. 25 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 11:02:04,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:04,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 31 [2018-06-22 11:02:04,663 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:02:04,663 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:02:04,663 INFO ]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:02:04,664 INFO ]: Start difference. First operand 58 states and 61 transitions. Second operand 31 states. [2018-06-22 11:02:04,923 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:04,923 INFO ]: Finished difference Result 82 states and 85 transitions. [2018-06-22 11:02:04,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:02:04,923 INFO ]: Start accepts. Automaton has 31 states. Word has length 85 [2018-06-22 11:02:04,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:04,924 INFO ]: With dead ends: 82 [2018-06-22 11:02:04,924 INFO ]: Without dead ends: 60 [2018-06-22 11:02:04,925 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:02:04,925 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:02:04,928 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 11:02:04,928 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:02:04,930 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-06-22 11:02:04,930 INFO ]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 85 [2018-06-22 11:02:04,931 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:04,931 INFO ]: Abstraction has 60 states and 63 transitions. [2018-06-22 11:02:04,931 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:02:04,931 INFO ]: Start isEmpty. Operand 60 states and 63 transitions. [2018-06-22 11:02:04,931 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:02:04,931 INFO ]: Found error trace [2018-06-22 11:02:04,932 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:04,932 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:04,932 INFO ]: Analyzing trace with hash 1465023843, now seen corresponding path program 14 times [2018-06-22 11:02:04,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:04,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:04,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:04,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:04,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:04,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:06,024 INFO ]: Checked inductivity of 193 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:02:06,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:06,024 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 11:02:06,029 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:06,063 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:06,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:06,068 INFO ]: Computing forward predicates... [2018-06-22 11:02:07,190 INFO ]: Checked inductivity of 193 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:02:07,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:07,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2018-06-22 11:02:07,210 INFO ]: Interpolant automaton has 50 states [2018-06-22 11:02:07,210 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 11:02:07,210 INFO ]: CoverageRelationStatistics Valid=113, Invalid=2337, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:02:07,211 INFO ]: Start difference. First operand 60 states and 63 transitions. Second operand 50 states. [2018-06-22 11:02:08,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:08,242 INFO ]: Finished difference Result 90 states and 94 transitions. [2018-06-22 11:02:08,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:02:08,242 INFO ]: Start accepts. Automaton has 50 states. Word has length 89 [2018-06-22 11:02:08,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:08,243 INFO ]: With dead ends: 90 [2018-06-22 11:02:08,243 INFO ]: Without dead ends: 88 [2018-06-22 11:02:08,244 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=207, Invalid=3825, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:02:08,244 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:02:08,251 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-06-22 11:02:08,251 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:02:08,252 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-06-22 11:02:08,252 INFO ]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 89 [2018-06-22 11:02:08,252 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:08,252 INFO ]: Abstraction has 66 states and 70 transitions. [2018-06-22 11:02:08,252 INFO ]: Interpolant automaton has 50 states. [2018-06-22 11:02:08,252 INFO ]: Start isEmpty. Operand 66 states and 70 transitions. [2018-06-22 11:02:08,253 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:02:08,253 INFO ]: Found error trace [2018-06-22 11:02:08,253 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:08,253 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:08,253 INFO ]: Analyzing trace with hash 502850629, now seen corresponding path program 15 times [2018-06-22 11:02:08,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:08,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:08,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,254 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:08,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:08,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,630 INFO ]: Checked inductivity of 216 backedges. 20 proven. 104 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 11:02:08,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:08,630 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) [2018-06-22 11:02:08,641 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:02:08,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:02:08,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:08,810 INFO ]: Computing forward predicates... [2018-06-22 11:02:09,172 INFO ]: Checked inductivity of 216 backedges. 30 proven. 89 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 11:02:09,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:09,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 36 [2018-06-22 11:02:09,191 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:02:09,191 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:02:09,191 INFO ]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:02:09,192 INFO ]: Start difference. First operand 66 states and 70 transitions. Second operand 36 states. [2018-06-22 11:02:09,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:09,646 INFO ]: Finished difference Result 92 states and 96 transitions. [2018-06-22 11:02:09,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:02:09,647 INFO ]: Start accepts. Automaton has 36 states. Word has length 93 [2018-06-22 11:02:09,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:09,648 INFO ]: With dead ends: 92 [2018-06-22 11:02:09,648 INFO ]: Without dead ends: 92 [2018-06-22 11:02:09,649 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=2197, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:02:09,649 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 11:02:09,653 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-06-22 11:02:09,653 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:02:09,653 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-06-22 11:02:09,653 INFO ]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 93 [2018-06-22 11:02:09,654 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:09,654 INFO ]: Abstraction has 64 states and 67 transitions. [2018-06-22 11:02:09,654 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:02:09,654 INFO ]: Start isEmpty. Operand 64 states and 67 transitions. [2018-06-22 11:02:09,654 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:02:09,654 INFO ]: Found error trace [2018-06-22 11:02:09,654 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:09,654 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:09,654 INFO ]: Analyzing trace with hash 875411209, now seen corresponding path program 16 times [2018-06-22 11:02:09,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:09,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:09,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:09,655 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:09,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:09,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:10,083 INFO ]: Checked inductivity of 244 backedges. 98 proven. 40 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:02:10,083 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:10,083 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 11:02:10,093 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:10,128 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:10,128 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:10,132 INFO ]: Computing forward predicates... [2018-06-22 11:02:10,849 INFO ]: Checked inductivity of 244 backedges. 98 proven. 36 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-22 11:02:10,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:10,881 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 35 [2018-06-22 11:02:10,881 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:02:10,882 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:02:10,882 INFO ]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:02:10,882 INFO ]: Start difference. First operand 64 states and 67 transitions. Second operand 35 states. [2018-06-22 11:02:11,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:11,719 INFO ]: Finished difference Result 92 states and 95 transitions. [2018-06-22 11:02:11,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:02:11,719 INFO ]: Start accepts. Automaton has 35 states. Word has length 97 [2018-06-22 11:02:11,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:11,720 INFO ]: With dead ends: 92 [2018-06-22 11:02:11,720 INFO ]: Without dead ends: 66 [2018-06-22 11:02:11,720 INFO ]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=342, Invalid=2108, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:02:11,720 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:02:11,724 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:02:11,724 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:02:11,724 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-06-22 11:02:11,725 INFO ]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 97 [2018-06-22 11:02:11,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:11,725 INFO ]: Abstraction has 66 states and 69 transitions. [2018-06-22 11:02:11,725 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:02:11,725 INFO ]: Start isEmpty. Operand 66 states and 69 transitions. [2018-06-22 11:02:11,725 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:02:11,725 INFO ]: Found error trace [2018-06-22 11:02:11,725 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:11,725 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:11,726 INFO ]: Analyzing trace with hash 1389383019, now seen corresponding path program 17 times [2018-06-22 11:02:11,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:11,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:11,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:11,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:11,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:11,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:12,633 INFO ]: Checked inductivity of 267 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-06-22 11:02:12,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:12,633 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 11:02:12,638 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:12,682 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:02:12,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:12,688 INFO ]: Computing forward predicates... [2018-06-22 11:02:13,517 INFO ]: Checked inductivity of 267 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-06-22 11:02:13,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:13,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2018-06-22 11:02:13,537 INFO ]: Interpolant automaton has 56 states [2018-06-22 11:02:13,537 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 11:02:13,538 INFO ]: CoverageRelationStatistics Valid=127, Invalid=2953, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:02:13,538 INFO ]: Start difference. First operand 66 states and 69 transitions. Second operand 56 states. [2018-06-22 11:02:14,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:14,779 INFO ]: Finished difference Result 100 states and 104 transitions. [2018-06-22 11:02:14,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:02:14,779 INFO ]: Start accepts. Automaton has 56 states. Word has length 101 [2018-06-22 11:02:14,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:14,780 INFO ]: With dead ends: 100 [2018-06-22 11:02:14,780 INFO ]: Without dead ends: 98 [2018-06-22 11:02:14,781 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 76 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=235, Invalid=4877, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 11:02:14,781 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:02:14,786 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-06-22 11:02:14,786 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:02:14,786 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-06-22 11:02:14,787 INFO ]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 101 [2018-06-22 11:02:14,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:14,787 INFO ]: Abstraction has 72 states and 76 transitions. [2018-06-22 11:02:14,787 INFO ]: Interpolant automaton has 56 states. [2018-06-22 11:02:14,787 INFO ]: Start isEmpty. Operand 72 states and 76 transitions. [2018-06-22 11:02:14,788 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:02:14,788 INFO ]: Found error trace [2018-06-22 11:02:14,788 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:14,788 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:14,788 INFO ]: Analyzing trace with hash -1289816243, now seen corresponding path program 18 times [2018-06-22 11:02:14,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:14,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:14,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:14,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:14,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:14,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:15,295 INFO ]: Checked inductivity of 294 backedges. 30 proven. 136 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-06-22 11:02:15,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:15,295 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 11:02:15,301 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:15,352 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:02:15,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:15,355 INFO ]: Computing forward predicates... [2018-06-22 11:02:15,555 INFO ]: Checked inductivity of 294 backedges. 42 proven. 118 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-06-22 11:02:15,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:15,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 40 [2018-06-22 11:02:15,575 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:02:15,575 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:02:15,575 INFO ]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:02:15,575 INFO ]: Start difference. First operand 72 states and 76 transitions. Second operand 40 states. [2018-06-22 11:02:16,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:16,306 INFO ]: Finished difference Result 102 states and 106 transitions. [2018-06-22 11:02:16,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:02:16,306 INFO ]: Start accepts. Automaton has 40 states. Word has length 105 [2018-06-22 11:02:16,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:16,307 INFO ]: With dead ends: 102 [2018-06-22 11:02:16,307 INFO ]: Without dead ends: 102 [2018-06-22 11:02:16,308 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:02:16,308 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 11:02:16,312 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-06-22 11:02:16,312 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:02:16,313 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-06-22 11:02:16,313 INFO ]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 105 [2018-06-22 11:02:16,313 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:16,313 INFO ]: Abstraction has 70 states and 73 transitions. [2018-06-22 11:02:16,313 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:02:16,313 INFO ]: Start isEmpty. Operand 70 states and 73 transitions. [2018-06-22 11:02:16,314 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:02:16,314 INFO ]: Found error trace [2018-06-22 11:02:16,314 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:16,314 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:16,314 INFO ]: Analyzing trace with hash -547695471, now seen corresponding path program 19 times [2018-06-22 11:02:16,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:16,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:16,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:16,315 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:16,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:16,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:16,703 INFO ]: Checked inductivity of 326 backedges. 128 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-06-22 11:02:16,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:16,703 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 11:02:16,712 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:16,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:16,755 INFO ]: Computing forward predicates... [2018-06-22 11:02:16,944 INFO ]: Checked inductivity of 326 backedges. 128 proven. 49 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-22 11:02:16,967 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:16,967 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 39 [2018-06-22 11:02:16,967 INFO ]: Interpolant automaton has 39 states [2018-06-22 11:02:16,967 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 11:02:16,967 INFO ]: CoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:02:16,968 INFO ]: Start difference. First operand 70 states and 73 transitions. Second operand 39 states. [2018-06-22 11:02:17,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:17,329 INFO ]: Finished difference Result 102 states and 105 transitions. [2018-06-22 11:02:17,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:02:17,329 INFO ]: Start accepts. Automaton has 39 states. Word has length 109 [2018-06-22 11:02:17,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:17,330 INFO ]: With dead ends: 102 [2018-06-22 11:02:17,330 INFO ]: Without dead ends: 72 [2018-06-22 11:02:17,331 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=2652, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:02:17,331 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:02:17,335 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 11:02:17,335 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:02:17,336 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-06-22 11:02:17,336 INFO ]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 109 [2018-06-22 11:02:17,336 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:17,336 INFO ]: Abstraction has 72 states and 75 transitions. [2018-06-22 11:02:17,336 INFO ]: Interpolant automaton has 39 states. [2018-06-22 11:02:17,336 INFO ]: Start isEmpty. Operand 72 states and 75 transitions. [2018-06-22 11:02:17,337 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:02:17,337 INFO ]: Found error trace [2018-06-22 11:02:17,337 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:17,337 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:17,337 INFO ]: Analyzing trace with hash 1931963891, now seen corresponding path program 20 times [2018-06-22 11:02:17,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:17,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:17,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:17,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:17,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:17,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:18,499 INFO ]: Checked inductivity of 353 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-06-22 11:02:18,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:18,499 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 11:02:18,515 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:18,558 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:18,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:18,563 INFO ]: Computing forward predicates... [2018-06-22 11:02:19,657 INFO ]: Checked inductivity of 353 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-06-22 11:02:19,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:19,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 62 [2018-06-22 11:02:19,676 INFO ]: Interpolant automaton has 62 states [2018-06-22 11:02:19,676 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 11:02:19,677 INFO ]: CoverageRelationStatistics Valid=141, Invalid=3641, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:02:19,677 INFO ]: Start difference. First operand 72 states and 75 transitions. Second operand 62 states. [2018-06-22 11:02:20,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:20,985 INFO ]: Finished difference Result 110 states and 114 transitions. [2018-06-22 11:02:20,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:02:20,985 INFO ]: Start accepts. Automaton has 62 states. Word has length 113 [2018-06-22 11:02:20,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:20,986 INFO ]: With dead ends: 110 [2018-06-22 11:02:20,986 INFO ]: Without dead ends: 108 [2018-06-22 11:02:20,986 INFO ]: 0 DeclaredPredicates, 176 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=263, Invalid=6057, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 11:02:20,986 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:02:20,990 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 78. [2018-06-22 11:02:20,990 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:02:20,991 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-06-22 11:02:20,991 INFO ]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 113 [2018-06-22 11:02:20,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:20,992 INFO ]: Abstraction has 78 states and 82 transitions. [2018-06-22 11:02:20,992 INFO ]: Interpolant automaton has 62 states. [2018-06-22 11:02:20,992 INFO ]: Start isEmpty. Operand 78 states and 82 transitions. [2018-06-22 11:02:20,992 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:02:20,992 INFO ]: Found error trace [2018-06-22 11:02:20,992 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:20,993 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:20,993 INFO ]: Analyzing trace with hash 337984213, now seen corresponding path program 21 times [2018-06-22 11:02:20,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:20,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:20,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:20,993 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:20,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:21,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:21,614 INFO ]: Checked inductivity of 384 backedges. 42 proven. 172 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-06-22 11:02:21,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:21,614 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 11:02:21,619 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:21,670 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:02:21,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:21,674 INFO ]: Computing forward predicates... [2018-06-22 11:02:21,939 INFO ]: Checked inductivity of 384 backedges. 56 proven. 151 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-22 11:02:21,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:21,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 44 [2018-06-22 11:02:21,958 INFO ]: Interpolant automaton has 44 states [2018-06-22 11:02:21,958 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 11:02:21,958 INFO ]: CoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:02:21,958 INFO ]: Start difference. First operand 78 states and 82 transitions. Second operand 44 states. [2018-06-22 11:02:22,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:22,717 INFO ]: Finished difference Result 112 states and 116 transitions. [2018-06-22 11:02:22,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:02:22,717 INFO ]: Start accepts. Automaton has 44 states. Word has length 117 [2018-06-22 11:02:22,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:22,718 INFO ]: With dead ends: 112 [2018-06-22 11:02:22,718 INFO ]: Without dead ends: 112 [2018-06-22 11:02:22,718 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 11:02:22,718 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:02:22,722 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 76. [2018-06-22 11:02:22,722 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:02:22,723 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-06-22 11:02:22,723 INFO ]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 117 [2018-06-22 11:02:22,723 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:22,723 INFO ]: Abstraction has 76 states and 79 transitions. [2018-06-22 11:02:22,723 INFO ]: Interpolant automaton has 44 states. [2018-06-22 11:02:22,723 INFO ]: Start isEmpty. Operand 76 states and 79 transitions. [2018-06-22 11:02:22,724 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:02:22,724 INFO ]: Found error trace [2018-06-22 11:02:22,724 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:22,724 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:22,724 INFO ]: Analyzing trace with hash -1200176487, now seen corresponding path program 22 times [2018-06-22 11:02:22,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:22,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:22,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:22,725 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:22,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:22,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:23,153 INFO ]: Checked inductivity of 420 backedges. 162 proven. 70 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-06-22 11:02:23,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:23,153 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 11:02:23,159 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:23,223 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:23,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:23,229 INFO ]: Computing forward predicates... [2018-06-22 11:02:23,659 INFO ]: Checked inductivity of 420 backedges. 162 proven. 64 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-06-22 11:02:23,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:23,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 43 [2018-06-22 11:02:23,678 INFO ]: Interpolant automaton has 43 states [2018-06-22 11:02:23,678 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 11:02:23,678 INFO ]: CoverageRelationStatistics Valid=250, Invalid=1556, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:02:23,678 INFO ]: Start difference. First operand 76 states and 79 transitions. Second operand 43 states. [2018-06-22 11:02:24,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:24,171 INFO ]: Finished difference Result 112 states and 115 transitions. [2018-06-22 11:02:24,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:02:24,171 INFO ]: Start accepts. Automaton has 43 states. Word has length 121 [2018-06-22 11:02:24,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:24,171 INFO ]: With dead ends: 112 [2018-06-22 11:02:24,171 INFO ]: Without dead ends: 78 [2018-06-22 11:02:24,172 INFO ]: 0 DeclaredPredicates, 185 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=524, Invalid=3258, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:02:24,172 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 11:02:24,175 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-06-22 11:02:24,175 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:02:24,176 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-06-22 11:02:24,176 INFO ]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 121 [2018-06-22 11:02:24,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:24,176 INFO ]: Abstraction has 78 states and 81 transitions. [2018-06-22 11:02:24,176 INFO ]: Interpolant automaton has 43 states. [2018-06-22 11:02:24,176 INFO ]: Start isEmpty. Operand 78 states and 81 transitions. [2018-06-22 11:02:24,177 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:02:24,177 INFO ]: Found error trace [2018-06-22 11:02:24,177 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:24,177 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:24,177 INFO ]: Analyzing trace with hash 1529102075, now seen corresponding path program 23 times [2018-06-22 11:02:24,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:24,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:24,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:24,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:24,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:24,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:24,955 INFO ]: Checked inductivity of 451 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-22 11:02:24,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:24,955 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 11:02:24,962 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:25,031 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:02:25,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:25,041 INFO ]: Computing forward predicates... [2018-06-22 11:02:26,676 INFO ]: Checked inductivity of 451 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-22 11:02:26,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:26,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 68 [2018-06-22 11:02:26,696 INFO ]: Interpolant automaton has 68 states [2018-06-22 11:02:26,696 INFO ]: Constructing interpolant automaton starting with 68 interpolants. [2018-06-22 11:02:26,697 INFO ]: CoverageRelationStatistics Valid=155, Invalid=4401, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:02:26,697 INFO ]: Start difference. First operand 78 states and 81 transitions. Second operand 68 states. [2018-06-22 11:02:28,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:28,257 INFO ]: Finished difference Result 120 states and 124 transitions. [2018-06-22 11:02:28,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:02:28,257 INFO ]: Start accepts. Automaton has 68 states. Word has length 125 [2018-06-22 11:02:28,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:28,258 INFO ]: With dead ends: 120 [2018-06-22 11:02:28,258 INFO ]: Without dead ends: 118 [2018-06-22 11:02:28,258 INFO ]: 0 DeclaredPredicates, 195 GetRequests, 94 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=291, Invalid=7365, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 11:02:28,258 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:02:28,262 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 84. [2018-06-22 11:02:28,262 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:02:28,263 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-06-22 11:02:28,263 INFO ]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 125 [2018-06-22 11:02:28,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:28,263 INFO ]: Abstraction has 84 states and 88 transitions. [2018-06-22 11:02:28,263 INFO ]: Interpolant automaton has 68 states. [2018-06-22 11:02:28,263 INFO ]: Start isEmpty. Operand 84 states and 88 transitions. [2018-06-22 11:02:28,264 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 11:02:28,264 INFO ]: Found error trace [2018-06-22 11:02:28,264 INFO ]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:28,264 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:28,264 INFO ]: Analyzing trace with hash 513806045, now seen corresponding path program 24 times [2018-06-22 11:02:28,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:28,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:28,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:28,265 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:28,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:28,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:28,925 INFO ]: Checked inductivity of 486 backedges. 56 proven. 212 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-06-22 11:02:28,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:28,925 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 11:02:29,047 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:02:29,110 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:02:29,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:29,115 INFO ]: Computing forward predicates... [2018-06-22 11:02:29,447 INFO ]: Checked inductivity of 486 backedges. 72 proven. 188 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-06-22 11:02:29,478 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:29,478 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 48 [2018-06-22 11:02:29,478 INFO ]: Interpolant automaton has 48 states [2018-06-22 11:02:29,478 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 11:02:29,479 INFO ]: CoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:02:29,479 INFO ]: Start difference. First operand 84 states and 88 transitions. Second operand 48 states. [2018-06-22 11:02:30,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:30,149 INFO ]: Finished difference Result 122 states and 126 transitions. [2018-06-22 11:02:30,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:02:30,150 INFO ]: Start accepts. Automaton has 48 states. Word has length 129 [2018-06-22 11:02:30,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:30,150 INFO ]: With dead ends: 122 [2018-06-22 11:02:30,150 INFO ]: Without dead ends: 122 [2018-06-22 11:02:30,151 INFO ]: 0 DeclaredPredicates, 201 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=641, Invalid=4051, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:02:30,151 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:02:30,155 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 82. [2018-06-22 11:02:30,155 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:02:30,155 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-06-22 11:02:30,156 INFO ]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 129 [2018-06-22 11:02:30,157 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:30,157 INFO ]: Abstraction has 82 states and 85 transitions. [2018-06-22 11:02:30,157 INFO ]: Interpolant automaton has 48 states. [2018-06-22 11:02:30,157 INFO ]: Start isEmpty. Operand 82 states and 85 transitions. [2018-06-22 11:02:30,157 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:02:30,157 INFO ]: Found error trace [2018-06-22 11:02:30,158 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:30,158 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:30,158 INFO ]: Analyzing trace with hash 1753080097, now seen corresponding path program 25 times [2018-06-22 11:02:30,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:30,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:30,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:30,158 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:30,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:30,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:30,670 INFO ]: Checked inductivity of 526 backedges. 200 proven. 88 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-22 11:02:30,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:30,670 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 11:02:30,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:30,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:30,733 INFO ]: Computing forward predicates... [2018-06-22 11:02:32,026 INFO ]: Checked inductivity of 526 backedges. 200 proven. 81 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-06-22 11:02:32,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:32,056 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 47 [2018-06-22 11:02:32,056 INFO ]: Interpolant automaton has 47 states [2018-06-22 11:02:32,057 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 11:02:32,057 INFO ]: CoverageRelationStatistics Valid=301, Invalid=1861, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:02:32,057 INFO ]: Start difference. First operand 82 states and 85 transitions. Second operand 47 states. [2018-06-22 11:02:32,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:32,556 INFO ]: Finished difference Result 122 states and 125 transitions. [2018-06-22 11:02:32,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 11:02:32,557 INFO ]: Start accepts. Automaton has 47 states. Word has length 133 [2018-06-22 11:02:32,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:32,557 INFO ]: With dead ends: 122 [2018-06-22 11:02:32,557 INFO ]: Without dead ends: 84 [2018-06-22 11:02:32,558 INFO ]: 0 DeclaredPredicates, 204 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=630, Invalid=3926, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:02:32,558 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:02:32,561 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-22 11:02:32,561 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:02:32,562 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-06-22 11:02:32,562 INFO ]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 133 [2018-06-22 11:02:32,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:32,562 INFO ]: Abstraction has 84 states and 87 transitions. [2018-06-22 11:02:32,562 INFO ]: Interpolant automaton has 47 states. [2018-06-22 11:02:32,562 INFO ]: Start isEmpty. Operand 84 states and 87 transitions. [2018-06-22 11:02:32,563 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:02:32,563 INFO ]: Found error trace [2018-06-22 11:02:32,563 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:32,563 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:32,563 INFO ]: Analyzing trace with hash -1702158205, now seen corresponding path program 26 times [2018-06-22 11:02:32,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:32,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:32,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:32,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:32,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:32,583 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:34,000 INFO ]: Checked inductivity of 561 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-22 11:02:34,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:34,000 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 11:02:34,006 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:02:34,060 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:02:34,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:34,067 INFO ]: Computing forward predicates... [2018-06-22 11:02:35,786 INFO ]: Checked inductivity of 561 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-22 11:02:35,805 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:35,805 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 74 [2018-06-22 11:02:35,805 INFO ]: Interpolant automaton has 74 states [2018-06-22 11:02:35,805 INFO ]: Constructing interpolant automaton starting with 74 interpolants. [2018-06-22 11:02:35,806 INFO ]: CoverageRelationStatistics Valid=169, Invalid=5233, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 11:02:35,806 INFO ]: Start difference. First operand 84 states and 87 transitions. Second operand 74 states. [2018-06-22 11:02:37,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:37,684 INFO ]: Finished difference Result 130 states and 134 transitions. [2018-06-22 11:02:37,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:02:37,684 INFO ]: Start accepts. Automaton has 74 states. Word has length 137 [2018-06-22 11:02:37,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:37,684 INFO ]: With dead ends: 130 [2018-06-22 11:02:37,685 INFO ]: Without dead ends: 128 [2018-06-22 11:02:37,685 INFO ]: 0 DeclaredPredicates, 214 GetRequests, 103 SyntacticMatches, 17 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=319, Invalid=8801, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 11:02:37,685 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 11:02:37,690 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 90. [2018-06-22 11:02:37,690 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 11:02:37,690 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-06-22 11:02:37,690 INFO ]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 137 [2018-06-22 11:02:37,691 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:37,691 INFO ]: Abstraction has 90 states and 94 transitions. [2018-06-22 11:02:37,691 INFO ]: Interpolant automaton has 74 states. [2018-06-22 11:02:37,691 INFO ]: Start isEmpty. Operand 90 states and 94 transitions. [2018-06-22 11:02:37,692 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:02:37,692 INFO ]: Found error trace [2018-06-22 11:02:37,692 INFO ]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:37,692 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:37,692 INFO ]: Analyzing trace with hash -1625566363, now seen corresponding path program 27 times [2018-06-22 11:02:37,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:37,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:37,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:37,692 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:37,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:37,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:38,283 INFO ]: Checked inductivity of 600 backedges. 72 proven. 256 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-06-22 11:02:38,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:38,283 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 11:02:38,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:02:38,352 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 11:02:38,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:38,357 INFO ]: Computing forward predicates... [2018-06-22 11:02:38,676 INFO ]: Checked inductivity of 600 backedges. 90 proven. 229 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-06-22 11:02:38,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:38,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 52 [2018-06-22 11:02:38,695 INFO ]: Interpolant automaton has 52 states [2018-06-22 11:02:38,695 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 11:02:38,695 INFO ]: CoverageRelationStatistics Valid=332, Invalid=2320, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:02:38,695 INFO ]: Start difference. First operand 90 states and 94 transitions. Second operand 52 states. [2018-06-22 11:02:39,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:39,588 INFO ]: Finished difference Result 132 states and 136 transitions. [2018-06-22 11:02:39,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:02:39,589 INFO ]: Start accepts. Automaton has 52 states. Word has length 141 [2018-06-22 11:02:39,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:39,590 INFO ]: With dead ends: 132 [2018-06-22 11:02:39,590 INFO ]: Without dead ends: 132 [2018-06-22 11:02:39,590 INFO ]: 0 DeclaredPredicates, 220 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=757, Invalid=4793, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 11:02:39,590 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 11:02:39,594 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 88. [2018-06-22 11:02:39,594 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:02:39,595 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-06-22 11:02:39,595 INFO ]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 141 [2018-06-22 11:02:39,595 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:39,595 INFO ]: Abstraction has 88 states and 91 transitions. [2018-06-22 11:02:39,595 INFO ]: Interpolant automaton has 52 states. [2018-06-22 11:02:39,595 INFO ]: Start isEmpty. Operand 88 states and 91 transitions. [2018-06-22 11:02:39,596 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 11:02:39,596 INFO ]: Found error trace [2018-06-22 11:02:39,596 INFO ]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:39,596 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:39,597 INFO ]: Analyzing trace with hash 962891817, now seen corresponding path program 28 times [2018-06-22 11:02:39,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:39,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:39,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:39,598 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:39,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:39,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:40,223 INFO ]: Checked inductivity of 644 backedges. 242 proven. 108 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-06-22 11:02:40,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:40,223 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 11:02:40,229 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:02:40,283 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:02:40,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:40,288 INFO ]: Computing forward predicates... [2018-06-22 11:02:40,555 INFO ]: Checked inductivity of 644 backedges. 242 proven. 100 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-06-22 11:02:40,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:40,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 51 [2018-06-22 11:02:40,574 INFO ]: Interpolant automaton has 51 states [2018-06-22 11:02:40,574 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 11:02:40,574 INFO ]: CoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:02:40,574 INFO ]: Start difference. First operand 88 states and 91 transitions. Second operand 51 states. [2018-06-22 11:02:41,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:41,200 INFO ]: Finished difference Result 132 states and 135 transitions. [2018-06-22 11:02:41,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:02:41,200 INFO ]: Start accepts. Automaton has 51 states. Word has length 145 [2018-06-22 11:02:41,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:41,201 INFO ]: With dead ends: 132 [2018-06-22 11:02:41,201 INFO ]: Without dead ends: 90 [2018-06-22 11:02:41,202 INFO ]: 0 DeclaredPredicates, 223 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=746, Invalid=4656, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 11:02:41,202 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:02:41,205 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-06-22 11:02:41,205 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 11:02:41,206 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-06-22 11:02:41,206 INFO ]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 145 [2018-06-22 11:02:41,206 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:41,206 INFO ]: Abstraction has 90 states and 93 transitions. [2018-06-22 11:02:41,206 INFO ]: Interpolant automaton has 51 states. [2018-06-22 11:02:41,206 INFO ]: Start isEmpty. Operand 90 states and 93 transitions. [2018-06-22 11:02:41,207 INFO ]: Finished isEmpty. Found accepting run of length 150 [2018-06-22 11:02:41,207 INFO ]: Found error trace [2018-06-22 11:02:41,207 INFO ]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:41,207 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:41,207 INFO ]: Analyzing trace with hash 1679323787, now seen corresponding path program 29 times [2018-06-22 11:02:41,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:41,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:41,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:41,207 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:02:41,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:41,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:42,627 INFO ]: Checked inductivity of 683 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-06-22 11:02:42,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:42,627 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 11:02:42,632 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:02:42,712 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 11:02:42,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:42,720 INFO ]: Computing forward predicates... [2018-06-22 11:02:44,424 INFO ]: Checked inductivity of 683 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. Received shutdown request... [2018-06-22 11:02:44,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:44,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 80 [2018-06-22 11:02:44,445 INFO ]: Interpolant automaton has 80 states [2018-06-22 11:02:44,445 INFO ]: Constructing interpolant automaton starting with 80 interpolants. [2018-06-22 11:02:44,445 INFO ]: CoverageRelationStatistics Valid=183, Invalid=6137, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 11:02:44,446 INFO ]: Start difference. First operand 90 states and 93 transitions. Second operand 80 states. [2018-06-22 11:02:44,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:02:44,446 WARN ]: Verification canceled [2018-06-22 11:02:44,453 WARN ]: Timeout [2018-06-22 11:02:44,453 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:02:44 BoogieIcfgContainer [2018-06-22 11:02:44,454 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:02:44,454 INFO ]: Toolchain (without parser) took 59323.50 ms. Allocated memory was 308.3 MB in the beginning and 882.9 MB in the end (delta: 574.6 MB). Free memory was 263.8 MB in the beginning and 826.6 MB in the end (delta: -562.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:44,455 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:02:44,456 INFO ]: ChcToBoogie took 41.63 ms. Allocated memory is still 308.3 MB. Free memory was 263.8 MB in the beginning and 261.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:44,456 INFO ]: Boogie Preprocessor took 40.05 ms. Allocated memory is still 308.3 MB. Free memory was 261.8 MB in the beginning and 260.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:02:44,456 INFO ]: RCFGBuilder took 304.09 ms. Allocated memory is still 308.3 MB. Free memory was 260.8 MB in the beginning and 250.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:02:44,457 INFO ]: TraceAbstraction took 58928.52 ms. Allocated memory was 308.3 MB in the beginning and 882.9 MB in the end (delta: 574.6 MB). Free memory was 250.8 MB in the beginning and 826.6 MB in the end (delta: -575.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:02:44,460 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 41.63 ms. Allocated memory is still 308.3 MB. Free memory was 263.8 MB in the beginning and 261.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.05 ms. Allocated memory is still 308.3 MB. Free memory was 261.8 MB in the beginning and 260.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 304.09 ms. Allocated memory is still 308.3 MB. Free memory was 260.8 MB in the beginning and 250.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58928.52 ms. Allocated memory was 308.3 MB in the beginning and 882.9 MB in the end (delta: 574.6 MB). Free memory was 250.8 MB in the beginning and 826.6 MB in the end (delta: -575.8 MB). There was no memory consumed. 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 constructing difference of abstraction (90states) and interpolant automaton (currently 2 states, 80 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 33 locations, 1 error locations. TIMEOUT Result, 58.8s OverallTime, 36 OverallIterations, 12 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1252 SDtfs, 503 SDslu, 25896 SDs, 0 SdLazy, 15887 SolverSat, 510 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4246 GetRequests, 2541 SyntacticMatches, 122 SemanticMatches, 1583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15305 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 466 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 35.0s InterpolantComputationTime, 5607 NumberOfCodeBlocks, 5607 NumberOfCodeBlocksAsserted, 162 NumberOfCheckSat, 5540 ConstructedInterpolants, 0 QuantifiedInterpolants, 2149068 SizeOfPredicates, 434 NumberOfNonLiveVariables, 11625 ConjunctsInSsa, 2121 ConjunctsInUnsatCore, 67 InterpolantComputations, 5 PerfectInterpolantSequences, 9631/15326 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_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-02-44-471.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-02-44-471.csv Completed graceful shutdown