java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:15:22,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:15:22,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:15:22,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:15:22,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:15:22,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:15:22,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:15:22,396 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:15:22,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:15:22,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:15:22,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:15:22,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:15:22,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:15:22,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:15:22,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:15:22,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:15:22,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:15:22,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:15:22,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:15:22,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:15:22,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:15:22,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:15:22,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:15:22,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:15:22,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:15:22,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:15:22,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:15:22,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:15:22,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:15:22,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:15:22,434 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:15:22,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:15:22,435 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:15:22,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:15:22,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:15:22,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:15:22,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:15:22,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:15:22,451 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:15:22,451 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:15:22,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:15:22,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:15:22,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:15:22,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:15:22,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:15:22,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:15:22,454 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:15:22,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:15:22,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:15:22,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:15:22,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:15:22,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:15:22,455 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:15:22,456 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:15:22,456 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:15:22,508 INFO ]: Repository-Root is: /tmp [2018-06-22 01:15:22,524 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:15:22,530 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:15:22,532 INFO ]: Initializing SmtParser... [2018-06-22 01:15:22,532 INFO ]: SmtParser initialized [2018-06-22 01:15:22,533 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-22 01:15:22,534 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:15:22,620 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 unknown [2018-06-22 01:15:22,812 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe.c-1.smt2 [2018-06-22 01:15:22,816 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:15:22,824 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:15:22,824 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:15:22,824 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:15:22,824 INFO ]: ChcToBoogie initialized [2018-06-22 01:15:22,828 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,879 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22 Unit [2018-06-22 01:15:22,879 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:15:22,879 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:15:22,880 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:15:22,880 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:15:22,899 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,899 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,904 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,904 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,908 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,910 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,911 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... [2018-06-22 01:15:22,913 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:15:22,913 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:15:22,913 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:15:22,913 INFO ]: RCFGBuilder initialized [2018-06-22 01:15:22,914 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:15:22,927 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:15:22,927 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:15:22,927 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:15:22,927 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:15:22,927 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:15:22,927 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:15:23,256 INFO ]: Using library mode [2018-06-22 01:15:23,257 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:15:23 BoogieIcfgContainer [2018-06-22 01:15:23,257 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:15:23,258 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:15:23,258 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:15:23,261 INFO ]: TraceAbstraction initialized [2018-06-22 01:15:23,261 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:15:22" (1/3) ... [2018-06-22 01:15:23,262 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323b3cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:15:23, skipping insertion in model container [2018-06-22 01:15:23,262 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:22" (2/3) ... [2018-06-22 01:15:23,262 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323b3cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:15:23, skipping insertion in model container [2018-06-22 01:15:23,262 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:15:23" (3/3) ... [2018-06-22 01:15:23,263 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:15:23,272 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:15:23,279 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:15:23,322 INFO ]: Using default assertion order modulation [2018-06-22 01:15:23,323 INFO ]: Interprodecural is true [2018-06-22 01:15:23,323 INFO ]: Hoare is false [2018-06-22 01:15:23,323 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:15:23,323 INFO ]: Backedges is TWOTRACK [2018-06-22 01:15:23,323 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:15:23,323 INFO ]: Difference is false [2018-06-22 01:15:23,323 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:15:23,323 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:15:23,337 INFO ]: Start isEmpty. Operand 14 states. [2018-06-22 01:15:23,348 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:15:23,348 INFO ]: Found error trace [2018-06-22 01:15:23,349 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:23,349 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:23,355 INFO ]: Analyzing trace with hash 46595302, now seen corresponding path program 1 times [2018-06-22 01:15:23,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:23,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:23,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:23,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:23,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:23,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:23,574 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:23,577 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:23,577 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:15:23,578 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:15:23,589 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:15:23,590 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:23,592 INFO ]: Start difference. First operand 14 states. Second operand 5 states. [2018-06-22 01:15:23,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:23,723 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-22 01:15:23,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:15:23,725 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:15:23,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:23,733 INFO ]: With dead ends: 19 [2018-06-22 01:15:23,733 INFO ]: Without dead ends: 19 [2018-06-22 01:15:23,735 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:15:23,753 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:15:23,768 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-22 01:15:23,770 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:15:23,771 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-22 01:15:23,772 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-22 01:15:23,772 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:23,772 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-22 01:15:23,772 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:15:23,772 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-22 01:15:23,773 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:23,773 INFO ]: Found error trace [2018-06-22 01:15:23,773 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:23,773 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:23,773 INFO ]: Analyzing trace with hash -1251009968, now seen corresponding path program 1 times [2018-06-22 01:15:23,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:23,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:23,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:23,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:23,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:23,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:24,004 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:24,004 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:24,004 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:24,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:24,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:24,055 INFO ]: Computing forward predicates... [2018-06-22 01:15:24,237 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:24,259 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:15:24,259 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-22 01:15:24,260 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:15:24,260 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:15:24,260 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:15:24,260 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 9 states. [2018-06-22 01:15:24,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:24,791 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-22 01:15:24,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:15:24,791 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:15:24,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:24,791 INFO ]: With dead ends: 16 [2018-06-22 01:15:24,791 INFO ]: Without dead ends: 13 [2018-06-22 01:15:24,792 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-22 01:15:24,792 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:15:24,794 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:15:24,794 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:15:24,794 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-22 01:15:24,794 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2018-06-22 01:15:24,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:24,795 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-22 01:15:24,795 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:15:24,795 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-22 01:15:24,795 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:24,795 INFO ]: Found error trace [2018-06-22 01:15:24,795 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:24,795 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:24,795 INFO ]: Analyzing trace with hash -570451450, now seen corresponding path program 1 times [2018-06-22 01:15:24,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:24,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:24,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:24,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:24,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:24,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:24,865 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:24,865 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:24,865 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:15:24,866 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:15:24,866 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:15:24,866 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:24,866 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-06-22 01:15:24,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:24,930 INFO ]: Finished difference Result 14 states and 16 transitions. [2018-06-22 01:15:24,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:15:24,930 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-22 01:15:24,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:24,931 INFO ]: With dead ends: 14 [2018-06-22 01:15:24,931 INFO ]: Without dead ends: 14 [2018-06-22 01:15:24,932 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-22 01:15:24,932 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:15:24,933 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:15:24,933 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:15:24,934 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 01:15:24,934 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-22 01:15:24,934 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:24,934 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 01:15:24,934 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:15:24,934 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 01:15:24,934 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:15:24,934 INFO ]: Found error trace [2018-06-22 01:15:24,935 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:24,935 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:24,935 INFO ]: Analyzing trace with hash -450596954, now seen corresponding path program 1 times [2018-06-22 01:15:24,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:24,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:24,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:24,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:24,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:24,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:25,044 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:25,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:25,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:25,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:25,091 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:25,093 INFO ]: Computing forward predicates... [2018-06-22 01:15:25,199 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:25,238 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:15:25,238 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-22 01:15:25,238 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:15:25,238 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:15:25,238 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:15:25,238 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-06-22 01:15:25,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:25,565 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-22 01:15:25,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:15:25,565 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:15:25,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:25,566 INFO ]: With dead ends: 17 [2018-06-22 01:15:25,566 INFO ]: Without dead ends: 15 [2018-06-22 01:15:25,566 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:25,566 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:15:25,568 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:15:25,568 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:15:25,568 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:15:25,568 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-22 01:15:25,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:25,568 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:15:25,568 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:15:25,568 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:15:25,569 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:15:25,569 INFO ]: Found error trace [2018-06-22 01:15:25,569 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:25,569 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:25,569 INFO ]: Analyzing trace with hash -349516356, now seen corresponding path program 1 times [2018-06-22 01:15:25,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:25,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:25,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:25,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:25,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:25,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:25,695 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:25,696 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:25,696 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:25,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:25,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:25,740 INFO ]: Computing forward predicates... [2018-06-22 01:15:25,888 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:25,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:25,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-22 01:15:25,908 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:25,908 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:25,909 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:25,909 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-06-22 01:15:26,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:26,148 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-22 01:15:26,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:15:26,149 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 01:15:26,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:26,149 INFO ]: With dead ends: 24 [2018-06-22 01:15:26,149 INFO ]: Without dead ends: 24 [2018-06-22 01:15:26,150 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:26,150 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:15:26,151 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-22 01:15:26,151 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:15:26,152 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-22 01:15:26,152 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-22 01:15:26,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:26,152 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-22 01:15:26,152 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:26,152 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-22 01:15:26,152 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:15:26,152 INFO ]: Found error trace [2018-06-22 01:15:26,152 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:26,153 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:26,153 INFO ]: Analyzing trace with hash -1510985114, now seen corresponding path program 2 times [2018-06-22 01:15:26,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:26,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:26,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:26,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:26,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:26,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:26,320 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:26,320 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:26,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:26,348 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:26,387 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:26,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:26,389 INFO ]: Computing forward predicates... [2018-06-22 01:15:26,607 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:26,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:26,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 01:15:26,627 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:26,627 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:26,627 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:26,627 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 12 states. [2018-06-22 01:15:26,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:26,852 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-22 01:15:26,852 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:26,852 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-22 01:15:26,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:26,853 INFO ]: With dead ends: 28 [2018-06-22 01:15:26,853 INFO ]: Without dead ends: 23 [2018-06-22 01:15:26,853 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:26,854 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:15:26,855 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-22 01:15:26,855 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:15:26,856 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-22 01:15:26,856 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-06-22 01:15:26,856 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:26,856 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-22 01:15:26,856 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:26,856 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-22 01:15:26,856 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:15:26,856 INFO ]: Found error trace [2018-06-22 01:15:26,856 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:26,857 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:26,857 INFO ]: Analyzing trace with hash -329278308, now seen corresponding path program 3 times [2018-06-22 01:15:26,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:26,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:26,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:26,858 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:26,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:26,867 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:27,086 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:27,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:27,086 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-22 01:15:27,099 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:27,119 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:15:27,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:27,121 INFO ]: Computing forward predicates... [2018-06-22 01:15:27,164 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:27,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:27,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:15:27,194 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:15:27,195 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:15:27,195 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:15:27,195 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 11 states. [2018-06-22 01:15:27,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:27,349 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-22 01:15:27,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:15:27,350 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:15:27,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:27,350 INFO ]: With dead ends: 21 [2018-06-22 01:15:27,350 INFO ]: Without dead ends: 18 [2018-06-22 01:15:27,351 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:15:27,351 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:15:27,352 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:15:27,352 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:15:27,353 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-22 01:15:27,353 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-22 01:15:27,353 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:27,353 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-22 01:15:27,353 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:15:27,353 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-22 01:15:27,353 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:15:27,353 INFO ]: Found error trace [2018-06-22 01:15:27,353 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:27,354 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:27,354 INFO ]: Analyzing trace with hash -1568441818, now seen corresponding path program 4 times [2018-06-22 01:15:27,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:27,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:27,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:27,354 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:27,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:27,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:27,462 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:27,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:27,462 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:27,476 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:27,503 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:27,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:27,505 INFO ]: Computing forward predicates... [2018-06-22 01:15:27,687 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:27,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:27,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-22 01:15:27,707 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:15:27,707 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:15:27,707 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:27,707 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-22 01:15:28,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:28,043 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-22 01:15:28,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:15:28,044 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-22 01:15:28,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:28,044 INFO ]: With dead ends: 29 [2018-06-22 01:15:28,044 INFO ]: Without dead ends: 29 [2018-06-22 01:15:28,045 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:15:28,045 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:15:28,047 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-22 01:15:28,047 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:15:28,047 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 01:15:28,047 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-06-22 01:15:28,048 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:28,048 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 01:15:28,048 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:15:28,048 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 01:15:28,048 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:15:28,048 INFO ]: Found error trace [2018-06-22 01:15:28,048 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:28,048 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:28,048 INFO ]: Analyzing trace with hash -1701049712, now seen corresponding path program 5 times [2018-06-22 01:15:28,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:28,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:28,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:28,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:28,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:28,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:28,448 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:28,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:28,448 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:28,455 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:28,477 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:15:28,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:28,479 INFO ]: Computing forward predicates... [2018-06-22 01:15:28,691 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:28,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:28,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 01:15:28,720 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:15:28,720 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:15:28,721 INFO ]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:28,721 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2018-06-22 01:15:29,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:29,250 INFO ]: Finished difference Result 34 states and 40 transitions. [2018-06-22 01:15:29,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:15:29,253 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-22 01:15:29,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:29,253 INFO ]: With dead ends: 34 [2018-06-22 01:15:29,253 INFO ]: Without dead ends: 27 [2018-06-22 01:15:29,254 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:15:29,254 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:15:29,256 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 01:15:29,256 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:29,256 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-22 01:15:29,256 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2018-06-22 01:15:29,257 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:29,257 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-22 01:15:29,257 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:15:29,257 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-22 01:15:29,257 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:15:29,257 INFO ]: Found error trace [2018-06-22 01:15:29,257 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:29,257 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:29,257 INFO ]: Analyzing trace with hash 47824710, now seen corresponding path program 6 times [2018-06-22 01:15:29,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:29,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:29,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:29,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:29,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:29,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:29,343 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:29,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:29,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:29,351 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:29,372 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:15:29,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:29,374 INFO ]: Computing forward predicates... [2018-06-22 01:15:29,434 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:29,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:29,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-22 01:15:29,453 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:15:29,454 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:15:29,454 INFO ]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:15:29,454 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 14 states. [2018-06-22 01:15:29,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:29,681 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-22 01:15:29,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:15:29,682 INFO ]: Start accepts. Automaton has 14 states. Word has length 18 [2018-06-22 01:15:29,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:29,682 INFO ]: With dead ends: 25 [2018-06-22 01:15:29,682 INFO ]: Without dead ends: 21 [2018-06-22 01:15:29,682 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:15:29,683 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:15:29,684 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:15:29,684 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:29,684 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-22 01:15:29,684 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-22 01:15:29,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:29,684 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-22 01:15:29,684 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:15:29,685 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-22 01:15:29,685 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:15:29,685 INFO ]: Found error trace [2018-06-22 01:15:29,685 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:29,685 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:29,685 INFO ]: Analyzing trace with hash 1609534844, now seen corresponding path program 7 times [2018-06-22 01:15:29,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:29,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:29,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:29,686 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:29,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:29,704 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:29,870 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:29,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:29,870 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:29,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:29,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:29,902 INFO ]: Computing forward predicates... [2018-06-22 01:15:30,298 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:30,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:30,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 01:15:30,318 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:15:30,318 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:15:30,318 INFO ]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:30,318 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2018-06-22 01:15:30,698 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:30,698 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-22 01:15:30,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:15:30,699 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-22 01:15:30,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:30,700 INFO ]: With dead ends: 34 [2018-06-22 01:15:30,700 INFO ]: Without dead ends: 34 [2018-06-22 01:15:30,700 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:30,700 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:15:30,702 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-22 01:15:30,702 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:15:30,703 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-22 01:15:30,703 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-22 01:15:30,703 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:30,703 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-22 01:15:30,703 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:15:30,703 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-22 01:15:30,703 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:15:30,703 INFO ]: Found error trace [2018-06-22 01:15:30,703 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:30,704 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:30,704 INFO ]: Analyzing trace with hash -408791770, now seen corresponding path program 8 times [2018-06-22 01:15:30,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:30,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:30,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:30,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:30,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:30,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:30,833 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:30,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:30,833 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:30,841 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:30,888 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:30,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:30,891 INFO ]: Computing forward predicates... [2018-06-22 01:15:31,082 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:31,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:31,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 01:15:31,102 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:15:31,102 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:15:31,102 INFO ]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:31,103 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2018-06-22 01:15:31,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:31,527 INFO ]: Finished difference Result 40 states and 46 transitions. [2018-06-22 01:15:31,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:15:31,528 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-22 01:15:31,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:31,528 INFO ]: With dead ends: 40 [2018-06-22 01:15:31,528 INFO ]: Without dead ends: 31 [2018-06-22 01:15:31,529 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:15:31,529 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:15:31,530 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-06-22 01:15:31,531 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:15:31,533 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-06-22 01:15:31,533 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2018-06-22 01:15:31,533 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:31,533 INFO ]: Abstraction has 24 states and 27 transitions. [2018-06-22 01:15:31,533 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:15:31,533 INFO ]: Start isEmpty. Operand 24 states and 27 transitions. [2018-06-22 01:15:31,534 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:15:31,534 INFO ]: Found error trace [2018-06-22 01:15:31,534 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:31,534 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:31,534 INFO ]: Analyzing trace with hash 927315036, now seen corresponding path program 9 times [2018-06-22 01:15:31,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:31,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:31,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:31,534 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:31,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:31,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:31,821 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:31,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:31,822 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) [2018-06-22 01:15:31,838 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:31,864 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:15:31,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:31,865 INFO ]: Computing forward predicates... [2018-06-22 01:15:31,928 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:31,947 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:31,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-22 01:15:31,947 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:15:31,948 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:15:31,948 INFO ]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:15:31,948 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 17 states. [2018-06-22 01:15:32,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:32,173 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-22 01:15:32,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:15:32,173 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 01:15:32,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:32,174 INFO ]: With dead ends: 29 [2018-06-22 01:15:32,174 INFO ]: Without dead ends: 24 [2018-06-22 01:15:32,174 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:15:32,174 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:15:32,176 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:15:32,176 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:15:32,176 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-22 01:15:32,176 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-22 01:15:32,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:32,176 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-22 01:15:32,177 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:15:32,177 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-22 01:15:32,177 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:15:32,177 INFO ]: Found error trace [2018-06-22 01:15:32,177 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:32,177 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:32,177 INFO ]: Analyzing trace with hash 1782646630, now seen corresponding path program 10 times [2018-06-22 01:15:32,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:32,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:32,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:32,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:32,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:32,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:32,439 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:32,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:32,440 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:32,445 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:32,471 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:32,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:32,474 INFO ]: Computing forward predicates... [2018-06-22 01:15:32,911 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:32,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:32,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-06-22 01:15:32,930 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:15:32,930 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:15:32,930 INFO ]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:15:32,930 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 24 states. [2018-06-22 01:15:33,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:33,418 INFO ]: Finished difference Result 39 states and 44 transitions. [2018-06-22 01:15:33,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:33,419 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-22 01:15:33,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:33,419 INFO ]: With dead ends: 39 [2018-06-22 01:15:33,419 INFO ]: Without dead ends: 39 [2018-06-22 01:15:33,420 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:15:33,420 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:15:33,422 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-22 01:15:33,422 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:15:33,422 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 01:15:33,422 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2018-06-22 01:15:33,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:33,423 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 01:15:33,423 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:15:33,423 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 01:15:33,424 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:15:33,424 INFO ]: Found error trace [2018-06-22 01:15:33,424 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:33,424 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:33,424 INFO ]: Analyzing trace with hash 1754172112, now seen corresponding path program 11 times [2018-06-22 01:15:33,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:33,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:33,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:33,424 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:33,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:33,437 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:33,618 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:33,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:33,618 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:33,625 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:33,651 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:15:33,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:33,654 INFO ]: Computing forward predicates... [2018-06-22 01:15:33,801 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:33,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:33,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-06-22 01:15:33,820 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:15:33,820 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:15:33,820 INFO ]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:15:33,821 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 24 states. [2018-06-22 01:15:34,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:34,247 INFO ]: Finished difference Result 46 states and 52 transitions. [2018-06-22 01:15:34,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:15:34,248 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-22 01:15:34,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:34,248 INFO ]: With dead ends: 46 [2018-06-22 01:15:34,249 INFO ]: Without dead ends: 35 [2018-06-22 01:15:34,249 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1301, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:15:34,249 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:15:34,251 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 01:15:34,251 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:15:34,252 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-06-22 01:15:34,252 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2018-06-22 01:15:34,252 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:34,252 INFO ]: Abstraction has 27 states and 30 transitions. [2018-06-22 01:15:34,252 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:15:34,252 INFO ]: Start isEmpty. Operand 27 states and 30 transitions. [2018-06-22 01:15:34,252 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:15:34,252 INFO ]: Found error trace [2018-06-22 01:15:34,252 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:34,252 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:34,253 INFO ]: Analyzing trace with hash 1557591174, now seen corresponding path program 12 times [2018-06-22 01:15:34,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:34,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:34,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:34,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:34,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:34,265 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:35,175 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:35,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:35,175 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:35,181 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:35,217 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:15:35,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:35,219 INFO ]: Computing forward predicates... [2018-06-22 01:15:35,367 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:35,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:35,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 01:15:35,386 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:15:35,386 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:15:35,386 INFO ]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:15:35,386 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 19 states. [2018-06-22 01:15:35,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:35,502 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 01:15:35,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:35,502 INFO ]: Start accepts. Automaton has 19 states. Word has length 24 [2018-06-22 01:15:35,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:35,503 INFO ]: With dead ends: 32 [2018-06-22 01:15:35,503 INFO ]: Without dead ends: 32 [2018-06-22 01:15:35,503 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:15:35,503 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:15:35,505 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 01:15:35,505 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:15:35,505 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-22 01:15:35,505 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2018-06-22 01:15:35,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:35,506 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-22 01:15:35,506 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:15:35,506 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-22 01:15:35,506 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:15:35,506 INFO ]: Found error trace [2018-06-22 01:15:35,506 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:35,506 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:35,506 INFO ]: Analyzing trace with hash 1094214950, now seen corresponding path program 13 times [2018-06-22 01:15:35,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:35,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:35,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:35,507 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:35,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:35,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:36,314 INFO ]: Checked inductivity of 40 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:36,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:36,314 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:36,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:36,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:36,348 INFO ]: Computing forward predicates... [2018-06-22 01:15:36,517 INFO ]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:36,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:36,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 01:15:36,542 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:15:36,543 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:15:36,543 INFO ]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:15:36,543 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2018-06-22 01:15:36,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:36,664 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-22 01:15:36,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:15:36,664 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-22 01:15:36,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:36,664 INFO ]: With dead ends: 33 [2018-06-22 01:15:36,664 INFO ]: Without dead ends: 27 [2018-06-22 01:15:36,665 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:15:36,665 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:15:36,666 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:15:36,666 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:15:36,667 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 01:15:36,667 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2018-06-22 01:15:36,667 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:36,667 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 01:15:36,667 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:15:36,667 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 01:15:36,667 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:15:36,667 INFO ]: Found error trace [2018-06-22 01:15:36,667 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:36,668 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:36,668 INFO ]: Analyzing trace with hash 1363328316, now seen corresponding path program 14 times [2018-06-22 01:15:36,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:36,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:36,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:36,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:36,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:36,687 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:37,278 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:37,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:37,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:37,284 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:37,337 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:37,337 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:37,343 INFO ]: Computing forward predicates... [2018-06-22 01:15:38,234 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:38,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:38,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-06-22 01:15:38,254 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:15:38,254 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:15:38,254 INFO ]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:38,254 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 28 states. [2018-06-22 01:15:38,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:38,830 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-22 01:15:38,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:15:38,831 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-22 01:15:38,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:38,831 INFO ]: With dead ends: 44 [2018-06-22 01:15:38,831 INFO ]: Without dead ends: 44 [2018-06-22 01:15:38,832 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:15:38,832 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:15:38,834 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-06-22 01:15:38,834 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:15:38,835 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-22 01:15:38,836 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-22 01:15:38,836 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:38,836 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-22 01:15:38,836 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:15:38,836 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-22 01:15:38,836 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:15:38,836 INFO ]: Found error trace [2018-06-22 01:15:38,837 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:38,837 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:38,837 INFO ]: Analyzing trace with hash 1115908070, now seen corresponding path program 15 times [2018-06-22 01:15:38,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:38,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:38,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:38,838 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:38,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:38,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:39,164 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:39,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:39,165 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:39,172 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:39,205 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:15:39,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:39,208 INFO ]: Computing forward predicates... [2018-06-22 01:15:39,369 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:39,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:39,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:15:39,389 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:15:39,389 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:15:39,389 INFO ]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:15:39,390 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 26 states. [2018-06-22 01:15:39,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:39,571 INFO ]: Finished difference Result 45 states and 50 transitions. [2018-06-22 01:15:39,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:15:39,573 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-22 01:15:39,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:39,574 INFO ]: With dead ends: 45 [2018-06-22 01:15:39,574 INFO ]: Without dead ends: 45 [2018-06-22 01:15:39,574 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=392, Invalid=940, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:15:39,574 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:15:39,577 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-06-22 01:15:39,577 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:15:39,578 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 01:15:39,578 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2018-06-22 01:15:39,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:39,578 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 01:15:39,578 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:15:39,578 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 01:15:39,578 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:15:39,578 INFO ]: Found error trace [2018-06-22 01:15:39,578 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:39,579 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:39,579 INFO ]: Analyzing trace with hash 1180187676, now seen corresponding path program 16 times [2018-06-22 01:15:39,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:39,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:39,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:39,580 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:39,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:39,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:39,855 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:39,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:39,855 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:39,861 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:39,893 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:39,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:39,897 INFO ]: Computing forward predicates... [2018-06-22 01:15:40,008 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:15:40,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:40,036 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-22 01:15:40,036 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:15:40,036 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:15:40,036 INFO ]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:15:40,036 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 23 states. [2018-06-22 01:15:40,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:40,696 INFO ]: Finished difference Result 54 states and 60 transitions. [2018-06-22 01:15:40,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:15:40,696 INFO ]: Start accepts. Automaton has 23 states. Word has length 27 [2018-06-22 01:15:40,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:40,697 INFO ]: With dead ends: 54 [2018-06-22 01:15:40,697 INFO ]: Without dead ends: 47 [2018-06-22 01:15:40,697 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=470, Invalid=1336, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:15:40,697 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:15:40,699 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-06-22 01:15:40,700 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:15:40,700 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-22 01:15:40,700 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-22 01:15:40,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:40,700 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-22 01:15:40,700 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:15:40,700 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-22 01:15:40,701 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:15:40,701 INFO ]: Found error trace [2018-06-22 01:15:40,701 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:40,701 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:40,701 INFO ]: Analyzing trace with hash 286940614, now seen corresponding path program 17 times [2018-06-22 01:15:40,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:40,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:40,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:40,702 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:40,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:40,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:40,897 INFO ]: Checked inductivity of 57 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:40,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:40,897 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:40,903 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:40,937 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:15:40,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:40,940 INFO ]: Computing forward predicates... [2018-06-22 01:15:41,101 INFO ]: Checked inductivity of 57 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:41,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:41,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-22 01:15:41,121 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:15:41,121 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:15:41,121 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:15:41,121 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 25 states. [2018-06-22 01:15:41,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:41,270 INFO ]: Finished difference Result 44 states and 48 transitions. [2018-06-22 01:15:41,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:15:41,270 INFO ]: Start accepts. Automaton has 25 states. Word has length 28 [2018-06-22 01:15:41,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:41,270 INFO ]: With dead ends: 44 [2018-06-22 01:15:41,270 INFO ]: Without dead ends: 30 [2018-06-22 01:15:41,270 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:15:41,271 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:15:41,272 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:15:41,272 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:15:41,272 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-22 01:15:41,272 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2018-06-22 01:15:41,273 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:41,273 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-22 01:15:41,273 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:15:41,273 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-22 01:15:41,275 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:15:41,275 INFO ]: Found error trace [2018-06-22 01:15:41,275 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:41,275 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:41,275 INFO ]: Analyzing trace with hash 382444710, now seen corresponding path program 18 times [2018-06-22 01:15:41,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:41,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:41,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:41,276 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:41,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:41,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:41,520 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:41,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:41,521 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:41,528 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:41,569 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:15:41,569 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:41,573 INFO ]: Computing forward predicates... [2018-06-22 01:15:42,835 INFO ]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:42,854 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:42,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 39 [2018-06-22 01:15:42,855 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:15:42,855 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:15:42,855 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1400, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:15:42,855 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 39 states. [2018-06-22 01:15:44,824 WARN ]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-06-22 01:15:44,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:44,941 INFO ]: Finished difference Result 57 states and 63 transitions. [2018-06-22 01:15:44,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:15:44,942 INFO ]: Start accepts. Automaton has 39 states. Word has length 29 [2018-06-22 01:15:44,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:44,942 INFO ]: With dead ends: 57 [2018-06-22 01:15:44,942 INFO ]: Without dead ends: 49 [2018-06-22 01:15:44,944 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=377, Invalid=3529, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:15:44,944 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:15:44,946 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-06-22 01:15:44,946 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:15:44,947 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 01:15:44,947 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-22 01:15:44,947 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:44,947 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 01:15:44,947 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:15:44,947 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 01:15:44,947 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:15:44,947 INFO ]: Found error trace [2018-06-22 01:15:44,947 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:44,947 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:44,948 INFO ]: Analyzing trace with hash 1699912464, now seen corresponding path program 19 times [2018-06-22 01:15:44,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:44,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:44,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:44,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:44,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:44,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:45,759 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:45,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:45,759 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:45,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:45,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:45,811 INFO ]: Computing forward predicates... [2018-06-22 01:15:46,023 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:46,053 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:46,053 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-06-22 01:15:46,053 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:15:46,053 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:15:46,054 INFO ]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:15:46,054 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 32 states. [2018-06-22 01:15:46,688 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:15:46,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:46,756 INFO ]: Finished difference Result 58 states and 64 transitions. [2018-06-22 01:15:46,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:15:46,757 INFO ]: Start accepts. Automaton has 32 states. Word has length 30 [2018-06-22 01:15:46,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:46,757 INFO ]: With dead ends: 58 [2018-06-22 01:15:46,757 INFO ]: Without dead ends: 43 [2018-06-22 01:15:46,758 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=586, Invalid=2384, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:15:46,758 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:15:46,760 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-22 01:15:46,760 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:15:46,761 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-22 01:15:46,761 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-06-22 01:15:46,765 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:46,765 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-22 01:15:46,765 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:15:46,765 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-22 01:15:46,765 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:15:46,765 INFO ]: Found error trace [2018-06-22 01:15:46,765 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:46,766 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:46,766 INFO ]: Analyzing trace with hash -951895610, now seen corresponding path program 20 times [2018-06-22 01:15:46,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:46,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:46,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:46,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:46,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:46,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:47,424 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:47,424 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:47,424 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:47,430 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:47,468 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:47,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:47,472 INFO ]: Computing forward predicates... [2018-06-22 01:15:47,630 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:47,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:47,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-22 01:15:47,663 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:15:47,663 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:15:47,663 INFO ]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:15:47,663 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 26 states. [2018-06-22 01:15:48,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:48,171 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-22 01:15:48,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:15:48,171 INFO ]: Start accepts. Automaton has 26 states. Word has length 30 [2018-06-22 01:15:48,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:48,171 INFO ]: With dead ends: 41 [2018-06-22 01:15:48,171 INFO ]: Without dead ends: 33 [2018-06-22 01:15:48,172 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:15:48,172 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:15:48,174 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:15:48,174 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:15:48,174 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 01:15:48,174 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-06-22 01:15:48,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:48,174 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 01:15:48,174 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:15:48,174 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 01:15:48,175 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:15:48,175 INFO ]: Found error trace [2018-06-22 01:15:48,175 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:48,175 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:48,175 INFO ]: Analyzing trace with hash -1189585668, now seen corresponding path program 21 times [2018-06-22 01:15:48,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:48,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:48,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:48,176 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:48,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:48,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:48,552 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:15:48,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:48,552 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:48,561 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:48,600 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:15:48,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:48,604 INFO ]: Computing forward predicates... [2018-06-22 01:15:49,872 INFO ]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:49,891 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:49,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 44 [2018-06-22 01:15:49,891 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:15:49,891 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:15:49,891 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1799, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:15:49,892 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 44 states. [2018-06-22 01:15:51,274 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-06-22 01:15:51,995 WARN ]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-06-22 01:15:52,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:52,619 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-22 01:15:52,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:15:52,620 INFO ]: Start accepts. Automaton has 44 states. Word has length 32 [2018-06-22 01:15:52,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:52,620 INFO ]: With dead ends: 63 [2018-06-22 01:15:52,620 INFO ]: Without dead ends: 54 [2018-06-22 01:15:52,621 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=514, Invalid=4456, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:15:52,621 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:15:52,623 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-06-22 01:15:52,623 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:15:52,624 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-06-22 01:15:52,624 INFO ]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-06-22 01:15:52,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:52,624 INFO ]: Abstraction has 35 states and 38 transitions. [2018-06-22 01:15:52,624 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:15:52,624 INFO ]: Start isEmpty. Operand 35 states and 38 transitions. [2018-06-22 01:15:52,624 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:15:52,624 INFO ]: Found error trace [2018-06-22 01:15:52,624 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:52,624 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:52,624 INFO ]: Analyzing trace with hash -1127781722, now seen corresponding path program 22 times [2018-06-22 01:15:52,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:52,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:52,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:52,630 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:52,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:52,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:52,881 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:15:52,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:52,881 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:52,887 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:52,925 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:52,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:52,928 INFO ]: Computing forward predicates... [2018-06-22 01:15:53,202 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:15:53,221 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:53,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-06-22 01:15:53,221 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:15:53,221 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:15:53,221 INFO ]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:15:53,221 INFO ]: Start difference. First operand 35 states and 38 transitions. Second operand 36 states. [2018-06-22 01:15:53,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:53,842 INFO ]: Finished difference Result 64 states and 70 transitions. [2018-06-22 01:15:53,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:15:53,844 INFO ]: Start accepts. Automaton has 36 states. Word has length 33 [2018-06-22 01:15:53,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:53,844 INFO ]: With dead ends: 64 [2018-06-22 01:15:53,844 INFO ]: Without dead ends: 47 [2018-06-22 01:15:53,845 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:15:53,845 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:15:53,847 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-06-22 01:15:53,847 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:15:53,847 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 01:15:53,847 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 33 [2018-06-22 01:15:53,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:53,848 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 01:15:53,848 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:15:53,848 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 01:15:53,848 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:15:53,848 INFO ]: Found error trace [2018-06-22 01:15:53,848 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:53,848 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:53,848 INFO ]: Analyzing trace with hash 1695232988, now seen corresponding path program 23 times [2018-06-22 01:15:53,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:53,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:53,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:53,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:53,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:54,384 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:15:54,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:54,385 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:54,391 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:54,430 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:15:54,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:54,433 INFO ]: Computing forward predicates... [2018-06-22 01:15:54,634 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:15:54,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:54,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-06-22 01:15:54,654 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:15:54,654 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:15:54,654 INFO ]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:15:54,654 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 29 states. [2018-06-22 01:15:55,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:55,105 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-22 01:15:55,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:15:55,105 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-22 01:15:55,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:55,105 INFO ]: With dead ends: 45 [2018-06-22 01:15:55,105 INFO ]: Without dead ends: 36 [2018-06-22 01:15:55,106 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2222, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:15:55,106 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:15:55,107 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:15:55,107 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:15:55,107 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-22 01:15:55,108 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-22 01:15:55,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:55,108 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-22 01:15:55,108 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:15:55,108 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-22 01:15:55,108 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:15:55,108 INFO ]: Found error trace [2018-06-22 01:15:55,108 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:55,108 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:55,108 INFO ]: Analyzing trace with hash 1508856294, now seen corresponding path program 24 times [2018-06-22 01:15:55,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:55,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:55,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:55,110 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:55,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:55,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:55,973 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:15:55,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:55,973 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:55,980 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:56,091 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:15:56,091 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:56,098 INFO ]: Computing forward predicates... [2018-06-22 01:15:57,628 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:57,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:57,648 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30] total 49 [2018-06-22 01:15:57,648 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:15:57,648 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:15:57,649 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2248, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:15:57,649 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 49 states. [2018-06-22 01:15:59,790 WARN ]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-06-22 01:16:00,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:00,860 INFO ]: Finished difference Result 69 states and 75 transitions. [2018-06-22 01:16:00,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:16:00,861 INFO ]: Start accepts. Automaton has 49 states. Word has length 35 [2018-06-22 01:16:00,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:00,861 INFO ]: With dead ends: 69 [2018-06-22 01:16:00,861 INFO ]: Without dead ends: 59 [2018-06-22 01:16:00,862 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=559, Invalid=5603, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 01:16:00,862 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:16:00,863 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 38. [2018-06-22 01:16:00,863 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:16:00,864 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 01:16:00,864 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-22 01:16:00,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:00,864 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 01:16:00,864 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:16:00,864 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 01:16:00,864 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:16:00,864 INFO ]: Found error trace [2018-06-22 01:16:00,864 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:00,864 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:00,865 INFO ]: Analyzing trace with hash -1946928304, now seen corresponding path program 25 times [2018-06-22 01:16:00,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:00,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:00,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:00,866 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:00,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:00,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:01,162 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:01,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:01,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:01,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:01,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:01,210 INFO ]: Computing forward predicates... [2018-06-22 01:16:01,551 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:01,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:01,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2018-06-22 01:16:01,571 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:16:01,571 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:16:01,571 INFO ]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:16:01,571 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 40 states. [2018-06-22 01:16:02,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:02,201 INFO ]: Finished difference Result 70 states and 76 transitions. [2018-06-22 01:16:02,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:16:02,202 INFO ]: Start accepts. Automaton has 40 states. Word has length 36 [2018-06-22 01:16:02,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:02,202 INFO ]: With dead ends: 70 [2018-06-22 01:16:02,202 INFO ]: Without dead ends: 51 [2018-06-22 01:16:02,203 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=901, Invalid=3791, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:16:02,203 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:16:02,204 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-06-22 01:16:02,204 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:16:02,204 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-06-22 01:16:02,204 INFO ]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2018-06-22 01:16:02,204 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:02,204 INFO ]: Abstraction has 39 states and 42 transitions. [2018-06-22 01:16:02,204 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:16:02,204 INFO ]: Start isEmpty. Operand 39 states and 42 transitions. [2018-06-22 01:16:02,204 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:16:02,204 INFO ]: Found error trace [2018-06-22 01:16:02,205 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:02,205 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:02,205 INFO ]: Analyzing trace with hash 845844230, now seen corresponding path program 26 times [2018-06-22 01:16:02,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:02,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:02,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:02,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:02,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:02,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:02,438 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:02,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:02,438 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:02,443 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:02,493 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:02,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:02,497 INFO ]: Computing forward predicates... [2018-06-22 01:16:02,685 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:16:02,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:02,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-06-22 01:16:02,704 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:16:02,704 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:16:02,704 INFO ]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:16:02,704 INFO ]: Start difference. First operand 39 states and 42 transitions. Second operand 32 states. [2018-06-22 01:16:03,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:03,199 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-22 01:16:03,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:16:03,199 INFO ]: Start accepts. Automaton has 32 states. Word has length 36 [2018-06-22 01:16:03,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:03,199 INFO ]: With dead ends: 49 [2018-06-22 01:16:03,199 INFO ]: Without dead ends: 39 [2018-06-22 01:16:03,200 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=911, Invalid=2749, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:16:03,200 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:16:03,201 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:16:03,201 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:16:03,202 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-22 01:16:03,202 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-06-22 01:16:03,202 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:03,202 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-22 01:16:03,202 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:16:03,202 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-22 01:16:03,202 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:16:03,202 INFO ]: Found error trace [2018-06-22 01:16:03,202 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:03,202 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:03,202 INFO ]: Analyzing trace with hash -1671140164, now seen corresponding path program 27 times [2018-06-22 01:16:03,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:03,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:03,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:03,203 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:03,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:03,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:03,579 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:03,579 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:03,579 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:03,584 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:03,634 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:16:03,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:03,639 INFO ]: Computing forward predicates... [2018-06-22 01:16:04,357 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:04,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:04,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-06-22 01:16:04,378 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:04,378 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:04,378 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1797, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:04,378 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 44 states. [2018-06-22 01:16:05,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:05,449 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-22 01:16:05,452 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:16:05,452 INFO ]: Start accepts. Automaton has 44 states. Word has length 38 [2018-06-22 01:16:05,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:05,452 INFO ]: With dead ends: 64 [2018-06-22 01:16:05,452 INFO ]: Without dead ends: 64 [2018-06-22 01:16:05,453 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=3807, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:16:05,453 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:16:05,455 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-22 01:16:05,455 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:16:05,455 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-22 01:16:05,455 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-22 01:16:05,455 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:05,455 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-22 01:16:05,455 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:05,455 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-22 01:16:05,456 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:16:05,456 INFO ]: Found error trace [2018-06-22 01:16:05,456 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:05,456 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:05,456 INFO ]: Analyzing trace with hash -408789658, now seen corresponding path program 28 times [2018-06-22 01:16:05,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:05,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:05,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:05,456 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:05,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:05,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:05,876 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:05,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:05,876 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:05,881 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:05,924 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:05,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:05,928 INFO ]: Computing forward predicates... [2018-06-22 01:16:06,526 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:06,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:06,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2018-06-22 01:16:06,546 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:06,546 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:06,546 INFO ]: CoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:06,546 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 44 states. [2018-06-22 01:16:07,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:07,497 INFO ]: Finished difference Result 76 states and 82 transitions. [2018-06-22 01:16:07,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 01:16:07,497 INFO ]: Start accepts. Automaton has 44 states. Word has length 39 [2018-06-22 01:16:07,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:07,497 INFO ]: With dead ends: 76 [2018-06-22 01:16:07,497 INFO ]: Without dead ends: 55 [2018-06-22 01:16:07,498 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1084, Invalid=4616, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 01:16:07,498 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:16:07,500 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-06-22 01:16:07,500 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:16:07,500 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 01:16:07,500 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2018-06-22 01:16:07,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:07,500 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 01:16:07,500 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:07,500 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 01:16:07,500 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:16:07,500 INFO ]: Found error trace [2018-06-22 01:16:07,500 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:07,500 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:07,501 INFO ]: Analyzing trace with hash -908944484, now seen corresponding path program 29 times [2018-06-22 01:16:07,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:07,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:07,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:07,501 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:07,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:07,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:08,141 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:08,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:08,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:08,147 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:08,195 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:16:08,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:08,199 INFO ]: Computing forward predicates... [2018-06-22 01:16:08,345 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:16:08,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:08,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-22 01:16:08,365 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:16:08,365 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:16:08,365 INFO ]: CoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:16:08,365 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 34 states. [2018-06-22 01:16:08,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:08,531 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 01:16:08,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:16:08,533 INFO ]: Start accepts. Automaton has 34 states. Word has length 39 [2018-06-22 01:16:08,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:08,533 INFO ]: With dead ends: 52 [2018-06-22 01:16:08,533 INFO ]: Without dead ends: 52 [2018-06-22 01:16:08,534 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=575, Invalid=1405, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:16:08,534 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:16:08,535 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-06-22 01:16:08,535 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:16:08,535 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-22 01:16:08,535 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2018-06-22 01:16:08,535 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:08,535 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-22 01:16:08,535 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:16:08,535 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-22 01:16:08,536 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:16:08,536 INFO ]: Found error trace [2018-06-22 01:16:08,536 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:08,536 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:08,536 INFO ]: Analyzing trace with hash 1941020880, now seen corresponding path program 30 times [2018-06-22 01:16:08,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:08,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:08,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:08,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:08,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:08,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:08,845 INFO ]: Checked inductivity of 155 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:08,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:08,845 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:08,851 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:16:08,899 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:16:08,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:08,903 INFO ]: Computing forward predicates... [2018-06-22 01:16:09,258 INFO ]: Checked inductivity of 155 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:09,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:09,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-06-22 01:16:09,277 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:16:09,277 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:16:09,277 INFO ]: CoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:16:09,277 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 44 states. [2018-06-22 01:16:09,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:09,538 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-22 01:16:09,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:16:09,538 INFO ]: Start accepts. Automaton has 44 states. Word has length 40 [2018-06-22 01:16:09,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:09,539 INFO ]: With dead ends: 53 [2018-06-22 01:16:09,539 INFO ]: Without dead ends: 42 [2018-06-22 01:16:09,539 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=655, Invalid=2425, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:16:09,539 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:16:09,540 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:16:09,540 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:16:09,540 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-22 01:16:09,540 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2018-06-22 01:16:09,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:09,540 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-22 01:16:09,540 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:16:09,540 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-22 01:16:09,540 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:16:09,540 INFO ]: Found error trace [2018-06-22 01:16:09,540 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:09,540 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:09,540 INFO ]: Analyzing trace with hash -1703407834, now seen corresponding path program 31 times [2018-06-22 01:16:09,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:09,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:09,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:09,541 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:09,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:09,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:10,212 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:10,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:10,212 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:10,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:10,265 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:10,271 INFO ]: Computing forward predicates... [2018-06-22 01:16:11,083 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:11,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:11,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-06-22 01:16:11,102 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:16:11,102 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:16:11,102 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2152, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:16:11,102 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 48 states. [2018-06-22 01:16:12,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:12,314 INFO ]: Finished difference Result 69 states and 74 transitions. [2018-06-22 01:16:12,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:16:12,314 INFO ]: Start accepts. Automaton has 48 states. Word has length 41 [2018-06-22 01:16:12,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:12,314 INFO ]: With dead ends: 69 [2018-06-22 01:16:12,314 INFO ]: Without dead ends: 69 [2018-06-22 01:16:12,315 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=247, Invalid=4583, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:16:12,315 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:16:12,316 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-06-22 01:16:12,316 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:16:12,316 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 01:16:12,316 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-22 01:16:12,317 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:12,317 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 01:16:12,317 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:16:12,317 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 01:16:12,317 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:16:12,317 INFO ]: Found error trace [2018-06-22 01:16:12,317 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:12,317 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:12,317 INFO ]: Analyzing trace with hash 1283419024, now seen corresponding path program 32 times [2018-06-22 01:16:12,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:12,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:12,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:12,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:12,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:12,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:12,746 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:12,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:12,746 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:12,751 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:12,800 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:12,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:12,803 INFO ]: Computing forward predicates... [2018-06-22 01:16:13,805 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:13,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:13,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2018-06-22 01:16:13,824 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:16:13,824 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:16:13,824 INFO ]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:16:13,824 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 48 states. [2018-06-22 01:16:14,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:14,673 INFO ]: Finished difference Result 82 states and 88 transitions. [2018-06-22 01:16:14,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 01:16:14,676 INFO ]: Start accepts. Automaton has 48 states. Word has length 42 [2018-06-22 01:16:14,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:14,676 INFO ]: With dead ends: 82 [2018-06-22 01:16:14,676 INFO ]: Without dead ends: 59 [2018-06-22 01:16:14,677 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1284, Invalid=5522, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 01:16:14,677 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:16:14,679 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-06-22 01:16:14,679 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:16:14,679 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-06-22 01:16:14,679 INFO ]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-06-22 01:16:14,679 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:14,679 INFO ]: Abstraction has 45 states and 48 transitions. [2018-06-22 01:16:14,679 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:16:14,679 INFO ]: Start isEmpty. Operand 45 states and 48 transitions. [2018-06-22 01:16:14,679 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:16:14,679 INFO ]: Found error trace [2018-06-22 01:16:14,679 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:14,680 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:14,680 INFO ]: Analyzing trace with hash 1670968390, now seen corresponding path program 33 times [2018-06-22 01:16:14,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:14,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:14,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:14,680 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:14,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:14,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:14,925 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:14,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:14,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:14,931 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:14,986 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:16:14,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:14,990 INFO ]: Computing forward predicates... [2018-06-22 01:16:15,149 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:16:15,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:15,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-22 01:16:15,169 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:16:15,169 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:16:15,169 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:16:15,169 INFO ]: Start difference. First operand 45 states and 48 transitions. Second operand 37 states. [2018-06-22 01:16:15,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:15,420 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 01:16:15,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:16:15,425 INFO ]: Start accepts. Automaton has 37 states. Word has length 42 [2018-06-22 01:16:15,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:15,426 INFO ]: With dead ends: 56 [2018-06-22 01:16:15,426 INFO ]: Without dead ends: 56 [2018-06-22 01:16:15,426 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=681, Invalid=1671, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:16:15,426 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:16:15,427 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-06-22 01:16:15,427 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:16:15,428 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-22 01:16:15,428 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2018-06-22 01:16:15,428 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:15,428 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-22 01:16:15,428 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:16:15,428 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-22 01:16:15,428 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:16:15,428 INFO ]: Found error trace [2018-06-22 01:16:15,428 INFO ]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:15,428 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:15,428 INFO ]: Analyzing trace with hash 313941350, now seen corresponding path program 34 times [2018-06-22 01:16:15,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:15,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:15,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:15,431 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:15,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:15,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:15,754 INFO ]: Checked inductivity of 187 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:16:15,754 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:15,754 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:15,759 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:15,807 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:15,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:15,811 INFO ]: Computing forward predicates... [2018-06-22 01:16:16,178 INFO ]: Checked inductivity of 187 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:16:16,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:16,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-06-22 01:16:16,197 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:16:16,197 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:16:16,197 INFO ]: CoverageRelationStatistics Valid=381, Invalid=1875, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:16:16,197 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 48 states. [2018-06-22 01:16:16,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:16,490 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-22 01:16:16,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:16:16,490 INFO ]: Start accepts. Automaton has 48 states. Word has length 43 [2018-06-22 01:16:16,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:16,490 INFO ]: With dead ends: 57 [2018-06-22 01:16:16,490 INFO ]: Without dead ends: 45 [2018-06-22 01:16:16,490 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=774, Invalid=2886, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:16:16,490 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:16:16,491 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:16:16,491 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:16:16,492 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-22 01:16:16,492 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2018-06-22 01:16:16,492 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:16,492 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-22 01:16:16,492 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:16:16,492 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-22 01:16:16,492 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:16:16,492 INFO ]: Found error trace [2018-06-22 01:16:16,492 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:16,492 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:16,492 INFO ]: Analyzing trace with hash 1260055676, now seen corresponding path program 35 times [2018-06-22 01:16:16,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:16,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:16,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:16,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:16,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:16,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:17,042 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:16:17,042 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:17,042 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:17,048 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:17,110 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:16:17,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:17,117 INFO ]: Computing forward predicates... [2018-06-22 01:16:18,782 INFO ]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:18,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:18,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39] total 64 [2018-06-22 01:16:18,801 INFO ]: Interpolant automaton has 64 states [2018-06-22 01:16:18,801 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 01:16:18,802 INFO ]: CoverageRelationStatistics Valid=203, Invalid=3829, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:16:18,802 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 64 states. [2018-06-22 01:16:20,788 WARN ]: Spent 322.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:21,256 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:21,706 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 [2018-06-22 01:16:22,111 WARN ]: Spent 323.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 154 Received shutdown request... [2018-06-22 01:16:22,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:16:22,193 WARN ]: Verification canceled [2018-06-22 01:16:22,196 WARN ]: Timeout [2018-06-22 01:16:22,197 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:16:22 BoogieIcfgContainer [2018-06-22 01:16:22,197 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:16:22,197 INFO ]: Toolchain (without parser) took 59380.43 ms. Allocated memory was 305.1 MB in the beginning and 621.3 MB in the end (delta: 316.1 MB). Free memory was 261.7 MB in the beginning and 186.7 MB in the end (delta: 74.9 MB). Peak memory consumption was 391.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:22,198 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:16:22,198 INFO ]: ChcToBoogie took 55.05 ms. Allocated memory is still 305.1 MB. Free memory was 260.7 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:22,198 INFO ]: Boogie Preprocessor took 33.23 ms. Allocated memory is still 305.1 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:16:22,199 INFO ]: RCFGBuilder took 343.61 ms. Allocated memory is still 305.1 MB. Free memory was 257.6 MB in the beginning and 248.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:22,199 INFO ]: TraceAbstraction took 58938.83 ms. Allocated memory was 305.1 MB in the beginning and 621.3 MB in the end (delta: 316.1 MB). Free memory was 248.6 MB in the beginning and 186.7 MB in the end (delta: 61.9 MB). Peak memory consumption was 378.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:16:22,201 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 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.05 ms. Allocated memory is still 305.1 MB. Free memory was 260.7 MB in the beginning and 258.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 33.23 ms. Allocated memory is still 305.1 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 343.61 ms. Allocated memory is still 305.1 MB. Free memory was 257.6 MB in the beginning and 248.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58938.83 ms. Allocated memory was 305.1 MB in the beginning and 621.3 MB in the end (delta: 316.1 MB). Free memory was 248.6 MB in the beginning and 186.7 MB in the end (delta: 61.9 MB). Peak memory consumption was 378.0 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 constructing difference of abstraction (45states) and interpolant automaton (currently 33 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 94 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 58.8s OverallTime, 39 OverallIterations, 11 TraceHistogramMax, 26.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 415 SDtfs, 1397 SDslu, 6281 SDs, 0 SdLazy, 11296 SolverSat, 2115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2447 GetRequests, 810 SyntacticMatches, 10 SemanticMatches, 1626 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16490 ImplicationChecksByTransitivity, 44.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=36, 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.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 307 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 2123 NumberOfCodeBlocks, 2123 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 2047 ConstructedInterpolants, 75 QuantifiedInterpolants, 370750 SizeOfPredicates, 293 NumberOfNonLiveVariables, 11607 ConjunctsInSsa, 3000 ConjunctsInUnsatCore, 76 InterpolantComputations, 4 PerfectInterpolantSequences, 2904/5501 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.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-16-22-292.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-16-22-292.csv Completed graceful shutdown