java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:00:01,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:00:01,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:00:01,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:00:01,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:00:01,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:00:01,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:00:01,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:00:01,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:00:01,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:00:01,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:00:01,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:00:01,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:00:01,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:00:01,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:00:01,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:00:01,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:00:01,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:00:01,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:00:01,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:00:01,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:00:01,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:00:01,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:00:01,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:00:01,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:00:01,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:00:01,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:00:01,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:00:01,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:00:01,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:00:01,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:00:01,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:00:01,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:00:01,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:00:01,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:00:01,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:00:01,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:00:01,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:00:01,453 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:00:01,453 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:00:01,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:00:01,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:00:01,455 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:00:01,456 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:00:01,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:00:01,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:00:01,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:00:01,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:00:01,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:00:01,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:00:01,457 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:00:01,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:00:01,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:00:01,458 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:00:01,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:00:01,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:00:01,458 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:00:01,460 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:00:01,460 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:00:01,509 INFO ]: Repository-Root is: /tmp [2018-06-25 09:00:01,526 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:00:01,532 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:00:01,534 INFO ]: Initializing SmtParser... [2018-06-25 09:00:01,535 INFO ]: SmtParser initialized [2018-06-25 09:00:01,535 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-25 09:00:01,536 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-25 09:00:01,627 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 unknown [2018-06-25 09:00:01,771 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-25 09:00:01,779 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:00:01,789 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:00:01,790 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:00:01,790 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:00:01,790 INFO ]: ChcToBoogie initialized [2018-06-25 09:00:01,794 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,841 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01 Unit [2018-06-25 09:00:01,841 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:00:01,842 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:00:01,842 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:00:01,842 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:00:01,863 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,863 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,871 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,871 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,873 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,876 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,876 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... [2018-06-25 09:00:01,879 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:00:01,880 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:00:01,880 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:00:01,880 INFO ]: RCFGBuilder initialized [2018-06-25 09:00:01,881 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:00:01,896 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:00:01,896 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:00:01,896 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:00:01,896 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:00:01,896 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:00:01,896 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:00:02,225 INFO ]: Using library mode [2018-06-25 09:00:02,225 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:00:02 BoogieIcfgContainer [2018-06-25 09:00:02,225 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:00:02,226 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:00:02,226 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:00:02,229 INFO ]: TraceAbstraction initialized [2018-06-25 09:00:02,230 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:00:01" (1/3) ... [2018-06-25 09:00:02,230 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8c6031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:00:02, skipping insertion in model container [2018-06-25 09:00:02,231 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:00:01" (2/3) ... [2018-06-25 09:00:02,231 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8c6031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:00:02, skipping insertion in model container [2018-06-25 09:00:02,231 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:00:02" (3/3) ... [2018-06-25 09:00:02,232 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:00:02,241 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:00:02,250 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:00:02,301 INFO ]: Using default assertion order modulation [2018-06-25 09:00:02,301 INFO ]: Interprodecural is true [2018-06-25 09:00:02,301 INFO ]: Hoare is false [2018-06-25 09:00:02,301 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:00:02,302 INFO ]: Backedges is TWOTRACK [2018-06-25 09:00:02,302 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:00:02,302 INFO ]: Difference is false [2018-06-25 09:00:02,302 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:00:02,302 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:00:02,320 INFO ]: Start isEmpty. Operand 14 states. [2018-06-25 09:00:02,334 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:00:02,334 INFO ]: Found error trace [2018-06-25 09:00:02,337 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:02,337 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:02,343 INFO ]: Analyzing trace with hash 103853604, now seen corresponding path program 1 times [2018-06-25 09:00:02,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:02,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:02,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:02,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:02,571 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:00:02,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:00:02,573 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:00:02,574 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:00:02,585 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:00:02,585 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:00:02,587 INFO ]: Start difference. First operand 14 states. Second operand 5 states. [2018-06-25 09:00:02,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:02,713 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-25 09:00:02,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:00:02,715 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:00:02,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:02,729 INFO ]: With dead ends: 19 [2018-06-25 09:00:02,729 INFO ]: Without dead ends: 19 [2018-06-25 09:00:02,731 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:00:02,750 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:00:02,766 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 09:00:02,767 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:00:02,768 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-25 09:00:02,771 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-25 09:00:02,771 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:02,771 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-25 09:00:02,771 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:00:02,771 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-25 09:00:02,771 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:00:02,771 INFO ]: Found error trace [2018-06-25 09:00:02,771 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:02,772 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:02,772 INFO ]: Analyzing trace with hash 1326208268, now seen corresponding path program 1 times [2018-06-25 09:00:02,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:02,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:02,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:02,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:02,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:03,009 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:00:03,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:03,009 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-25 09:00:03,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:03,058 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:03,068 INFO ]: Computing forward predicates... [2018-06-25 09:00:03,343 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:00:03,365 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:00:03,366 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-25 09:00:03,366 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:00:03,366 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:00:03,366 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:00:03,367 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 9 states. [2018-06-25 09:00:03,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:03,579 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-25 09:00:03,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:00:03,581 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:00:03,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:03,581 INFO ]: With dead ends: 16 [2018-06-25 09:00:03,581 INFO ]: Without dead ends: 13 [2018-06-25 09:00:03,582 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:00:03,582 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:00:03,584 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:00:03,584 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:00:03,585 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-25 09:00:03,585 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2018-06-25 09:00:03,585 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:03,585 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-25 09:00:03,585 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:00:03,585 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-25 09:00:03,585 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:00:03,585 INFO ]: Found error trace [2018-06-25 09:00:03,585 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:03,586 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:03,586 INFO ]: Analyzing trace with hash -513193148, now seen corresponding path program 1 times [2018-06-25 09:00:03,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:03,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:03,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:03,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:03,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:03,599 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:03,636 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:00:03,636 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:00:03,636 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:00:03,636 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:00:03,636 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:00:03,636 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:00:03,637 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-06-25 09:00:03,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:03,751 INFO ]: Finished difference Result 15 states and 18 transitions. [2018-06-25 09:00:03,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:00:03,752 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-25 09:00:03,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:03,752 INFO ]: With dead ends: 15 [2018-06-25 09:00:03,752 INFO ]: Without dead ends: 14 [2018-06-25 09:00:03,753 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:00:03,753 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:00:03,754 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:00:03,754 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:00:03,755 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-25 09:00:03,755 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-25 09:00:03,755 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:03,755 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-25 09:00:03,755 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:00:03,755 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-25 09:00:03,755 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:00:03,755 INFO ]: Found error trace [2018-06-25 09:00:03,756 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:03,756 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:03,756 INFO ]: Analyzing trace with hash -622371860, now seen corresponding path program 1 times [2018-06-25 09:00:03,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:03,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:03,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:03,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:03,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:03,779 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:03,861 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:03,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:00:03,861 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:00:03,861 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:00:03,861 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:00:03,861 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:00:03,861 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 5 states. [2018-06-25 09:00:03,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:03,941 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-25 09:00:03,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:00:03,941 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-25 09:00:03,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:03,942 INFO ]: With dead ends: 15 [2018-06-25 09:00:03,942 INFO ]: Without dead ends: 15 [2018-06-25 09:00:03,942 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:00:03,942 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:00:03,943 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:00:03,943 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:00:03,944 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-25 09:00:03,944 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-25 09:00:03,944 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:03,944 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-25 09:00:03,944 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:00:03,944 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-25 09:00:03,944 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:00:03,945 INFO ]: Found error trace [2018-06-25 09:00:03,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:03,945 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:03,946 INFO ]: Analyzing trace with hash -2060129664, now seen corresponding path program 1 times [2018-06-25 09:00:03,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:03,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:03,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:03,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:03,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:03,966 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:04,389 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:04,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:04,389 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-25 09:00:04,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:04,416 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:04,419 INFO ]: Computing forward predicates... [2018-06-25 09:00:04,655 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:04,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:04,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-25 09:00:04,676 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:00:04,677 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:00:04,677 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:00:04,677 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-06-25 09:00:04,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:04,964 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-25 09:00:04,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:00:04,965 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 09:00:04,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:04,966 INFO ]: With dead ends: 24 [2018-06-25 09:00:04,966 INFO ]: Without dead ends: 24 [2018-06-25 09:00:04,966 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:04,966 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:00:04,968 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-25 09:00:04,968 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:00:04,969 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-25 09:00:04,969 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-25 09:00:04,969 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:04,969 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-25 09:00:04,969 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:00:04,969 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-25 09:00:04,969 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:00:04,969 INFO ]: Found error trace [2018-06-25 09:00:04,969 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:04,969 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:04,970 INFO ]: Analyzing trace with hash 393310504, now seen corresponding path program 2 times [2018-06-25 09:00:04,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:04,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:04,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:04,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:04,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:04,989 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,171 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:05,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:05,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:05,179 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:05,210 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:05,210 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:05,212 INFO ]: Computing forward predicates... [2018-06-25 09:00:05,351 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:05,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:05,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-25 09:00:05,372 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:00:05,372 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:00:05,372 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:00:05,373 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 12 states. [2018-06-25 09:00:05,688 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 09:00:06,208 WARN ]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 09:00:06,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:06,305 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-25 09:00:06,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:00:06,307 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 09:00:06,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:06,308 INFO ]: With dead ends: 29 [2018-06-25 09:00:06,308 INFO ]: Without dead ends: 23 [2018-06-25 09:00:06,308 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:00:06,308 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:00:06,310 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-25 09:00:06,310 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:00:06,311 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-25 09:00:06,311 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-06-25 09:00:06,311 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:06,311 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-25 09:00:06,311 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:00:06,311 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-25 09:00:06,311 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:00:06,311 INFO ]: Found error trace [2018-06-25 09:00:06,311 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:06,311 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:06,311 INFO ]: Analyzing trace with hash -2039891616, now seen corresponding path program 3 times [2018-06-25 09:00:06,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:06,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:06,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:06,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,325 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:06,404 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:06,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:06,404 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-25 09:00:06,412 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:06,429 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 09:00:06,429 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:06,431 INFO ]: Computing forward predicates... [2018-06-25 09:00:06,466 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:00:06,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:06,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 09:00:06,487 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:00:06,487 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:00:06,487 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:00:06,487 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 10 states. [2018-06-25 09:00:06,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:06,564 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-25 09:00:06,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:00:06,565 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 09:00:06,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:06,566 INFO ]: With dead ends: 20 [2018-06-25 09:00:06,566 INFO ]: Without dead ends: 20 [2018-06-25 09:00:06,566 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:00:06,566 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:00:06,568 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-06-25 09:00:06,568 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:00:06,569 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-25 09:00:06,569 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-25 09:00:06,569 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:06,569 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-25 09:00:06,569 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:00:06,569 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-25 09:00:06,569 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:00:06,569 INFO ]: Found error trace [2018-06-25 09:00:06,569 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:06,569 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:06,570 INFO ]: Analyzing trace with hash 1241398156, now seen corresponding path program 4 times [2018-06-25 09:00:06,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:06,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:06,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,570 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:06,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,586 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:06,658 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:06,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:06,658 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) [2018-06-25 09:00:06,675 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:06,709 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:06,709 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:06,711 INFO ]: Computing forward predicates... [2018-06-25 09:00:06,754 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:06,781 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:06,781 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 09:00:06,781 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:00:06,781 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:00:06,781 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:00:06,781 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-06-25 09:00:06,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:06,853 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-25 09:00:06,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:00:06,856 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-25 09:00:06,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:06,856 INFO ]: With dead ends: 21 [2018-06-25 09:00:06,856 INFO ]: Without dead ends: 18 [2018-06-25 09:00:06,857 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:00:06,857 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:00:06,858 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:00:06,858 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:00:06,859 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-25 09:00:06,859 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2018-06-25 09:00:06,859 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:06,859 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-25 09:00:06,859 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:00:06,859 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-25 09:00:06,859 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:00:06,859 INFO ]: Found error trace [2018-06-25 09:00:06,859 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:06,860 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:06,861 INFO ]: Analyzing trace with hash 1630147492, now seen corresponding path program 5 times [2018-06-25 09:00:06,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:06,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:06,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,862 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:06,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:06,891 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:07,064 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:07,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:07,064 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-25 09:00:07,071 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:07,120 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:07,120 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:07,123 INFO ]: Computing forward predicates... [2018-06-25 09:00:07,541 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:07,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:07,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-25 09:00:07,572 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:07,573 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:07,573 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:07,573 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-25 09:00:07,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:07,952 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-25 09:00:07,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:00:07,960 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-25 09:00:07,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:07,961 INFO ]: With dead ends: 29 [2018-06-25 09:00:07,961 INFO ]: Without dead ends: 29 [2018-06-25 09:00:07,961 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:00:07,961 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:00:07,963 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-25 09:00:07,963 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:00:07,964 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-25 09:00:07,964 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-06-25 09:00:07,964 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:07,964 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-25 09:00:07,964 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:07,964 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-25 09:00:07,964 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:00:07,964 INFO ]: Found error trace [2018-06-25 09:00:07,965 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:07,965 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:07,965 INFO ]: Analyzing trace with hash 796475020, now seen corresponding path program 6 times [2018-06-25 09:00:07,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:07,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:07,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:07,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:07,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:07,977 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:08,127 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:08,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:08,127 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-25 09:00:08,135 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:08,181 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:00:08,181 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:08,183 INFO ]: Computing forward predicates... [2018-06-25 09:00:08,528 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:08,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:08,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-25 09:00:08,553 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:08,553 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:08,553 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:08,554 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2018-06-25 09:00:08,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:08,983 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-25 09:00:08,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:00:08,983 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-25 09:00:08,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:08,983 INFO ]: With dead ends: 35 [2018-06-25 09:00:08,983 INFO ]: Without dead ends: 27 [2018-06-25 09:00:08,984 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:00:08,984 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:00:08,986 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-25 09:00:08,986 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:00:08,987 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-25 09:00:08,987 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2018-06-25 09:00:08,987 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:08,987 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-25 09:00:08,987 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:08,987 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-25 09:00:08,987 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:00:08,987 INFO ]: Found error trace [2018-06-25 09:00:08,987 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:08,988 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:08,988 INFO ]: Analyzing trace with hash -1048553276, now seen corresponding path program 7 times [2018-06-25 09:00:08,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:08,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:08,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:08,988 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:08,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,001 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,138 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:09,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:09,138 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-25 09:00:09,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:09,167 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,169 INFO ]: Computing forward predicates... [2018-06-25 09:00:09,219 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:00:09,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:09,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 09:00:09,239 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:00:09,239 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:00:09,239 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:00:09,239 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 13 states. [2018-06-25 09:00:09,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:09,287 INFO ]: Finished difference Result 24 states and 27 transitions. [2018-06-25 09:00:09,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:00:09,287 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 09:00:09,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:09,288 INFO ]: With dead ends: 24 [2018-06-25 09:00:09,288 INFO ]: Without dead ends: 24 [2018-06-25 09:00:09,288 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:00:09,288 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:00:09,290 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-25 09:00:09,290 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:00:09,291 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-25 09:00:09,291 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-06-25 09:00:09,291 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:09,291 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-25 09:00:09,291 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:00:09,291 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-25 09:00:09,291 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:00:09,291 INFO ]: Found error trace [2018-06-25 09:00:09,291 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:09,291 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:09,291 INFO ]: Analyzing trace with hash 1908115624, now seen corresponding path program 8 times [2018-06-25 09:00:09,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:09,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:09,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:09,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,302 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,417 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:09,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:09,417 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-25 09:00:09,423 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:09,467 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:09,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,469 INFO ]: Computing forward predicates... [2018-06-25 09:00:09,553 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:09,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:09,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:00:09,574 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:09,574 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:09,574 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:09,574 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 16 states. [2018-06-25 09:00:09,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:09,827 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-25 09:00:09,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:00:09,828 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-25 09:00:09,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:09,828 INFO ]: With dead ends: 25 [2018-06-25 09:00:09,828 INFO ]: Without dead ends: 21 [2018-06-25 09:00:09,829 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:00:09,829 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:00:09,830 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:00:09,830 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:00:09,830 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-25 09:00:09,830 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2018-06-25 09:00:09,831 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:09,831 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-25 09:00:09,831 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:09,831 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-25 09:00:09,831 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:00:09,831 INFO ]: Found error trace [2018-06-25 09:00:09,831 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:09,831 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:09,833 INFO ]: Analyzing trace with hash 1723390208, now seen corresponding path program 9 times [2018-06-25 09:00:09,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:09,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:09,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,833 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:09,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:09,849 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:09,972 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:09,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:09,972 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-25 09:00:09,980 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:10,017 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:00:10,017 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:10,021 INFO ]: Computing forward predicates... [2018-06-25 09:00:10,266 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:10,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:10,285 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-25 09:00:10,286 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:00:10,286 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:00:10,286 INFO ]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:00:10,286 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2018-06-25 09:00:10,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:10,669 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-25 09:00:10,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:00:10,669 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-25 09:00:10,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:10,670 INFO ]: With dead ends: 34 [2018-06-25 09:00:10,670 INFO ]: Without dead ends: 34 [2018-06-25 09:00:10,670 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:10,670 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:00:10,673 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-25 09:00:10,673 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:00:10,674 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-25 09:00:10,674 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-25 09:00:10,674 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:10,674 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-25 09:00:10,674 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:00:10,674 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-25 09:00:10,674 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:00:10,674 INFO ]: Found error trace [2018-06-25 09:00:10,674 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:10,674 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:10,674 INFO ]: Analyzing trace with hash 291869608, now seen corresponding path program 10 times [2018-06-25 09:00:10,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:10,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:10,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:10,675 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:10,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:10,686 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:10,939 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:10,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:10,939 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-25 09:00:10,953 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:10,979 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:10,979 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:10,982 INFO ]: Computing forward predicates... [2018-06-25 09:00:11,495 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:11,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:11,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-25 09:00:11,517 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:00:11,517 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:00:11,518 INFO ]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:00:11,518 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 19 states. [2018-06-25 09:00:11,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:11,636 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-25 09:00:11,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:00:11,637 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-25 09:00:11,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:11,637 INFO ]: With dead ends: 31 [2018-06-25 09:00:11,637 INFO ]: Without dead ends: 22 [2018-06-25 09:00:11,638 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:00:11,638 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:00:11,639 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:00:11,639 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:00:11,640 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-25 09:00:11,640 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 21 [2018-06-25 09:00:11,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:11,640 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-25 09:00:11,640 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:00:11,640 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-25 09:00:11,640 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:00:11,640 INFO ]: Found error trace [2018-06-25 09:00:11,640 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:11,640 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:11,640 INFO ]: Analyzing trace with hash 1041170400, now seen corresponding path program 11 times [2018-06-25 09:00:11,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:11,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:11,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:11,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:11,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:11,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:11,960 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:11,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:11,960 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-25 09:00:11,966 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:11,991 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:00:11,991 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:11,993 INFO ]: Computing forward predicates... [2018-06-25 09:00:12,050 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:00:12,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:12,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-25 09:00:12,069 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:00:12,070 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:00:12,070 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:00:12,070 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 16 states. [2018-06-25 09:00:12,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:12,140 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-25 09:00:12,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:00:12,140 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-25 09:00:12,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:12,140 INFO ]: With dead ends: 23 [2018-06-25 09:00:12,140 INFO ]: Without dead ends: 23 [2018-06-25 09:00:12,141 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:00:12,141 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:00:12,142 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:00:12,142 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:00:12,142 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-25 09:00:12,143 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2018-06-25 09:00:12,143 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:12,143 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-25 09:00:12,143 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:00:12,143 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-25 09:00:12,143 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:00:12,143 INFO ]: Found error trace [2018-06-25 09:00:12,143 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:12,143 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:12,144 INFO ]: Analyzing trace with hash -2029927156, now seen corresponding path program 12 times [2018-06-25 09:00:12,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:12,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:12,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:12,144 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:12,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:12,154 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:12,725 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:12,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:12,725 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-25 09:00:12,730 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:12,754 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:00:12,754 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:12,756 INFO ]: Computing forward predicates... [2018-06-25 09:00:12,885 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:12,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:12,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:00:12,909 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:00:12,909 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:00:12,909 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:00:12,909 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 20 states. [2018-06-25 09:00:13,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:13,199 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-25 09:00:13,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:00:13,200 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-25 09:00:13,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:13,200 INFO ]: With dead ends: 29 [2018-06-25 09:00:13,200 INFO ]: Without dead ends: 24 [2018-06-25 09:00:13,201 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:00:13,201 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:00:13,202 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:00:13,202 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:00:13,203 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-25 09:00:13,203 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2018-06-25 09:00:13,203 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:13,203 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-25 09:00:13,203 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:00:13,203 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-25 09:00:13,203 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:00:13,203 INFO ]: Found error trace [2018-06-25 09:00:13,203 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:13,203 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:13,204 INFO ]: Analyzing trace with hash 2028312868, now seen corresponding path program 13 times [2018-06-25 09:00:13,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:13,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:13,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:13,204 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:13,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:13,217 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:13,402 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:13,402 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:13,402 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-25 09:00:13,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:13,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:13,437 INFO ]: Computing forward predicates... [2018-06-25 09:00:13,717 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:13,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:13,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-06-25 09:00:13,736 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:00:13,737 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:00:13,737 INFO ]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:00:13,737 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 24 states. [2018-06-25 09:00:14,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:14,099 INFO ]: Finished difference Result 39 states and 44 transitions. [2018-06-25 09:00:14,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:00:14,099 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-25 09:00:14,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:14,099 INFO ]: With dead ends: 39 [2018-06-25 09:00:14,099 INFO ]: Without dead ends: 39 [2018-06-25 09:00:14,100 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:00:14,100 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:00:14,102 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-25 09:00:14,102 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:00:14,102 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-25 09:00:14,102 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2018-06-25 09:00:14,102 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:14,102 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-25 09:00:14,102 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:00:14,102 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-25 09:00:14,103 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:00:14,103 INFO ]: Found error trace [2018-06-25 09:00:14,103 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:14,103 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:14,103 INFO ]: Analyzing trace with hash -1015265268, now seen corresponding path program 14 times [2018-06-25 09:00:14,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:14,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:14,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:14,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:14,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:14,115 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:14,310 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:14,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:14,310 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-25 09:00:14,316 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:14,341 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:14,341 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:14,344 INFO ]: Computing forward predicates... [2018-06-25 09:00:14,487 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:14,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:14,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-25 09:00:14,508 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:00:14,508 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:00:14,508 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:00:14,509 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 24 states. [2018-06-25 09:00:15,342 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 09:00:15,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:15,689 INFO ]: Finished difference Result 47 states and 53 transitions. [2018-06-25 09:00:15,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:00:15,689 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-25 09:00:15,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:15,689 INFO ]: With dead ends: 47 [2018-06-25 09:00:15,689 INFO ]: Without dead ends: 35 [2018-06-25 09:00:15,689 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:00:15,690 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:00:15,691 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-25 09:00:15,691 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:00:15,692 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-06-25 09:00:15,692 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2018-06-25 09:00:15,692 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:15,692 INFO ]: Abstraction has 27 states and 30 transitions. [2018-06-25 09:00:15,692 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:00:15,692 INFO ]: Start isEmpty. Operand 27 states and 30 transitions. [2018-06-25 09:00:15,692 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:00:15,692 INFO ]: Found error trace [2018-06-25 09:00:15,692 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:15,692 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:15,693 INFO ]: Analyzing trace with hash 1803257412, now seen corresponding path program 15 times [2018-06-25 09:00:15,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:15,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:15,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:15,693 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:15,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:15,703 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:15,892 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:15,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:15,892 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-25 09:00:15,898 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:15,947 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:00:15,947 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:15,950 INFO ]: Computing forward predicates... [2018-06-25 09:00:16,086 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:00:16,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:16,105 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-25 09:00:16,105 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:00:16,105 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:00:16,106 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:00:16,106 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 20 states. [2018-06-25 09:00:16,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:16,540 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-25 09:00:16,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:00:16,540 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-25 09:00:16,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:16,540 INFO ]: With dead ends: 33 [2018-06-25 09:00:16,540 INFO ]: Without dead ends: 27 [2018-06-25 09:00:16,541 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:00:16,541 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:00:16,543 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 09:00:16,543 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:00:16,544 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-25 09:00:16,544 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-06-25 09:00:16,544 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:16,544 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-25 09:00:16,544 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:00:16,544 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-25 09:00:16,544 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:00:16,544 INFO ]: Found error trace [2018-06-25 09:00:16,544 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:16,544 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:16,545 INFO ]: Analyzing trace with hash 1410115456, now seen corresponding path program 16 times [2018-06-25 09:00:16,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:16,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:16,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:16,545 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:16,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:16,562 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:16,888 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:16,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:16,888 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:16,893 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:16,932 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:16,932 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:16,935 INFO ]: Computing forward predicates... [2018-06-25 09:00:17,310 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:17,330 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:17,330 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-06-25 09:00:17,330 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:00:17,330 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:00:17,331 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:17,331 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 28 states. [2018-06-25 09:00:17,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:17,893 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-25 09:00:17,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:00:17,893 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-25 09:00:17,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:17,894 INFO ]: With dead ends: 44 [2018-06-25 09:00:17,894 INFO ]: Without dead ends: 44 [2018-06-25 09:00:17,894 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:00:17,894 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:00:17,897 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-06-25 09:00:17,897 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:00:17,898 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-25 09:00:17,898 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-25 09:00:17,898 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:17,898 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-25 09:00:17,898 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:00:17,898 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-25 09:00:17,899 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:00:17,899 INFO ]: Found error trace [2018-06-25 09:00:17,899 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:17,899 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:17,899 INFO ]: Analyzing trace with hash -1543924184, now seen corresponding path program 17 times [2018-06-25 09:00:17,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:17,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:17,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:17,899 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:17,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:17,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:18,055 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:18,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:18,055 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-25 09:00:18,063 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:18,094 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:00:18,094 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:18,097 INFO ]: Computing forward predicates... [2018-06-25 09:00:18,262 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:18,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:18,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-06-25 09:00:18,281 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:00:18,281 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:00:18,282 INFO ]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:18,282 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 28 states. [2018-06-25 09:00:18,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:18,908 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-25 09:00:18,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:00:18,909 INFO ]: Start accepts. Automaton has 28 states. Word has length 27 [2018-06-25 09:00:18,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:18,909 INFO ]: With dead ends: 53 [2018-06-25 09:00:18,909 INFO ]: Without dead ends: 39 [2018-06-25 09:00:18,910 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=599, Invalid=1851, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 09:00:18,910 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:00:18,912 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-06-25 09:00:18,912 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:00:18,912 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-25 09:00:18,912 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2018-06-25 09:00:18,912 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:18,912 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-25 09:00:18,912 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:00:18,912 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-25 09:00:18,913 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:00:18,913 INFO ]: Found error trace [2018-06-25 09:00:18,913 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:18,913 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:18,913 INFO ]: Analyzing trace with hash 1226974816, now seen corresponding path program 18 times [2018-06-25 09:00:18,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:18,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:18,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:18,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:18,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:18,928 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:19,822 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:19,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:19,822 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-25 09:00:19,827 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:19,857 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:00:19,857 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:19,860 INFO ]: Computing forward predicates... [2018-06-25 09:00:20,088 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:00:20,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:20,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-25 09:00:20,108 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:00:20,108 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:00:20,108 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:00:20,108 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 23 states. [2018-06-25 09:00:20,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:20,761 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-25 09:00:20,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:00:20,762 INFO ]: Start accepts. Automaton has 23 states. Word has length 27 [2018-06-25 09:00:20,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:20,762 INFO ]: With dead ends: 37 [2018-06-25 09:00:20,762 INFO ]: Without dead ends: 30 [2018-06-25 09:00:20,763 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:00:20,763 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:00:20,765 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 09:00:20,765 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:00:20,766 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-25 09:00:20,766 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-25 09:00:20,766 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:20,766 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-25 09:00:20,766 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:00:20,766 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-25 09:00:20,767 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:00:20,767 INFO ]: Found error trace [2018-06-25 09:00:20,767 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:20,767 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:20,767 INFO ]: Analyzing trace with hash -467976540, now seen corresponding path program 19 times [2018-06-25 09:00:20,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:20,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:20,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:20,768 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:20,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:20,786 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:21,043 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:21,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:21,044 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-25 09:00:21,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:21,083 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:21,087 INFO ]: Computing forward predicates... [2018-06-25 09:00:21,482 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:21,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:21,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-06-25 09:00:21,501 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:00:21,501 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:00:21,502 INFO ]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:00:21,502 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 32 states. [2018-06-25 09:00:22,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:22,101 INFO ]: Finished difference Result 49 states and 54 transitions. [2018-06-25 09:00:22,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:00:22,101 INFO ]: Start accepts. Automaton has 32 states. Word has length 29 [2018-06-25 09:00:22,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:22,101 INFO ]: With dead ends: 49 [2018-06-25 09:00:22,101 INFO ]: Without dead ends: 49 [2018-06-25 09:00:22,102 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=1911, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:00:22,102 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:00:22,103 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-06-25 09:00:22,104 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:00:22,104 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-25 09:00:22,104 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-25 09:00:22,104 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:22,104 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-25 09:00:22,104 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:00:22,104 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-25 09:00:22,105 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:00:22,105 INFO ]: Found error trace [2018-06-25 09:00:22,105 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:22,105 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:22,105 INFO ]: Analyzing trace with hash -1756532340, now seen corresponding path program 20 times [2018-06-25 09:00:22,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:22,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:22,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:22,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:22,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:22,118 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:22,642 INFO ]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:22,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:22,642 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-25 09:00:22,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:22,680 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:22,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:22,682 INFO ]: Computing forward predicates... [2018-06-25 09:00:23,258 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:23,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:23,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-25 09:00:23,277 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:00:23,277 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:00:23,278 INFO ]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:00:23,278 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 32 states. [2018-06-25 09:00:24,589 WARN ]: Spent 397.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-06-25 09:00:25,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:25,040 INFO ]: Finished difference Result 59 states and 65 transitions. [2018-06-25 09:00:25,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-25 09:00:25,041 INFO ]: Start accepts. Automaton has 32 states. Word has length 30 [2018-06-25 09:00:25,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:25,041 INFO ]: With dead ends: 59 [2018-06-25 09:00:25,041 INFO ]: Without dead ends: 43 [2018-06-25 09:00:25,042 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=772, Invalid=2420, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 09:00:25,042 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:00:25,044 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-25 09:00:25,044 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:00:25,044 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-25 09:00:25,044 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-06-25 09:00:25,044 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:25,045 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-25 09:00:25,045 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:00:25,045 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-25 09:00:25,052 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:00:25,052 INFO ]: Found error trace [2018-06-25 09:00:25,052 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:25,052 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:25,053 INFO ]: Analyzing trace with hash -1802316860, now seen corresponding path program 21 times [2018-06-25 09:00:25,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:25,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:25,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:25,053 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:25,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:25,070 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:25,606 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:25,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:25,606 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-25 09:00:25,614 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:25,651 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:00:25,651 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:25,654 INFO ]: Computing forward predicates... [2018-06-25 09:00:26,394 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 09:00:26,425 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:26,425 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-25 09:00:26,425 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:00:26,426 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:00:26,426 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:00:26,426 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 25 states. [2018-06-25 09:00:26,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:26,666 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-25 09:00:26,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:00:26,666 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-25 09:00:26,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:26,667 INFO ]: With dead ends: 40 [2018-06-25 09:00:26,667 INFO ]: Without dead ends: 40 [2018-06-25 09:00:26,667 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:00:26,667 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:00:26,668 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-06-25 09:00:26,668 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:00:26,669 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-25 09:00:26,669 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-25 09:00:26,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:26,669 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-25 09:00:26,669 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:00:26,669 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-25 09:00:26,669 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:00:26,669 INFO ]: Found error trace [2018-06-25 09:00:26,669 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:26,669 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:26,669 INFO ]: Analyzing trace with hash 16281000, now seen corresponding path program 22 times [2018-06-25 09:00:26,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:26,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:26,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:26,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:26,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:26,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:26,986 INFO ]: Checked inductivity of 77 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:26,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:26,986 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-25 09:00:26,992 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:27,026 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:27,026 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:27,028 INFO ]: Computing forward predicates... [2018-06-25 09:00:27,150 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:27,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:27,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-25 09:00:27,169 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:00:27,169 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:00:27,169 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:00:27,169 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 26 states. [2018-06-25 09:00:27,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:27,325 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-25 09:00:27,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:00:27,326 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-25 09:00:27,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:27,326 INFO ]: With dead ends: 41 [2018-06-25 09:00:27,326 INFO ]: Without dead ends: 33 [2018-06-25 09:00:27,326 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:00:27,326 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:00:27,327 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 09:00:27,327 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:00:27,328 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-25 09:00:27,328 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2018-06-25 09:00:27,328 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:27,328 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-25 09:00:27,328 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:00:27,328 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-25 09:00:27,328 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:00:27,328 INFO ]: Found error trace [2018-06-25 09:00:27,329 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:27,329 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:27,329 INFO ]: Analyzing trace with hash -965192192, now seen corresponding path program 23 times [2018-06-25 09:00:27,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:27,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:27,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:27,329 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:27,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:27,348 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:27,876 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:27,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:27,876 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-25 09:00:27,883 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:27,931 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:00:27,931 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:27,936 INFO ]: Computing forward predicates... [2018-06-25 09:00:28,588 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:28,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:28,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-06-25 09:00:28,619 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:00:28,620 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:00:28,620 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1183, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:00:28,620 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 36 states. [2018-06-25 09:00:28,899 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 09:00:29,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:29,803 INFO ]: Finished difference Result 54 states and 59 transitions. [2018-06-25 09:00:29,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:00:29,805 INFO ]: Start accepts. Automaton has 36 states. Word has length 32 [2018-06-25 09:00:29,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:29,806 INFO ]: With dead ends: 54 [2018-06-25 09:00:29,806 INFO ]: Without dead ends: 54 [2018-06-25 09:00:29,806 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=181, Invalid=2471, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:00:29,806 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 09:00:29,808 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-06-25 09:00:29,808 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:00:29,808 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-06-25 09:00:29,808 INFO ]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-06-25 09:00:29,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:29,808 INFO ]: Abstraction has 35 states and 38 transitions. [2018-06-25 09:00:29,808 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:00:29,809 INFO ]: Start isEmpty. Operand 35 states and 38 transitions. [2018-06-25 09:00:29,809 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:00:29,809 INFO ]: Found error trace [2018-06-25 09:00:29,809 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:29,809 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:29,809 INFO ]: Analyzing trace with hash -1326090072, now seen corresponding path program 24 times [2018-06-25 09:00:29,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:29,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:29,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:29,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:29,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:29,827 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:30,081 INFO ]: Checked inductivity of 92 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:30,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:30,081 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-25 09:00:30,088 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:30,127 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:00:30,127 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:30,130 INFO ]: Computing forward predicates... [2018-06-25 09:00:30,886 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:30,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:30,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-25 09:00:30,916 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:00:30,916 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:00:30,916 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:00:30,916 INFO ]: Start difference. First operand 35 states and 38 transitions. Second operand 36 states. [2018-06-25 09:00:31,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:31,769 INFO ]: Finished difference Result 65 states and 71 transitions. [2018-06-25 09:00:31,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-25 09:00:31,772 INFO ]: Start accepts. Automaton has 36 states. Word has length 33 [2018-06-25 09:00:31,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:31,772 INFO ]: With dead ends: 65 [2018-06-25 09:00:31,772 INFO ]: Without dead ends: 47 [2018-06-25 09:00:31,773 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:00:31,774 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 09:00:31,775 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-06-25 09:00:31,775 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:00:31,775 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-25 09:00:31,775 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 33 [2018-06-25 09:00:31,775 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:31,775 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-25 09:00:31,775 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:00:31,775 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-25 09:00:31,783 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:00:31,783 INFO ]: Found error trace [2018-06-25 09:00:31,783 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:31,783 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:31,783 INFO ]: Analyzing trace with hash 1919626464, now seen corresponding path program 25 times [2018-06-25 09:00:31,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:31,783 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:31,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:31,784 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:31,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:31,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:31,943 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:31,943 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:31,943 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-25 09:00:31,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:31,992 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:31,994 INFO ]: Computing forward predicates... [2018-06-25 09:00:32,345 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-25 09:00:32,367 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:32,367 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-25 09:00:32,368 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:00:32,368 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:00:32,368 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:00:32,368 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 28 states. [2018-06-25 09:00:32,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:32,517 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-25 09:00:32,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:00:32,518 INFO ]: Start accepts. Automaton has 28 states. Word has length 33 [2018-06-25 09:00:32,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:32,518 INFO ]: With dead ends: 44 [2018-06-25 09:00:32,518 INFO ]: Without dead ends: 44 [2018-06-25 09:00:32,518 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:00:32,518 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:00:32,520 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 35. [2018-06-25 09:00:32,520 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:00:32,520 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-25 09:00:32,520 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-25 09:00:32,520 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:32,520 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-25 09:00:32,520 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:00:32,520 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-25 09:00:32,520 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:00:32,520 INFO ]: Found error trace [2018-06-25 09:00:32,521 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:32,521 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:32,521 INFO ]: Analyzing trace with hash -567592948, now seen corresponding path program 26 times [2018-06-25 09:00:32,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:32,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:32,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:32,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:32,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:32,536 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:32,836 INFO ]: Checked inductivity of 100 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:32,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:32,836 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-25 09:00:32,844 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:32,887 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:32,887 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:32,890 INFO ]: Computing forward predicates... [2018-06-25 09:00:33,206 INFO ]: Checked inductivity of 100 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:33,225 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:33,225 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-25 09:00:33,225 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:00:33,225 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:00:33,226 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:00:33,226 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 36 states. [2018-06-25 09:00:33,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:33,616 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-25 09:00:33,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:00:33,617 INFO ]: Start accepts. Automaton has 36 states. Word has length 34 [2018-06-25 09:00:33,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:33,617 INFO ]: With dead ends: 45 [2018-06-25 09:00:33,617 INFO ]: Without dead ends: 36 [2018-06-25 09:00:33,618 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2018-06-25 09:00:33,618 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:00:33,618 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:00:33,618 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:00:33,619 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-25 09:00:33,619 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2018-06-25 09:00:33,619 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:33,619 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-25 09:00:33,619 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:00:33,619 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-25 09:00:33,619 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:00:33,619 INFO ]: Found error trace [2018-06-25 09:00:33,619 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:33,619 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:33,619 INFO ]: Analyzing trace with hash -343735260, now seen corresponding path program 27 times [2018-06-25 09:00:33,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:33,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:33,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:33,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:33,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:33,638 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:34,070 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:34,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:34,070 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-25 09:00:34,085 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:34,130 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:00:34,130 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:34,134 INFO ]: Computing forward predicates... [2018-06-25 09:00:34,763 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:34,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:34,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-06-25 09:00:34,782 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:00:34,783 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:00:34,783 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1474, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:00:34,783 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 40 states. [2018-06-25 09:00:35,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:35,619 INFO ]: Finished difference Result 59 states and 64 transitions. [2018-06-25 09:00:35,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:00:35,619 INFO ]: Start accepts. Automaton has 40 states. Word has length 35 [2018-06-25 09:00:35,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:35,620 INFO ]: With dead ends: 59 [2018-06-25 09:00:35,620 INFO ]: Without dead ends: 59 [2018-06-25 09:00:35,621 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=203, Invalid=3103, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 09:00:35,621 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:00:35,622 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 38. [2018-06-25 09:00:35,622 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:00:35,623 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-25 09:00:35,623 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-25 09:00:35,623 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:35,623 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-25 09:00:35,623 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:00:35,623 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-25 09:00:35,623 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:00:35,623 INFO ]: Found error trace [2018-06-25 09:00:35,623 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:35,623 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:35,623 INFO ]: Analyzing trace with hash -1994081524, now seen corresponding path program 28 times [2018-06-25 09:00:35,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:35,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:35,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:35,624 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:35,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:35,637 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:36,111 INFO ]: Checked inductivity of 117 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:36,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:36,111 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-25 09:00:36,125 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:36,163 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:36,163 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:36,166 INFO ]: Computing forward predicates... [2018-06-25 09:00:36,373 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:36,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:36,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-25 09:00:36,393 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:00:36,393 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:00:36,393 INFO ]: CoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:00:36,393 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 34 states. [2018-06-25 09:00:36,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:36,575 INFO ]: Finished difference Result 56 states and 60 transitions. [2018-06-25 09:00:36,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:00:36,576 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-25 09:00:36,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:36,576 INFO ]: With dead ends: 56 [2018-06-25 09:00:36,576 INFO ]: Without dead ends: 37 [2018-06-25 09:00:36,576 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=470, Invalid=1510, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:00:36,577 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:00:36,577 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:00:36,577 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:00:36,578 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-25 09:00:36,578 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 36 [2018-06-25 09:00:36,578 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:36,578 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-25 09:00:36,578 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:00:36,578 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-25 09:00:36,578 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:00:36,578 INFO ]: Found error trace [2018-06-25 09:00:36,578 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:36,578 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:36,578 INFO ]: Analyzing trace with hash -1006747324, now seen corresponding path program 29 times [2018-06-25 09:00:36,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:36,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:36,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:36,579 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:36,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:36,590 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:38,070 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:38,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:38,070 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-25 09:00:38,076 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:38,120 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:00:38,120 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:38,124 INFO ]: Computing forward predicates... [2018-06-25 09:00:38,268 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-25 09:00:38,287 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:38,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-25 09:00:38,287 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:00:38,287 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:00:38,287 INFO ]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:00:38,288 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 31 states. [2018-06-25 09:00:38,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:38,484 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-25 09:00:38,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:00:38,484 INFO ]: Start accepts. Automaton has 31 states. Word has length 36 [2018-06-25 09:00:38,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:38,484 INFO ]: With dead ends: 38 [2018-06-25 09:00:38,484 INFO ]: Without dead ends: 38 [2018-06-25 09:00:38,485 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:00:38,485 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:00:38,486 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 09:00:38,486 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:00:38,486 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-25 09:00:38,486 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2018-06-25 09:00:38,486 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:38,487 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-25 09:00:38,487 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:00:38,487 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-25 09:00:38,487 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:00:38,487 INFO ]: Found error trace [2018-06-25 09:00:38,487 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:38,487 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:38,487 INFO ]: Analyzing trace with hash -1090867160, now seen corresponding path program 30 times [2018-06-25 09:00:38,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:38,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:38,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:38,488 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:38,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:38,497 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:38,828 INFO ]: Checked inductivity of 126 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:38,828 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:38,828 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-25 09:00:38,834 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:38,878 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:00:38,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:38,882 INFO ]: Computing forward predicates... [2018-06-25 09:00:39,207 INFO ]: Checked inductivity of 126 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:39,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:39,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-25 09:00:39,226 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:00:39,227 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:00:39,227 INFO ]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:00:39,227 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 40 states. [2018-06-25 09:00:39,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:39,825 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-25 09:00:39,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:00:39,825 INFO ]: Start accepts. Automaton has 40 states. Word has length 37 [2018-06-25 09:00:39,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:39,825 INFO ]: With dead ends: 49 [2018-06-25 09:00:39,825 INFO ]: Without dead ends: 39 [2018-06-25 09:00:39,826 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=807, Invalid=2733, Unknown=0, NotChecked=0, Total=3540 [2018-06-25 09:00:39,826 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:00:39,827 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:00:39,827 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:00:39,827 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-25 09:00:39,827 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2018-06-25 09:00:39,827 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:39,827 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-25 09:00:39,827 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:00:39,827 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-25 09:00:39,827 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:00:39,827 INFO ]: Found error trace [2018-06-25 09:00:39,827 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:39,828 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:39,828 INFO ]: Analyzing trace with hash 1162077312, now seen corresponding path program 31 times [2018-06-25 09:00:39,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:39,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:39,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:39,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:39,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:39,845 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:40,214 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:40,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:40,214 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:40,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:40,265 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:40,270 INFO ]: Computing forward predicates... [2018-06-25 09:00:41,020 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:41,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:41,049 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-06-25 09:00:41,049 INFO ]: Interpolant automaton has 44 states [2018-06-25 09:00:41,049 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-25 09:00:41,050 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1797, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:00:41,050 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 44 states. [2018-06-25 09:00:42,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:42,066 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-25 09:00:42,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:00:42,066 INFO ]: Start accepts. Automaton has 44 states. Word has length 38 [2018-06-25 09:00:42,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:42,067 INFO ]: With dead ends: 64 [2018-06-25 09:00:42,067 INFO ]: Without dead ends: 64 [2018-06-25 09:00:42,067 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=225, Invalid=3807, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:00:42,067 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 09:00:42,068 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-25 09:00:42,068 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 09:00:42,068 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-25 09:00:42,068 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-25 09:00:42,068 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:42,068 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-25 09:00:42,068 INFO ]: Interpolant automaton has 44 states. [2018-06-25 09:00:42,068 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-25 09:00:42,069 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:00:42,069 INFO ]: Found error trace [2018-06-25 09:00:42,069 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:42,069 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:42,069 INFO ]: Analyzing trace with hash -2011088088, now seen corresponding path program 32 times [2018-06-25 09:00:42,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:42,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:42,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:42,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:42,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:42,089 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:42,434 INFO ]: Checked inductivity of 145 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:42,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:42,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:42,439 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:42,482 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:42,482 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:42,485 INFO ]: Computing forward predicates... [2018-06-25 09:00:42,851 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:42,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:42,870 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-06-25 09:00:42,870 INFO ]: Interpolant automaton has 44 states [2018-06-25 09:00:42,870 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-25 09:00:42,870 INFO ]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 09:00:42,870 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 44 states. [2018-06-25 09:00:44,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:44,205 INFO ]: Finished difference Result 77 states and 83 transitions. [2018-06-25 09:00:44,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-25 09:00:44,206 INFO ]: Start accepts. Automaton has 44 states. Word has length 39 [2018-06-25 09:00:44,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:44,206 INFO ]: With dead ends: 77 [2018-06-25 09:00:44,206 INFO ]: Without dead ends: 55 [2018-06-25 09:00:44,206 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1423, Invalid=4583, Unknown=0, NotChecked=0, Total=6006 [2018-06-25 09:00:44,206 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:00:44,207 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-06-25 09:00:44,207 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:00:44,207 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-25 09:00:44,207 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2018-06-25 09:00:44,207 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:44,207 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-25 09:00:44,207 INFO ]: Interpolant automaton has 44 states. [2018-06-25 09:00:44,207 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-25 09:00:44,208 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:00:44,208 INFO ]: Found error trace [2018-06-25 09:00:44,208 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:44,208 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:44,208 INFO ]: Analyzing trace with hash 1924272992, now seen corresponding path program 33 times [2018-06-25 09:00:44,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:44,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:44,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:44,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:44,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:44,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:44,778 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:44,778 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:44,778 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:44,784 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:00:44,834 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:00:44,834 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:44,837 INFO ]: Computing forward predicates... [2018-06-25 09:00:45,077 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:00:45,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:45,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-25 09:00:45,096 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:00:45,096 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:00:45,096 INFO ]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:00:45,096 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 35 states. [2018-06-25 09:00:45,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:45,760 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-25 09:00:45,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 09:00:45,760 INFO ]: Start accepts. Automaton has 35 states. Word has length 39 [2018-06-25 09:00:45,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:45,760 INFO ]: With dead ends: 53 [2018-06-25 09:00:45,760 INFO ]: Without dead ends: 42 [2018-06-25 09:00:45,760 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1278, Invalid=3144, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 09:00:45,761 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:00:45,762 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 09:00:45,762 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:00:45,762 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-25 09:00:45,762 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-25 09:00:45,762 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:45,762 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-25 09:00:45,762 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:00:45,762 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-25 09:00:45,762 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:00:45,762 INFO ]: Found error trace [2018-06-25 09:00:45,762 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:45,762 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:45,763 INFO ]: Analyzing trace with hash 164948388, now seen corresponding path program 34 times [2018-06-25 09:00:45,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:45,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:45,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:45,763 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:45,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:45,786 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:46,211 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:46,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:46,260 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:46,265 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:00:46,314 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:00:46,314 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:46,321 INFO ]: Computing forward predicates... [2018-06-25 09:00:47,267 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:47,287 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:47,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-06-25 09:00:47,287 INFO ]: Interpolant automaton has 48 states [2018-06-25 09:00:47,287 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-25 09:00:47,288 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2152, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:00:47,288 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 48 states. [2018-06-25 09:00:48,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:48,511 INFO ]: Finished difference Result 69 states and 74 transitions. [2018-06-25 09:00:48,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:00:48,511 INFO ]: Start accepts. Automaton has 48 states. Word has length 41 [2018-06-25 09:00:48,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:48,511 INFO ]: With dead ends: 69 [2018-06-25 09:00:48,511 INFO ]: Without dead ends: 69 [2018-06-25 09:00:48,512 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=247, Invalid=4583, Unknown=0, NotChecked=0, Total=4830 [2018-06-25 09:00:48,512 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-25 09:00:48,513 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-06-25 09:00:48,513 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:00:48,514 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-25 09:00:48,514 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-25 09:00:48,514 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:48,514 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-25 09:00:48,514 INFO ]: Interpolant automaton has 48 states. [2018-06-25 09:00:48,514 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-25 09:00:48,514 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:00:48,514 INFO ]: Found error trace [2018-06-25 09:00:48,514 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:48,514 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:48,514 INFO ]: Analyzing trace with hash 1228547212, now seen corresponding path program 35 times [2018-06-25 09:00:48,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:48,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:48,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:48,517 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:48,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:48,531 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:48,903 INFO ]: Checked inductivity of 176 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:48,903 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:48,903 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:48,909 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:00:48,965 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:00:48,965 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:48,969 INFO ]: Computing forward predicates... [2018-06-25 09:00:49,360 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:49,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:49,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-25 09:00:49,379 INFO ]: Interpolant automaton has 48 states [2018-06-25 09:00:49,380 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-25 09:00:49,380 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:00:49,380 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 48 states. [2018-06-25 09:00:50,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:50,675 INFO ]: Finished difference Result 83 states and 89 transitions. [2018-06-25 09:00:50,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-25 09:00:50,675 INFO ]: Start accepts. Automaton has 48 states. Word has length 42 [2018-06-25 09:00:50,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:50,675 INFO ]: With dead ends: 83 [2018-06-25 09:00:50,675 INFO ]: Without dead ends: 59 [2018-06-25 09:00:50,676 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1684, Invalid=5456, Unknown=0, NotChecked=0, Total=7140 [2018-06-25 09:00:50,676 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:00:50,677 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-06-25 09:00:50,678 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:00:50,678 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-06-25 09:00:50,678 INFO ]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-06-25 09:00:50,678 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:50,678 INFO ]: Abstraction has 45 states and 48 transitions. [2018-06-25 09:00:50,678 INFO ]: Interpolant automaton has 48 states. [2018-06-25 09:00:50,678 INFO ]: Start isEmpty. Operand 45 states and 48 transitions. [2018-06-25 09:00:50,678 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:00:50,678 INFO ]: Found error trace [2018-06-25 09:00:50,678 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:50,678 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:50,679 INFO ]: Analyzing trace with hash -755642684, now seen corresponding path program 36 times [2018-06-25 09:00:50,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:50,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:50,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:50,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:50,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:50,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:51,197 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:51,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:51,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:51,203 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:00:51,255 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:00:51,255 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:51,259 INFO ]: Computing forward predicates... [2018-06-25 09:00:51,516 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-25 09:00:51,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:51,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-25 09:00:51,535 INFO ]: Interpolant automaton has 38 states [2018-06-25 09:00:51,535 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 09:00:51,535 INFO ]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 09:00:51,535 INFO ]: Start difference. First operand 45 states and 48 transitions. Second operand 38 states. [2018-06-25 09:00:52,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:52,268 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-25 09:00:52,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-25 09:00:52,268 INFO ]: Start accepts. Automaton has 38 states. Word has length 42 [2018-06-25 09:00:52,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:52,269 INFO ]: With dead ends: 57 [2018-06-25 09:00:52,269 INFO ]: Without dead ends: 45 [2018-06-25 09:00:52,269 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1514, Invalid=3742, Unknown=0, NotChecked=0, Total=5256 [2018-06-25 09:00:52,269 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:00:52,271 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:00:52,271 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:00:52,271 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-25 09:00:52,271 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-06-25 09:00:52,271 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:52,271 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-25 09:00:52,271 INFO ]: Interpolant automaton has 38 states. [2018-06-25 09:00:52,271 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-25 09:00:52,271 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:00:52,271 INFO ]: Found error trace [2018-06-25 09:00:52,271 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:52,272 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:52,272 INFO ]: Analyzing trace with hash -440970496, now seen corresponding path program 37 times [2018-06-25 09:00:52,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:52,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:52,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:52,272 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:52,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:52,293 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:54,028 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:54,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:54,028 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:54,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:54,088 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:54,094 INFO ]: Computing forward predicates... [2018-06-25 09:00:55,190 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:55,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:55,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2018-06-25 09:00:55,209 INFO ]: Interpolant automaton has 52 states [2018-06-25 09:00:55,209 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-25 09:00:55,209 INFO ]: CoverageRelationStatistics Valid=113, Invalid=2539, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:00:55,209 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 52 states. [2018-06-25 09:00:56,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:56,551 INFO ]: Finished difference Result 74 states and 79 transitions. [2018-06-25 09:00:56,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:00:56,557 INFO ]: Start accepts. Automaton has 52 states. Word has length 44 [2018-06-25 09:00:56,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:56,557 INFO ]: With dead ends: 74 [2018-06-25 09:00:56,557 INFO ]: Without dead ends: 74 [2018-06-25 09:00:56,558 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=269, Invalid=5431, Unknown=0, NotChecked=0, Total=5700 [2018-06-25 09:00:56,558 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-25 09:00:56,560 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 47. [2018-06-25 09:00:56,560 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:00:56,560 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-06-25 09:00:56,560 INFO ]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-06-25 09:00:56,560 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:56,560 INFO ]: Abstraction has 47 states and 50 transitions. [2018-06-25 09:00:56,560 INFO ]: Interpolant automaton has 52 states. [2018-06-25 09:00:56,560 INFO ]: Start isEmpty. Operand 47 states and 50 transitions. [2018-06-25 09:00:56,560 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:00:56,560 INFO ]: Found error trace [2018-06-25 09:00:56,560 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:56,560 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:56,561 INFO ]: Analyzing trace with hash 1732566440, now seen corresponding path program 38 times [2018-06-25 09:00:56,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:56,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:56,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:56,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:00:56,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:56,576 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:56,901 INFO ]: Checked inductivity of 210 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:56,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:00:56,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:00:56,906 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:00:56,973 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:00:56,973 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:00:56,977 INFO ]: Computing forward predicates... [2018-06-25 09:00:57,441 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-25 09:00:57,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:00:57,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-06-25 09:00:57,460 INFO ]: Interpolant automaton has 52 states [2018-06-25 09:00:57,460 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-25 09:00:57,460 INFO ]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:00:57,460 INFO ]: Start difference. First operand 47 states and 50 transitions. Second operand 52 states. [2018-06-25 09:00:58,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:00:58,975 INFO ]: Finished difference Result 89 states and 95 transitions. [2018-06-25 09:00:58,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-25 09:00:58,975 INFO ]: Start accepts. Automaton has 52 states. Word has length 45 [2018-06-25 09:00:58,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:00:58,975 INFO ]: With dead ends: 89 [2018-06-25 09:00:58,975 INFO ]: Without dead ends: 63 [2018-06-25 09:00:58,976 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1967, Invalid=6405, Unknown=0, NotChecked=0, Total=8372 [2018-06-25 09:00:58,976 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-25 09:00:58,978 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 48. [2018-06-25 09:00:58,978 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:00:58,978 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-06-25 09:00:58,978 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 45 [2018-06-25 09:00:58,978 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:00:58,978 INFO ]: Abstraction has 48 states and 51 transitions. [2018-06-25 09:00:58,978 INFO ]: Interpolant automaton has 52 states. [2018-06-25 09:00:58,978 INFO ]: Start isEmpty. Operand 48 states and 51 transitions. [2018-06-25 09:00:58,978 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:00:58,978 INFO ]: Found error trace [2018-06-25 09:00:58,978 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:00:58,979 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:00:58,979 INFO ]: Analyzing trace with hash 1891555808, now seen corresponding path program 39 times [2018-06-25 09:00:58,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:00:58,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:00:58,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:58,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:00:58,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:00:58,996 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:00:59,605 WARN ]: Verification canceled [2018-06-25 09:00:59,610 WARN ]: Timeout [2018-06-25 09:00:59,610 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:00:59 BoogieIcfgContainer [2018-06-25 09:00:59,610 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:00:59,611 INFO ]: Toolchain (without parser) took 57831.75 ms. Allocated memory was 307.2 MB in the beginning and 628.1 MB in the end (delta: 320.9 MB). Free memory was 263.6 MB in the beginning and 354.6 MB in the end (delta: -91.0 MB). Peak memory consumption was 229.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:59,613 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:00:59,613 INFO ]: ChcToBoogie took 51.45 ms. Allocated memory is still 307.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:59,613 INFO ]: Boogie Preprocessor took 37.35 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 259.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:59,614 INFO ]: RCFGBuilder took 345.69 ms. Allocated memory is still 307.2 MB. Free memory was 259.5 MB in the beginning and 250.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:59,614 INFO ]: TraceAbstraction took 57383.81 ms. Allocated memory was 307.2 MB in the beginning and 628.1 MB in the end (delta: 320.9 MB). Free memory was 250.5 MB in the beginning and 354.6 MB in the end (delta: -104.1 MB). Peak memory consumption was 216.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:00:59,616 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 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.45 ms. Allocated memory is still 307.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.35 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 259.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 345.69 ms. Allocated memory is still 307.2 MB. Free memory was 259.5 MB in the beginning and 250.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57383.81 ms. Allocated memory was 307.2 MB in the beginning and 628.1 MB in the end (delta: 320.9 MB). Free memory was 250.5 MB in the beginning and 354.6 MB in the end (delta: -104.1 MB). Peak memory consumption was 216.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 46 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 57.3s OverallTime, 43 OverallIterations, 12 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 444 SDtfs, 1590 SDslu, 6379 SDs, 0 SdLazy, 9953 SolverSat, 1990 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2570 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 1643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14277 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 307 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 2246 NumberOfCodeBlocks, 2246 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 2165 ConstructedInterpolants, 75 QuantifiedInterpolants, 348089 SizeOfPredicates, 262 NumberOfNonLiveVariables, 12212 ConjunctsInSsa, 2809 ConjunctsInUnsatCore, 81 InterpolantComputations, 4 PerfectInterpolantSequences, 3171/5743 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-00-59-767.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-00-59-767.csv Completed graceful shutdown