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/reve/003-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:20:10,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:20:10,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:20:10,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:20:10,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:20:10,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:20:10,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:20:10,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:20:10,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:20:10,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:20:10,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:20:10,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:20:10,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:20:10,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:20:10,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:20:10,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:20:10,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:20:10,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:20:10,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:20:10,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:20:10,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:20:10,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:20:10,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:20:10,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:20:10,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:20:10,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:20:10,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:20:10,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:20:10,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:20:10,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:20:10,615 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:20:10,616 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:20:10,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:20:10,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:20:10,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:20:10,622 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:20:10,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:20:10,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:20:10,644 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:20:10,644 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:20:10,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:20:10,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:20:10,646 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:20:10,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:20:10,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:20:10,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:20:10,647 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:20:10,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:20:10,647 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:20:10,647 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:20:10,647 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:20:10,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:20:10,648 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:20:10,650 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:20:10,650 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:20:10,700 INFO ]: Repository-Root is: /tmp [2018-06-22 01:20:10,714 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:20:10,718 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:20:10,720 INFO ]: Initializing SmtParser... [2018-06-22 01:20:10,720 INFO ]: SmtParser initialized [2018-06-22 01:20:10,721 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-22 01:20:10,722 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:20:10,809 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 unknown [2018-06-22 01:20:10,960 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-22 01:20:10,963 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:20:10,969 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:20:10,969 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:20:10,970 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:20:10,974 INFO ]: ChcToBoogie initialized [2018-06-22 01:20:10,977 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:20:10" (1/1) ... [2018-06-22 01:20:11,022 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11 Unit [2018-06-22 01:20:11,022 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:20:11,023 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:20:11,023 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:20:11,023 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:20:11,042 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,042 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,048 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,048 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,052 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,054 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,055 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (1/1) ... [2018-06-22 01:20:11,067 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:20:11,067 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:20:11,067 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:20:11,067 INFO ]: RCFGBuilder initialized [2018-06-22 01:20:11,068 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (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:20:11,087 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:20:11,088 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:20:11,088 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:20:11,088 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:20:11,088 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:20:11,088 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:20:11,387 INFO ]: Using library mode [2018-06-22 01:20:11,388 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:20:11 BoogieIcfgContainer [2018-06-22 01:20:11,388 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:20:11,389 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:20:11,389 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:20:11,392 INFO ]: TraceAbstraction initialized [2018-06-22 01:20:11,392 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:20:10" (1/3) ... [2018-06-22 01:20:11,393 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44af81fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:20:11, skipping insertion in model container [2018-06-22 01:20:11,393 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:20:11" (2/3) ... [2018-06-22 01:20:11,393 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44af81fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:20:11, skipping insertion in model container [2018-06-22 01:20:11,393 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:20:11" (3/3) ... [2018-06-22 01:20:11,395 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:20:11,404 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:20:11,411 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:20:11,486 INFO ]: Using default assertion order modulation [2018-06-22 01:20:11,486 INFO ]: Interprodecural is true [2018-06-22 01:20:11,486 INFO ]: Hoare is false [2018-06-22 01:20:11,487 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:20:11,487 INFO ]: Backedges is TWOTRACK [2018-06-22 01:20:11,487 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:20:11,492 INFO ]: Difference is false [2018-06-22 01:20:11,492 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:20:11,492 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:20:11,507 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:20:11,519 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:20:11,519 INFO ]: Found error trace [2018-06-22 01:20:11,520 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:11,520 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:11,524 INFO ]: Analyzing trace with hash -204902306, now seen corresponding path program 1 times [2018-06-22 01:20:11,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:11,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:11,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:11,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:11,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:11,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:11,781 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:20:11,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:20:11,784 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:20:11,786 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:20:11,796 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:20:11,797 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:11,799 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:20:11,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:11,859 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 01:20:11,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:20:11,862 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:20:11,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:11,871 INFO ]: With dead ends: 9 [2018-06-22 01:20:11,871 INFO ]: Without dead ends: 9 [2018-06-22 01:20:11,875 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:11,893 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:20:11,912 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:20:11,913 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:20:11,914 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:20:11,915 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 01:20:11,915 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:11,915 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:20:11,915 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:20:11,915 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:20:11,915 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:20:11,915 INFO ]: Found error trace [2018-06-22 01:20:11,915 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:11,915 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:11,915 INFO ]: Analyzing trace with hash -2054566951, now seen corresponding path program 1 times [2018-06-22 01:20:11,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:11,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:11,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:11,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:11,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:11,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:11,969 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:20:11,969 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:20:11,969 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:20:11,972 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:20:11,972 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:20:11,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:11,972 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-22 01:20:12,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:12,070 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-22 01:20:12,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:20:12,071 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:20:12,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:12,071 INFO ]: With dead ends: 10 [2018-06-22 01:20:12,071 INFO ]: Without dead ends: 9 [2018-06-22 01:20:12,072 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:12,072 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:20:12,073 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:20:12,073 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:20:12,073 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-22 01:20:12,073 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-22 01:20:12,073 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:12,073 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-22 01:20:12,074 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:20:12,074 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-22 01:20:12,074 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:20:12,074 INFO ]: Found error trace [2018-06-22 01:20:12,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:12,074 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:12,074 INFO ]: Analyzing trace with hash -2050872867, now seen corresponding path program 1 times [2018-06-22 01:20:12,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:12,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:12,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:12,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:12,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:12,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:12,227 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:20:12,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:12,227 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) [2018-06-22 01:20:12,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:12,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:12,312 INFO ]: Computing forward predicates... [2018-06-22 01:20:12,490 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:20:12,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:12,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:20:12,523 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:20:12,523 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:20:12,523 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:20:12,523 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-22 01:20:12,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:12,629 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-22 01:20:12,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:20:12,630 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:20:12,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:12,630 INFO ]: With dead ends: 10 [2018-06-22 01:20:12,630 INFO ]: Without dead ends: 10 [2018-06-22 01:20:12,631 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:20:12,631 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:20:12,632 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:20:12,632 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:20:12,632 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-22 01:20:12,632 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-22 01:20:12,632 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:12,632 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-22 01:20:12,632 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:20:12,633 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-22 01:20:12,633 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:20:12,633 INFO ]: Found error trace [2018-06-22 01:20:12,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:12,633 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:12,633 INFO ]: Analyzing trace with hash -2049025825, now seen corresponding path program 1 times [2018-06-22 01:20:12,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:12,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:12,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:12,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:12,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:12,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:12,711 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:20:12,711 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:20:12,712 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:20:12,713 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:20:12,713 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:20:12,713 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:12,713 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 3 states. [2018-06-22 01:20:12,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:12,767 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-22 01:20:12,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:20:12,767 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:20:12,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:12,767 INFO ]: With dead ends: 11 [2018-06-22 01:20:12,767 INFO ]: Without dead ends: 10 [2018-06-22 01:20:12,768 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:20:12,768 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:20:12,769 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:20:12,769 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:20:12,769 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-22 01:20:12,769 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-22 01:20:12,769 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:12,769 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-22 01:20:12,770 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:20:12,770 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-22 01:20:12,770 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:20:12,770 INFO ]: Found error trace [2018-06-22 01:20:12,770 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:12,770 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:12,770 INFO ]: Analyzing trace with hash 853581886, now seen corresponding path program 2 times [2018-06-22 01:20:12,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:12,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:12,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:12,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:12,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:12,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:13,000 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 01:20:13,239 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 01:20:13,241 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:13,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:13,241 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:20:13,247 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:20:13,312 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:20:13,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:13,338 INFO ]: Computing forward predicates... [2018-06-22 01:20:13,651 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:13,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:13,684 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:20:13,684 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:20:13,684 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:20:13,684 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:20:13,684 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-22 01:20:13,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:13,897 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-22 01:20:13,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:20:13,897 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:20:13,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:13,898 INFO ]: With dead ends: 12 [2018-06-22 01:20:13,898 INFO ]: Without dead ends: 12 [2018-06-22 01:20:13,898 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:20:13,898 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:20:13,899 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:20:13,899 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:20:13,900 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-22 01:20:13,900 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-06-22 01:20:13,900 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:13,900 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-22 01:20:13,900 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:20:13,900 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-22 01:20:13,900 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:20:13,900 INFO ]: Found error trace [2018-06-22 01:20:13,900 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:13,900 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:13,900 INFO ]: Analyzing trace with hash 149641246, now seen corresponding path program 3 times [2018-06-22 01:20:13,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:13,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:13,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:13,901 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:13,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:13,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:14,327 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:14,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:14,328 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:20:14,338 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:14,402 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:20:14,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:14,406 INFO ]: Computing forward predicates... [2018-06-22 01:20:14,482 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:14,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:14,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 01:20:14,503 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:20:14,503 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:20:14,503 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:20:14,503 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-06-22 01:20:14,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:14,548 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-22 01:20:14,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:20:14,551 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 01:20:14,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:14,551 INFO ]: With dead ends: 14 [2018-06-22 01:20:14,551 INFO ]: Without dead ends: 14 [2018-06-22 01:20:14,552 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:20:14,552 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:20:14,553 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:20:14,553 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:20:14,553 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-22 01:20:14,554 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-06-22 01:20:14,554 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:14,554 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-22 01:20:14,554 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:20:14,554 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-22 01:20:14,554 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:20:14,554 INFO ]: Found error trace [2018-06-22 01:20:14,554 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:14,554 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:14,554 INFO ]: Analyzing trace with hash -2027448322, now seen corresponding path program 4 times [2018-06-22 01:20:14,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:14,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:14,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:14,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:14,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:14,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:15,654 WARN ]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:20:15,656 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:15,656 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:15,656 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) [2018-06-22 01:20:15,672 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:15,734 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:15,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:15,744 INFO ]: Computing forward predicates... [2018-06-22 01:20:16,329 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:16,363 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:16,363 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:20:16,363 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:20:16,364 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:20:16,364 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:20:16,364 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-22 01:20:16,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:16,494 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-22 01:20:16,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:20:16,494 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 01:20:16,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:16,494 INFO ]: With dead ends: 15 [2018-06-22 01:20:16,495 INFO ]: Without dead ends: 15 [2018-06-22 01:20:16,495 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:20:16,495 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:20:16,496 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:20:16,496 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:20:16,497 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-22 01:20:16,497 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-22 01:20:16,497 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:16,497 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-22 01:20:16,497 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:20:16,497 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-22 01:20:16,497 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:20:16,497 INFO ]: Found error trace [2018-06-22 01:20:16,498 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:16,498 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:16,498 INFO ]: Analyzing trace with hash 1579742781, now seen corresponding path program 5 times [2018-06-22 01:20:16,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:16,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:16,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:16,499 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:16,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:16,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:16,829 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:16,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:16,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:16,841 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:20:16,884 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:20:16,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:16,889 INFO ]: Computing forward predicates... [2018-06-22 01:20:16,946 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:16,967 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:16,967 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:20:16,967 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:20:16,967 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:20:16,967 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:20:16,968 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 11 states. [2018-06-22 01:20:17,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:17,045 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-22 01:20:17,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:20:17,045 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:20:17,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:17,046 INFO ]: With dead ends: 17 [2018-06-22 01:20:17,046 INFO ]: Without dead ends: 17 [2018-06-22 01:20:17,046 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:20:17,046 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:20:17,047 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:20:17,047 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:20:17,048 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-22 01:20:17,048 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-06-22 01:20:17,048 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:17,048 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-22 01:20:17,048 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:20:17,048 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-22 01:20:17,049 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:20:17,050 INFO ]: Found error trace [2018-06-22 01:20:17,050 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:17,050 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:17,050 INFO ]: Analyzing trace with hash -2089407907, now seen corresponding path program 6 times [2018-06-22 01:20:17,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:17,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:17,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:17,051 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:17,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:17,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:17,442 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:17,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:17,442 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:20:17,449 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:20:17,506 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:20:17,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:17,511 INFO ]: Computing forward predicates... [2018-06-22 01:20:17,809 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:17,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:17,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:20:17,829 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:20:17,829 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:20:17,829 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:20:17,830 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 13 states. [2018-06-22 01:20:17,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:17,967 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-22 01:20:17,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:20:17,969 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 01:20:17,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:17,969 INFO ]: With dead ends: 18 [2018-06-22 01:20:17,969 INFO ]: Without dead ends: 18 [2018-06-22 01:20:17,970 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:20:17,970 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:20:17,971 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:20:17,971 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:20:17,972 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-22 01:20:17,972 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-22 01:20:17,972 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:17,972 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-22 01:20:17,972 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:20:17,972 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-22 01:20:17,972 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:20:17,972 INFO ]: Found error trace [2018-06-22 01:20:17,972 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:17,972 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:17,973 INFO ]: Analyzing trace with hash -341004354, now seen corresponding path program 7 times [2018-06-22 01:20:17,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:17,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:17,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:17,974 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:17,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:18,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:18,342 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:18,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:18,342 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:20:18,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:18,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:18,438 INFO ]: Computing forward predicates... [2018-06-22 01:20:18,784 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:18,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:18,815 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 01:20:18,815 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:20:18,815 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:20:18,816 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:20:18,816 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 14 states. [2018-06-22 01:20:19,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:19,109 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-22 01:20:19,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:20:19,113 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 01:20:19,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:19,113 INFO ]: With dead ends: 19 [2018-06-22 01:20:19,113 INFO ]: Without dead ends: 19 [2018-06-22 01:20:19,114 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:20:19,114 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:20:19,115 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:20:19,115 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:20:19,116 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-22 01:20:19,116 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-22 01:20:19,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:19,116 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-22 01:20:19,116 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:20:19,116 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-22 01:20:19,116 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:20:19,116 INFO ]: Found error trace [2018-06-22 01:20:19,116 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:19,116 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:19,117 INFO ]: Analyzing trace with hash -1975069059, now seen corresponding path program 8 times [2018-06-22 01:20:19,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:19,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:19,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:19,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:19,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:19,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:19,427 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:19,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:19,427 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:20:19,433 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:20:19,500 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:20:19,500 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:19,510 INFO ]: Computing forward predicates... [2018-06-22 01:20:19,697 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:19,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:19,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 01:20:19,716 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:20:19,717 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:20:19,717 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:20:19,717 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 15 states. [2018-06-22 01:20:19,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:19,850 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-22 01:20:19,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:20:19,851 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-22 01:20:19,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:19,851 INFO ]: With dead ends: 20 [2018-06-22 01:20:19,851 INFO ]: Without dead ends: 20 [2018-06-22 01:20:19,851 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:20:19,851 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:20:19,853 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:20:19,853 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:20:19,853 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-22 01:20:19,853 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-22 01:20:19,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:19,853 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-22 01:20:19,853 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:20:19,854 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-22 01:20:19,854 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:20:19,854 INFO ]: Found error trace [2018-06-22 01:20:19,854 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:19,854 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:19,854 INFO ]: Analyzing trace with hash -1091467362, now seen corresponding path program 9 times [2018-06-22 01:20:19,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:19,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:19,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:19,855 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:19,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:19,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:20,121 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:20,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:20,121 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:20:20,127 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:20,242 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:20:20,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:20,250 INFO ]: Computing forward predicates... [2018-06-22 01:20:20,366 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:20,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:20,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-22 01:20:20,387 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:20:20,387 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:20:20,388 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:20:20,388 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-06-22 01:20:20,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:20,532 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-22 01:20:20,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:20:20,536 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-22 01:20:20,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:20,536 INFO ]: With dead ends: 21 [2018-06-22 01:20:20,536 INFO ]: Without dead ends: 21 [2018-06-22 01:20:20,537 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:20:20,537 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:20:20,539 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:20:20,539 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:20:20,539 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-22 01:20:20,539 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-22 01:20:20,539 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:20,539 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-22 01:20:20,539 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:20:20,539 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-22 01:20:20,540 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:20:20,540 INFO ]: Found error trace [2018-06-22 01:20:20,540 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:20,540 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:20,540 INFO ]: Analyzing trace with hash 530381469, now seen corresponding path program 10 times [2018-06-22 01:20:20,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:20,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:20,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:20,541 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:20,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:20,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:21,597 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:21,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:21,597 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:20:21,603 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:21,669 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:21,669 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:21,677 INFO ]: Computing forward predicates... [2018-06-22 01:20:22,146 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:22,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:22,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 01:20:22,169 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:20:22,169 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:20:22,169 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:20:22,169 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 17 states. [2018-06-22 01:20:22,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:22,460 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-22 01:20:22,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:20:22,461 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-22 01:20:22,461 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:22,461 INFO ]: With dead ends: 22 [2018-06-22 01:20:22,461 INFO ]: Without dead ends: 22 [2018-06-22 01:20:22,461 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:20:22,461 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:20:22,463 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 01:20:22,463 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:20:22,463 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-22 01:20:22,463 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-22 01:20:22,463 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:22,463 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-22 01:20:22,463 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:20:22,463 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-22 01:20:22,464 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:20:22,464 INFO ]: Found error trace [2018-06-22 01:20:22,464 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:22,464 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:22,464 INFO ]: Analyzing trace with hash -731912322, now seen corresponding path program 11 times [2018-06-22 01:20:22,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:22,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:22,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:22,465 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:22,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:22,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:22,976 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:22,976 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:22,976 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:22,981 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:20:23,135 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:20:23,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:23,143 INFO ]: Computing forward predicates... [2018-06-22 01:20:23,567 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:23,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:23,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-22 01:20:23,587 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:20:23,587 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:20:23,587 INFO ]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:20:23,587 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 18 states. [2018-06-22 01:20:23,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:23,743 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-22 01:20:23,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:20:23,743 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 01:20:23,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:23,743 INFO ]: With dead ends: 24 [2018-06-22 01:20:23,743 INFO ]: Without dead ends: 24 [2018-06-22 01:20:23,743 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:20:23,743 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:20:23,745 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:20:23,745 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:20:23,745 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-22 01:20:23,745 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-06-22 01:20:23,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:23,745 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-22 01:20:23,745 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:20:23,745 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-22 01:20:23,745 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:20:23,746 INFO ]: Found error trace [2018-06-22 01:20:23,746 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:23,746 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:23,746 INFO ]: Analyzing trace with hash 1203097438, now seen corresponding path program 12 times [2018-06-22 01:20:23,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:23,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:23,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:23,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:23,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:23,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:24,481 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:24,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:24,481 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:20:24,487 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:20:24,694 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:20:24,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:24,704 INFO ]: Computing forward predicates... [2018-06-22 01:20:25,017 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:25,050 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:25,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-22 01:20:25,050 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:20:25,051 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:20:25,051 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:20:25,051 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-22 01:20:25,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:25,255 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-22 01:20:25,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:20:25,256 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-22 01:20:25,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:25,256 INFO ]: With dead ends: 25 [2018-06-22 01:20:25,256 INFO ]: Without dead ends: 25 [2018-06-22 01:20:25,257 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:20:25,257 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:20:25,258 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 01:20:25,258 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:20:25,259 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-22 01:20:25,259 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-22 01:20:25,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:25,259 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-22 01:20:25,259 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:20:25,259 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-22 01:20:25,260 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:20:25,260 INFO ]: Found error trace [2018-06-22 01:20:25,260 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:25,260 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:25,260 INFO ]: Analyzing trace with hash -1352553763, now seen corresponding path program 13 times [2018-06-22 01:20:25,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:25,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:25,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:25,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:25,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:25,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:25,760 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:25,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:25,760 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:20:25,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:25,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:25,869 INFO ]: Computing forward predicates... [2018-06-22 01:20:26,258 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:26,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:26,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-06-22 01:20:26,278 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:20:26,278 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:20:26,278 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:20:26,278 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-22 01:20:26,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:26,548 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-22 01:20:26,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:20:26,548 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-22 01:20:26,548 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:26,548 INFO ]: With dead ends: 26 [2018-06-22 01:20:26,548 INFO ]: Without dead ends: 26 [2018-06-22 01:20:26,549 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:20:26,549 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:20:26,551 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 01:20:26,551 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:20:26,551 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-22 01:20:26,551 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-22 01:20:26,552 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:26,552 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-22 01:20:26,552 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:20:26,552 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-22 01:20:26,552 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:20:26,552 INFO ]: Found error trace [2018-06-22 01:20:26,553 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:26,553 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:26,553 INFO ]: Analyzing trace with hash 1026637630, now seen corresponding path program 14 times [2018-06-22 01:20:26,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:26,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:26,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:26,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:26,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:26,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:27,093 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:27,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:27,093 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:20:27,101 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:20:27,205 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:20:27,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:27,221 INFO ]: Computing forward predicates... [2018-06-22 01:20:27,482 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:27,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:27,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-22 01:20:27,502 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:20:27,502 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:20:27,502 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:20:27,503 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-22 01:20:27,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:27,793 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-22 01:20:27,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:20:27,793 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-22 01:20:27,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:27,794 INFO ]: With dead ends: 27 [2018-06-22 01:20:27,794 INFO ]: Without dead ends: 27 [2018-06-22 01:20:27,794 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:20:27,794 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:20:27,796 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:20:27,796 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:20:27,796 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-22 01:20:27,796 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-22 01:20:27,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:27,796 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-22 01:20:27,796 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:20:27,797 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-22 01:20:27,797 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:20:27,797 INFO ]: Found error trace [2018-06-22 01:20:27,797 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:27,797 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:27,797 INFO ]: Analyzing trace with hash 1767126781, now seen corresponding path program 15 times [2018-06-22 01:20:27,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:27,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:27,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:27,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:27,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:27,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:28,680 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:28,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:28,680 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:20:28,696 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:28,796 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 01:20:28,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:28,804 INFO ]: Computing forward predicates... [2018-06-22 01:20:28,958 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:28,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:28,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-22 01:20:28,978 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:20:28,979 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:20:28,979 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:20:28,979 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 23 states. [2018-06-22 01:20:29,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:29,260 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-22 01:20:29,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:20:29,260 INFO ]: Start accepts. Automaton has 23 states. Word has length 26 [2018-06-22 01:20:29,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:29,260 INFO ]: With dead ends: 28 [2018-06-22 01:20:29,260 INFO ]: Without dead ends: 28 [2018-06-22 01:20:29,261 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:20:29,261 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:20:29,262 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:20:29,262 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:20:29,263 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-22 01:20:29,263 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-22 01:20:29,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:29,263 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-22 01:20:29,263 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:20:29,263 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-22 01:20:29,264 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:20:29,264 INFO ]: Found error trace [2018-06-22 01:20:29,264 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:29,264 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:29,264 INFO ]: Analyzing trace with hash -1047513314, now seen corresponding path program 16 times [2018-06-22 01:20:29,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:29,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:29,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:29,264 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:29,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:29,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:29,794 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:29,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:29,794 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:20:29,800 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:29,941 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:29,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:29,954 INFO ]: Computing forward predicates... [2018-06-22 01:20:30,197 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:30,217 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:30,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-22 01:20:30,217 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:20:30,217 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:20:30,217 INFO ]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:20:30,218 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-22 01:20:30,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:30,560 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-22 01:20:30,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:20:30,560 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-22 01:20:30,560 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:30,561 INFO ]: With dead ends: 29 [2018-06-22 01:20:30,561 INFO ]: Without dead ends: 29 [2018-06-22 01:20:30,561 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:20:30,561 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:20:30,563 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:20:30,563 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:20:30,563 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-22 01:20:30,563 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-22 01:20:30,563 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:30,563 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-22 01:20:30,563 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:20:30,563 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-22 01:20:30,564 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:20:30,564 INFO ]: Found error trace [2018-06-22 01:20:30,564 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:30,564 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:30,564 INFO ]: Analyzing trace with hash 1892956957, now seen corresponding path program 17 times [2018-06-22 01:20:30,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:30,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:30,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:30,565 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:30,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:30,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:32,066 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:32,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:32,066 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:20:32,072 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:20:32,180 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:20:32,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:32,191 INFO ]: Computing forward predicates... [2018-06-22 01:20:32,443 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:32,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:32,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-22 01:20:32,464 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:20:32,464 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:20:32,464 INFO ]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:20:32,464 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 25 states. [2018-06-22 01:20:32,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:32,850 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-22 01:20:32,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:20:32,851 INFO ]: Start accepts. Automaton has 25 states. Word has length 28 [2018-06-22 01:20:32,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:32,851 INFO ]: With dead ends: 31 [2018-06-22 01:20:32,851 INFO ]: Without dead ends: 31 [2018-06-22 01:20:32,852 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:20:32,852 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:20:32,854 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:20:32,854 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:20:32,854 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-22 01:20:32,854 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-06-22 01:20:32,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:32,854 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-22 01:20:32,854 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:20:32,854 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-22 01:20:32,855 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:20:32,855 INFO ]: Found error trace [2018-06-22 01:20:32,855 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:32,855 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:32,855 INFO ]: Analyzing trace with hash -1738295491, now seen corresponding path program 18 times [2018-06-22 01:20:32,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:32,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:32,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:32,856 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:32,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:32,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:33,714 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:33,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:33,714 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:20:33,720 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:20:33,838 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-22 01:20:33,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:33,847 INFO ]: Computing forward predicates... [2018-06-22 01:20:34,072 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:34,092 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:34,092 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-06-22 01:20:34,093 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:20:34,093 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:20:34,093 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:20:34,093 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-22 01:20:34,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:34,828 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-22 01:20:34,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:20:34,829 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-22 01:20:34,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:34,829 INFO ]: With dead ends: 32 [2018-06-22 01:20:34,829 INFO ]: Without dead ends: 32 [2018-06-22 01:20:34,830 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:20:34,830 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:20:34,831 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:20:34,831 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:20:34,832 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-22 01:20:34,832 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-22 01:20:34,832 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:34,832 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-22 01:20:34,832 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:20:34,832 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-22 01:20:34,834 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:20:34,834 INFO ]: Found error trace [2018-06-22 01:20:34,834 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:34,834 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:34,834 INFO ]: Analyzing trace with hash 1953545950, now seen corresponding path program 19 times [2018-06-22 01:20:34,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:34,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:34,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:34,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:34,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:34,958 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:35,651 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:35,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:35,652 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:20:35,659 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:35,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:35,820 INFO ]: Computing forward predicates... [2018-06-22 01:20:36,145 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:36,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:36,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-22 01:20:36,166 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:20:36,166 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:20:36,166 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:20:36,166 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-22 01:20:36,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:36,727 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-22 01:20:36,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:20:36,729 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-22 01:20:36,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:36,729 INFO ]: With dead ends: 33 [2018-06-22 01:20:36,729 INFO ]: Without dead ends: 33 [2018-06-22 01:20:36,730 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:20:36,730 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:20:36,732 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:20:36,732 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:20:36,732 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-22 01:20:36,732 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-22 01:20:36,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:36,732 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-22 01:20:36,732 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:20:36,732 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-22 01:20:36,733 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:20:36,733 INFO ]: Found error trace [2018-06-22 01:20:36,733 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:36,733 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:36,733 INFO ]: Analyzing trace with hash 436513629, now seen corresponding path program 20 times [2018-06-22 01:20:36,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:36,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:36,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:36,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:36,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:36,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:37,639 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:37,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:37,639 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:20:37,644 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:20:37,803 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:20:37,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:37,817 INFO ]: Computing forward predicates... [2018-06-22 01:20:38,266 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:38,287 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:38,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-22 01:20:38,287 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:20:38,287 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:20:38,288 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:20:38,288 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 29 states. [2018-06-22 01:20:38,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:38,733 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-22 01:20:38,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:20:38,733 INFO ]: Start accepts. Automaton has 29 states. Word has length 32 [2018-06-22 01:20:38,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:38,733 INFO ]: With dead ends: 34 [2018-06-22 01:20:38,733 INFO ]: Without dead ends: 34 [2018-06-22 01:20:38,733 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 18 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:20:38,733 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:20:38,735 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 01:20:38,735 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:20:38,736 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-22 01:20:38,736 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-22 01:20:38,736 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:38,736 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-22 01:20:38,736 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:20:38,736 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-22 01:20:38,736 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:20:38,736 INFO ]: Found error trace [2018-06-22 01:20:38,737 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:38,737 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:38,737 INFO ]: Analyzing trace with hash 653151934, now seen corresponding path program 21 times [2018-06-22 01:20:38,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:38,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:38,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:38,737 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:38,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:38,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:39,642 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:39,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:39,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:20:39,650 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:39,799 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-06-22 01:20:39,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:39,816 INFO ]: Computing forward predicates... [2018-06-22 01:20:40,256 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:40,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:40,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-22 01:20:40,281 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:20:40,281 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:20:40,281 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:20:40,281 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 30 states. [2018-06-22 01:20:40,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:40,760 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-22 01:20:40,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:20:40,761 INFO ]: Start accepts. Automaton has 30 states. Word has length 33 [2018-06-22 01:20:40,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:40,761 INFO ]: With dead ends: 35 [2018-06-22 01:20:40,761 INFO ]: Without dead ends: 35 [2018-06-22 01:20:40,761 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 15 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:20:40,761 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:20:40,764 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 01:20:40,764 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:20:40,764 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-22 01:20:40,765 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-22 01:20:40,765 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:40,765 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-22 01:20:40,765 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:20:40,765 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-22 01:20:40,765 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:20:40,765 INFO ]: Found error trace [2018-06-22 01:20:40,765 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:40,765 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:40,765 INFO ]: Analyzing trace with hash -1220995203, now seen corresponding path program 22 times [2018-06-22 01:20:40,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:40,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:40,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:40,766 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:40,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:40,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:41,809 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:41,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:41,809 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:20:41,815 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:41,995 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:41,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:42,018 INFO ]: Computing forward predicates... [2018-06-22 01:20:42,331 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:42,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:42,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-22 01:20:42,350 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:20:42,350 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:20:42,351 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:20:42,351 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 31 states. [2018-06-22 01:20:42,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:42,826 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-22 01:20:42,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:20:42,827 INFO ]: Start accepts. Automaton has 31 states. Word has length 34 [2018-06-22 01:20:42,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:42,827 INFO ]: With dead ends: 36 [2018-06-22 01:20:42,827 INFO ]: Without dead ends: 36 [2018-06-22 01:20:42,828 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:20:42,828 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:20:42,829 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:20:42,829 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:20:42,829 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-22 01:20:42,829 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-22 01:20:42,829 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:42,829 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-22 01:20:42,830 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:20:42,830 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-22 01:20:42,830 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:20:42,830 INFO ]: Found error trace [2018-06-22 01:20:42,830 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:42,830 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:42,830 INFO ]: Analyzing trace with hash 809985694, now seen corresponding path program 23 times [2018-06-22 01:20:42,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:42,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:42,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:42,831 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:42,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:42,939 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:44,570 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:44,570 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:44,570 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:20:44,576 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:20:44,728 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-06-22 01:20:44,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:44,746 INFO ]: Computing forward predicates... [2018-06-22 01:20:45,341 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:45,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:45,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-22 01:20:45,362 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:20:45,362 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:20:45,363 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:20:45,363 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 32 states. [2018-06-22 01:20:45,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:45,920 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-22 01:20:45,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:20:45,922 INFO ]: Start accepts. Automaton has 32 states. Word has length 35 [2018-06-22 01:20:45,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:45,922 INFO ]: With dead ends: 37 [2018-06-22 01:20:45,922 INFO ]: Without dead ends: 37 [2018-06-22 01:20:45,922 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 20 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:20:45,922 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:20:45,924 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:20:45,924 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:20:45,924 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-22 01:20:45,924 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-22 01:20:45,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:45,925 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-22 01:20:45,925 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:20:45,925 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-22 01:20:45,925 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:20:45,925 INFO ]: Found error trace [2018-06-22 01:20:45,925 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:45,925 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:45,925 INFO ]: Analyzing trace with hash -654115939, now seen corresponding path program 24 times [2018-06-22 01:20:45,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:45,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:45,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:45,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:45,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:46,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:47,089 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:47,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:47,089 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:20:47,094 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:20:47,239 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-22 01:20:47,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:47,250 INFO ]: Computing forward predicates... [2018-06-22 01:20:47,692 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:47,712 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:47,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-22 01:20:47,713 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:20:47,713 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:20:47,713 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:20:47,713 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 33 states. [2018-06-22 01:20:48,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:48,248 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-22 01:20:48,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:20:48,249 INFO ]: Start accepts. Automaton has 33 states. Word has length 36 [2018-06-22 01:20:48,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:48,249 INFO ]: With dead ends: 38 [2018-06-22 01:20:48,249 INFO ]: Without dead ends: 38 [2018-06-22 01:20:48,250 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 23 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:20:48,250 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:20:48,251 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:20:48,251 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:20:48,252 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-22 01:20:48,252 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-22 01:20:48,252 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:48,252 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-22 01:20:48,252 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:20:48,252 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-22 01:20:48,252 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:20:48,252 INFO ]: Found error trace [2018-06-22 01:20:48,252 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:48,253 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:48,260 INFO ]: Analyzing trace with hash 1203373694, now seen corresponding path program 25 times [2018-06-22 01:20:48,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:48,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:48,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:48,260 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:48,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:48,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:50,108 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:50,108 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:50,108 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:20:50,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:50,337 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:50,362 INFO ]: Computing forward predicates... [2018-06-22 01:20:50,927 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:50,947 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:50,947 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-22 01:20:50,947 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:20:50,947 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:20:50,947 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:20:50,947 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 34 states. [2018-06-22 01:20:51,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:51,530 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-22 01:20:51,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:20:51,531 INFO ]: Start accepts. Automaton has 34 states. Word has length 37 [2018-06-22 01:20:51,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:51,531 INFO ]: With dead ends: 39 [2018-06-22 01:20:51,531 INFO ]: Without dead ends: 39 [2018-06-22 01:20:51,531 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:20:51,531 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:20:51,533 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:20:51,533 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:20:51,533 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-22 01:20:51,533 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-22 01:20:51,533 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:51,533 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-22 01:20:51,533 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:20:51,533 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-22 01:20:51,534 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:20:51,534 INFO ]: Found error trace [2018-06-22 01:20:51,534 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:51,534 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:51,534 INFO ]: Analyzing trace with hash -1343989827, now seen corresponding path program 26 times [2018-06-22 01:20:51,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:51,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:51,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:51,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:20:51,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:51,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:53,027 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:53,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:53,054 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:20:53,060 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:20:53,291 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:20:53,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:53,327 INFO ]: Computing forward predicates... [2018-06-22 01:20:53,929 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:53,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:53,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-22 01:20:53,949 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:20:53,949 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:20:53,949 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:20:53,949 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 35 states. [2018-06-22 01:20:54,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:54,566 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-22 01:20:54,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:20:54,566 INFO ]: Start accepts. Automaton has 35 states. Word has length 38 [2018-06-22 01:20:54,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:54,567 INFO ]: With dead ends: 40 [2018-06-22 01:20:54,567 INFO ]: Without dead ends: 40 [2018-06-22 01:20:54,567 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:20:54,567 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:20:54,569 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 01:20:54,569 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:20:54,569 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-22 01:20:54,569 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-22 01:20:54,569 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:54,569 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-22 01:20:54,570 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:20:54,570 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-22 01:20:54,570 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:20:54,570 INFO ]: Found error trace [2018-06-22 01:20:54,570 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:54,570 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:54,570 INFO ]: Analyzing trace with hash 1292119646, now seen corresponding path program 27 times [2018-06-22 01:20:54,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:54,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:54,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:54,571 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:54,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:54,718 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:56,046 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:56,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:56,046 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:20:56,055 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:20:56,227 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-06-22 01:20:56,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:56,244 INFO ]: Computing forward predicates... [2018-06-22 01:20:56,615 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:56,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:56,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-22 01:20:56,637 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:20:56,637 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:20:56,637 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:20:56,637 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 36 states. [2018-06-22 01:20:57,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:20:57,282 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-22 01:20:57,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:20:57,282 INFO ]: Start accepts. Automaton has 36 states. Word has length 39 [2018-06-22 01:20:57,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:20:57,283 INFO ]: With dead ends: 41 [2018-06-22 01:20:57,283 INFO ]: Without dead ends: 41 [2018-06-22 01:20:57,283 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:20:57,283 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:20:57,285 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 01:20:57,285 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:20:57,285 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-22 01:20:57,285 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-22 01:20:57,285 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:20:57,285 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-22 01:20:57,285 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:20:57,285 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-22 01:20:57,286 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:20:57,286 INFO ]: Found error trace [2018-06-22 01:20:57,286 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:20:57,286 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:20:57,286 INFO ]: Analyzing trace with hash 1407134685, now seen corresponding path program 28 times [2018-06-22 01:20:57,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:20:57,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:20:57,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:57,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:20:57,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:20:57,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:58,601 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:58,602 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:20:58,632 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:20:58,638 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:20:58,901 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:20:58,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:20:58,931 INFO ]: Computing forward predicates... [2018-06-22 01:20:59,462 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:20:59,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:20:59,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-22 01:20:59,483 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:20:59,483 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:20:59,483 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:20:59,483 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 37 states. [2018-06-22 01:21:00,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:00,235 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-22 01:21:00,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:21:00,235 INFO ]: Start accepts. Automaton has 37 states. Word has length 40 [2018-06-22 01:21:00,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:00,235 INFO ]: With dead ends: 42 [2018-06-22 01:21:00,235 INFO ]: Without dead ends: 42 [2018-06-22 01:21:00,236 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:21:00,236 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:21:00,238 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:21:00,238 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:21:00,238 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-22 01:21:00,238 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-22 01:21:00,238 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:00,238 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-22 01:21:00,238 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:21:00,238 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-22 01:21:00,238 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:21:00,238 INFO ]: Found error trace [2018-06-22 01:21:00,238 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:00,238 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:00,239 INFO ]: Analyzing trace with hash 677633598, now seen corresponding path program 29 times [2018-06-22 01:21:00,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:00,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:00,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:00,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:00,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:00,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:01,430 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:01,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:01,430 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:21:01,437 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:21:01,649 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-22 01:21:01,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:01,674 INFO ]: Computing forward predicates... [2018-06-22 01:21:02,310 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:02,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:02,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2018-06-22 01:21:02,331 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:21:02,331 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:21:02,332 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:21:02,332 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-06-22 01:21:03,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:03,085 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-22 01:21:03,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:21:03,085 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-22 01:21:03,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:03,085 INFO ]: With dead ends: 43 [2018-06-22 01:21:03,085 INFO ]: Without dead ends: 43 [2018-06-22 01:21:03,086 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 15 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:21:03,086 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:21:03,087 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-22 01:21:03,087 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:21:03,087 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-22 01:21:03,087 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-22 01:21:03,087 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:03,087 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-22 01:21:03,087 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:21:03,087 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-22 01:21:03,088 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:21:03,088 INFO ]: Found error trace [2018-06-22 01:21:03,088 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:03,088 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:03,088 INFO ]: Analyzing trace with hash -462063619, now seen corresponding path program 30 times [2018-06-22 01:21:03,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:03,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:03,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:03,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:03,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:03,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:04,244 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:04,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:04,244 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:21:04,250 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:21:04,446 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-22 01:21:04,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:04,458 INFO ]: Computing forward predicates... [2018-06-22 01:21:04,977 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:04,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:04,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-22 01:21:04,998 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:21:04,998 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:21:04,998 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:21:04,998 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 39 states. [2018-06-22 01:21:05,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:05,879 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-22 01:21:05,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:21:05,879 INFO ]: Start accepts. Automaton has 39 states. Word has length 42 [2018-06-22 01:21:05,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:05,879 INFO ]: With dead ends: 44 [2018-06-22 01:21:05,879 INFO ]: Without dead ends: 44 [2018-06-22 01:21:05,880 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:21:05,880 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:21:05,881 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 01:21:05,881 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:21:05,881 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-22 01:21:05,881 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-22 01:21:05,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:05,881 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-22 01:21:05,881 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:21:05,881 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-22 01:21:05,881 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:21:05,881 INFO ]: Found error trace [2018-06-22 01:21:05,881 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:05,881 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:05,881 INFO ]: Analyzing trace with hash -1432938978, now seen corresponding path program 31 times [2018-06-22 01:21:05,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:05,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:05,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:05,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:21:05,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:06,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:07,125 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:07,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:07,125 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:21:07,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:07,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:07,488 INFO ]: Computing forward predicates... [2018-06-22 01:21:08,006 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:21:08,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:21:08,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-22 01:21:08,027 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:21:08,027 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:21:08,027 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:21:08,027 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 40 states. [2018-06-22 01:21:08,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:08,828 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-22 01:21:08,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:21:08,828 INFO ]: Start accepts. Automaton has 40 states. Word has length 43 [2018-06-22 01:21:08,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:08,829 INFO ]: With dead ends: 45 [2018-06-22 01:21:08,829 INFO ]: Without dead ends: 45 [2018-06-22 01:21:08,829 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 21 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:21:08,829 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:21:08,830 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:21:08,830 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:21:08,830 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-22 01:21:08,830 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-22 01:21:08,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:08,830 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-22 01:21:08,830 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:21:08,830 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-22 01:21:08,831 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:21:08,831 INFO ]: Found error trace [2018-06-22 01:21:08,831 INFO ]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:08,831 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:08,831 INFO ]: Analyzing trace with hash -1465304035, now seen corresponding path program 32 times [2018-06-22 01:21:08,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:08,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:08,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:08,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:08,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:09,039 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:21:09,291 WARN ]: Removed 1 from assertion stack [2018-06-22 01:21:09,312 WARN ]: Verification canceled [2018-06-22 01:21:09,316 WARN ]: Timeout [2018-06-22 01:21:09,316 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:21:09 BoogieIcfgContainer [2018-06-22 01:21:09,316 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:21:09,317 INFO ]: Toolchain (without parser) took 58352.99 ms. Allocated memory was 308.8 MB in the beginning and 864.6 MB in the end (delta: 555.7 MB). Free memory was 264.2 MB in the beginning and 235.1 MB in the end (delta: 29.0 MB). Peak memory consumption was 584.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:21:09,318 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:21:09,318 INFO ]: ChcToBoogie took 52.78 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.2 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:21:09,318 INFO ]: Boogie Preprocessor took 44.45 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 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:21:09,318 INFO ]: RCFGBuilder took 320.50 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 250.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:21:09,319 INFO ]: TraceAbstraction took 57926.99 ms. Allocated memory was 308.8 MB in the beginning and 864.6 MB in the end (delta: 555.7 MB). Free memory was 250.2 MB in the beginning and 235.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 570.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:21:09,321 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.78 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.45 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 320.50 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 250.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57926.99 ms. Allocated memory was 308.8 MB in the beginning and 864.6 MB in the end (delta: 555.7 MB). Free memory was 250.2 MB in the beginning and 235.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 570.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 37, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 57.8s OverallTime, 35 OverallIterations, 37 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 0 SDslu, 3255 SDs, 0 SdLazy, 18297 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1514 GetRequests, 466 SyntacticMatches, 361 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 31.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=34, 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, 34 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 1683 NumberOfCodeBlocks, 1683 NumberOfCodeBlocksAsserted, 228 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180565 SizeOfPredicates, 186 NumberOfNonLiveVariables, 25588 ConjunctsInSsa, 11375 ConjunctsInUnsatCore, 65 InterpolantComputations, 3 PerfectInterpolantSequences, 2/16014 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/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-21-09-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-21-09-430.csv Completed graceful shutdown