java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:08:01,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:08:01,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:08:01,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:08:01,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:08:01,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:08:01,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:08:01,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:08:01,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:08:01,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:08:01,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:08:01,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:08:01,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:08:01,791 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:08:01,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:08:01,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:08:01,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:08:01,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:08:01,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:08:01,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:08:01,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:08:01,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:08:01,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:08:01,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:08:01,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:08:01,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:08:01,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:08:01,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:08:01,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:08:01,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:08:01,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:08:01,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:08:01,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:08:01,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:08:01,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:08:01,832 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:08:01,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:08:01,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:08:01,855 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:08:01,855 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:08:01,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:08:01,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:08:01,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:08:01,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:08:01,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:08:01,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:08:01,858 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:08:01,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:08:01,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:08:01,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:08:01,859 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:08:01,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:08:01,859 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:08:01,861 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:08:01,862 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:08:01,914 INFO ]: Repository-Root is: /tmp [2018-06-22 01:08:01,927 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:08:01,932 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:08:01,934 INFO ]: Initializing SmtParser... [2018-06-22 01:08:01,934 INFO ]: SmtParser initialized [2018-06-22 01:08:01,935 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-22 01:08:01,936 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:08:02,034 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 unknown [2018-06-22 01:08:02,277 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe2-big2_merged_safe.c-1.smt2 [2018-06-22 01:08:02,281 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:08:02,288 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:08:02,288 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:08:02,288 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:08:02,289 INFO ]: ChcToBoogie initialized [2018-06-22 01:08:02,292 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,354 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02 Unit [2018-06-22 01:08:02,354 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:08:02,355 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:08:02,355 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:08:02,355 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:08:02,376 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,376 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,381 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,381 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,384 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,386 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,387 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... [2018-06-22 01:08:02,389 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:08:02,390 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:08:02,390 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:08:02,390 INFO ]: RCFGBuilder initialized [2018-06-22 01:08:02,391 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:08:02,404 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:08:02,404 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:08:02,404 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:08:02,404 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:08:02,404 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:08:02,404 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:08:02,732 INFO ]: Using library mode [2018-06-22 01:08:02,732 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:08:02 BoogieIcfgContainer [2018-06-22 01:08:02,732 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:08:02,735 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:08:02,735 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:08:02,738 INFO ]: TraceAbstraction initialized [2018-06-22 01:08:02,738 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:08:02" (1/3) ... [2018-06-22 01:08:02,741 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b6bada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:08:02, skipping insertion in model container [2018-06-22 01:08:02,741 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:08:02" (2/3) ... [2018-06-22 01:08:02,742 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b6bada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:08:02, skipping insertion in model container [2018-06-22 01:08:02,742 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:08:02" (3/3) ... [2018-06-22 01:08:02,743 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:08:02,751 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:08:02,761 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:08:02,798 INFO ]: Using default assertion order modulation [2018-06-22 01:08:02,799 INFO ]: Interprodecural is true [2018-06-22 01:08:02,799 INFO ]: Hoare is false [2018-06-22 01:08:02,799 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:08:02,799 INFO ]: Backedges is TWOTRACK [2018-06-22 01:08:02,799 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:08:02,799 INFO ]: Difference is false [2018-06-22 01:08:02,799 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:08:02,799 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:08:02,813 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:08:02,823 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:08:02,823 INFO ]: Found error trace [2018-06-22 01:08:02,824 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:08:02,824 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:02,830 INFO ]: Analyzing trace with hash 2004253266, now seen corresponding path program 1 times [2018-06-22 01:08:02,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:02,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:02,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:02,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:02,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:02,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:02,919 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:08:02,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:02,921 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:08:02,923 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:08:02,939 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:08:02,939 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:08:02,942 INFO ]: Start difference. First operand 13 states. Second operand 2 states. [2018-06-22 01:08:02,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:02,963 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-22 01:08:02,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:08:02,964 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:08:02,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:02,978 INFO ]: With dead ends: 11 [2018-06-22 01:08:02,978 INFO ]: Without dead ends: 11 [2018-06-22 01:08:02,980 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:08:02,997 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:08:03,026 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:08:03,027 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:08:03,028 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-22 01:08:03,029 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2018-06-22 01:08:03,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:03,029 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-22 01:08:03,029 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:08:03,029 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-22 01:08:03,029 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:08:03,029 INFO ]: Found error trace [2018-06-22 01:08:03,029 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:03,030 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:03,030 INFO ]: Analyzing trace with hash -2331836, now seen corresponding path program 1 times [2018-06-22 01:08:03,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:03,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:03,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:03,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:03,134 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:08:03,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:03,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:08:03,135 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:08:03,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:08:03,136 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:08:03,136 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 3 states. [2018-06-22 01:08:03,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:03,194 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-22 01:08:03,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:08:03,195 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-22 01:08:03,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:03,195 INFO ]: With dead ends: 14 [2018-06-22 01:08:03,195 INFO ]: Without dead ends: 14 [2018-06-22 01:08:03,196 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:08:03,196 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:08:03,198 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:08:03,198 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:08:03,199 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:08:03,199 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-22 01:08:03,200 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:03,200 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:08:03,200 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:08:03,200 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:08:03,200 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:08:03,200 INFO ]: Found error trace [2018-06-22 01:08:03,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:03,201 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:03,201 INFO ]: Analyzing trace with hash 54926466, now seen corresponding path program 1 times [2018-06-22 01:08:03,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:03,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:03,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:03,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:03,368 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:08:03,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:03,368 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:08:03,368 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:08:03,369 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:08:03,369 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:08:03,369 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-22 01:08:03,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:03,638 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-22 01:08:03,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:08:03,639 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:08:03,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:03,640 INFO ]: With dead ends: 16 [2018-06-22 01:08:03,640 INFO ]: Without dead ends: 16 [2018-06-22 01:08:03,640 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:08:03,640 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:08:03,641 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:08:03,642 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:08:03,642 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:08:03,642 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-22 01:08:03,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:03,642 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:08:03,642 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:08:03,642 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:08:03,643 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:08:03,643 INFO ]: Found error trace [2018-06-22 01:08:03,643 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:03,643 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:03,643 INFO ]: Analyzing trace with hash -231365044, now seen corresponding path program 1 times [2018-06-22 01:08:03,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:03,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:03,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:03,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:03,770 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:08:03,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:03,770 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:08:03,770 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:08:03,770 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:08:03,770 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:08:03,771 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-22 01:08:03,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:03,828 INFO ]: Finished difference Result 20 states and 29 transitions. [2018-06-22 01:08:03,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:08:03,828 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:08:03,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:03,830 INFO ]: With dead ends: 20 [2018-06-22 01:08:03,830 INFO ]: Without dead ends: 20 [2018-06-22 01:08:03,831 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:08:03,831 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:08:03,833 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-06-22 01:08:03,833 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:08:03,834 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-22 01:08:03,834 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 10 [2018-06-22 01:08:03,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:03,834 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-22 01:08:03,834 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:08:03,834 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-22 01:08:03,834 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:08:03,834 INFO ]: Found error trace [2018-06-22 01:08:03,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:03,835 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:03,835 INFO ]: Analyzing trace with hash -116848440, now seen corresponding path program 1 times [2018-06-22 01:08:03,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:03,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:03,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:03,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:03,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:04,068 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:08:04,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:04,068 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:08:04,069 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:08:04,069 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:08:04,069 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:08:04,069 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 5 states. [2018-06-22 01:08:04,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:04,261 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-22 01:08:04,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:08:04,261 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:08:04,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:04,262 INFO ]: With dead ends: 17 [2018-06-22 01:08:04,262 INFO ]: Without dead ends: 17 [2018-06-22 01:08:04,262 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:08:04,262 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:08:04,263 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-22 01:08:04,264 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:08:04,264 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-22 01:08:04,264 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-22 01:08:04,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:04,264 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-22 01:08:04,264 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:08:04,264 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-22 01:08:04,265 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:08:04,265 INFO ]: Found error trace [2018-06-22 01:08:04,265 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:04,265 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:04,265 INFO ]: Analyzing trace with hash 1418446770, now seen corresponding path program 1 times [2018-06-22 01:08:04,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:04,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:04,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:04,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:04,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:04,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:04,399 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:08:04,399 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:04,399 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:08:04,399 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:08:04,399 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:08:04,399 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:08:04,399 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 6 states. [2018-06-22 01:08:04,728 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 01:08:04,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:04,964 INFO ]: Finished difference Result 27 states and 40 transitions. [2018-06-22 01:08:04,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:08:04,965 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:08:04,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:04,965 INFO ]: With dead ends: 27 [2018-06-22 01:08:04,965 INFO ]: Without dead ends: 25 [2018-06-22 01:08:04,966 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:08:04,966 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:08:04,968 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-06-22 01:08:04,968 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:08:04,969 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:08:04,969 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 11 [2018-06-22 01:08:04,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:04,969 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:08:04,969 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:08:04,969 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:08:04,969 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:08:04,969 INFO ]: Found error trace [2018-06-22 01:08:04,969 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:04,969 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:04,969 INFO ]: Analyzing trace with hash 673494198, now seen corresponding path program 1 times [2018-06-22 01:08:04,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:04,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:04,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:04,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:04,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:04,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:05,042 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:08:05,042 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:05,042 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:08:05,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:05,091 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:05,099 INFO ]: Computing forward predicates... [2018-06-22 01:08:05,180 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:08:05,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:05,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:08:05,202 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:08:05,202 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:08:05,202 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:08:05,202 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 6 states. [2018-06-22 01:08:05,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:05,257 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-22 01:08:05,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:08:05,257 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:08:05,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:05,258 INFO ]: With dead ends: 21 [2018-06-22 01:08:05,258 INFO ]: Without dead ends: 19 [2018-06-22 01:08:05,259 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:08:05,259 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:08:05,260 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 01:08:05,260 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:08:05,261 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:08:05,261 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 11 [2018-06-22 01:08:05,261 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:05,261 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:08:05,261 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:08:05,261 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:08:05,262 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:08:05,262 INFO ]: Found error trace [2018-06-22 01:08:05,262 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:05,262 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:05,262 INFO ]: Analyzing trace with hash -591396469, now seen corresponding path program 1 times [2018-06-22 01:08:05,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:05,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:05,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:05,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:05,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:05,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:05,348 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:08:05,349 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:05,349 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:08:05,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:05,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:05,389 INFO ]: Computing forward predicates... [2018-06-22 01:08:05,409 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:08:05,443 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:08:05,443 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2018-06-22 01:08:05,443 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:08:05,443 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:08:05,443 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:08:05,443 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 6 states. [2018-06-22 01:08:05,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:05,543 INFO ]: Finished difference Result 21 states and 30 transitions. [2018-06-22 01:08:05,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:08:05,543 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-22 01:08:05,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:05,543 INFO ]: With dead ends: 21 [2018-06-22 01:08:05,543 INFO ]: Without dead ends: 15 [2018-06-22 01:08:05,544 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:08:05,544 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:08:05,545 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:08:05,545 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:08:05,546 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-22 01:08:05,546 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 14 [2018-06-22 01:08:05,546 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:05,546 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-22 01:08:05,546 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:08:05,546 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-22 01:08:05,546 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:08:05,546 INFO ]: Found error trace [2018-06-22 01:08:05,546 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:05,546 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:05,546 INFO ]: Analyzing trace with hash -984423479, now seen corresponding path program 1 times [2018-06-22 01:08:05,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:05,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:05,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:05,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:05,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:05,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:05,658 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:05,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:05,658 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:08:05,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:05,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:05,701 INFO ]: Computing forward predicates... [2018-06-22 01:08:05,723 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:08:05,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:05,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2018-06-22 01:08:05,743 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:08:05,743 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:08:05,743 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:08:05,743 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 9 states. [2018-06-22 01:08:06,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:06,011 INFO ]: Finished difference Result 25 states and 36 transitions. [2018-06-22 01:08:06,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:08:06,011 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:08:06,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:06,011 INFO ]: With dead ends: 25 [2018-06-22 01:08:06,011 INFO ]: Without dead ends: 25 [2018-06-22 01:08:06,012 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:08:06,012 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:08:06,013 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-22 01:08:06,013 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:08:06,014 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-22 01:08:06,014 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 14 [2018-06-22 01:08:06,014 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:06,014 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-22 01:08:06,014 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:08:06,014 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-22 01:08:06,014 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:08:06,014 INFO ]: Found error trace [2018-06-22 01:08:06,014 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:06,014 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:06,014 INFO ]: Analyzing trace with hash 980711571, now seen corresponding path program 1 times [2018-06-22 01:08:06,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:06,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:06,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:06,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:06,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:06,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:06,111 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:06,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:06,111 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:08:06,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:06,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:06,139 INFO ]: Computing forward predicates... [2018-06-22 01:08:06,261 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:06,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:06,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:08:06,284 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:08:06,284 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:08:06,284 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:08:06,285 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 9 states. [2018-06-22 01:08:06,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:06,420 INFO ]: Finished difference Result 27 states and 34 transitions. [2018-06-22 01:08:06,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:08:06,421 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:08:06,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:06,421 INFO ]: With dead ends: 27 [2018-06-22 01:08:06,421 INFO ]: Without dead ends: 27 [2018-06-22 01:08:06,422 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:08:06,422 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:08:06,424 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 01:08:06,424 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:08:06,424 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 01:08:06,424 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2018-06-22 01:08:06,425 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:06,425 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 01:08:06,425 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:08:06,425 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 01:08:06,426 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:08:06,427 INFO ]: Found error trace [2018-06-22 01:08:06,427 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:06,427 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:06,427 INFO ]: Analyzing trace with hash 194657551, now seen corresponding path program 1 times [2018-06-22 01:08:06,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:06,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:06,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:06,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:06,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:06,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:06,586 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:06,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:06,587 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:08:06,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:06,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:06,617 INFO ]: Computing forward predicates... [2018-06-22 01:08:06,669 INFO ]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:08:06,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:06,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-06-22 01:08:06,689 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:08:06,689 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:08:06,689 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:08:06,689 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 12 states. [2018-06-22 01:08:07,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:07,325 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-22 01:08:07,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:08:07,326 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-22 01:08:07,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:07,326 INFO ]: With dead ends: 28 [2018-06-22 01:08:07,326 INFO ]: Without dead ends: 18 [2018-06-22 01:08:07,326 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:08:07,327 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:08:07,328 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-22 01:08:07,328 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:08:07,328 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-22 01:08:07,328 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-22 01:08:07,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:07,328 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-22 01:08:07,328 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:08:07,328 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-22 01:08:07,329 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:08:07,329 INFO ]: Found error trace [2018-06-22 01:08:07,329 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:07,329 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:07,329 INFO ]: Analyzing trace with hash 338116171, now seen corresponding path program 2 times [2018-06-22 01:08:07,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:07,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:07,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:07,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:07,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:07,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:07,469 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:08:07,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:07,469 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:08:07,487 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:08:07,513 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:08:07,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:07,516 INFO ]: Computing forward predicates... [2018-06-22 01:08:07,652 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:08:07,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:07,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 01:08:07,676 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:08:07,676 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:08:07,676 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:08:07,676 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-06-22 01:08:07,877 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 01:08:08,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:08,018 INFO ]: Finished difference Result 24 states and 26 transitions. [2018-06-22 01:08:08,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:08:08,018 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 01:08:08,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:08,018 INFO ]: With dead ends: 24 [2018-06-22 01:08:08,018 INFO ]: Without dead ends: 21 [2018-06-22 01:08:08,019 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:08:08,019 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:08:08,020 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 01:08:08,020 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:08:08,020 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 01:08:08,020 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-06-22 01:08:08,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:08,021 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 01:08:08,021 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:08:08,021 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 01:08:08,021 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:08:08,021 INFO ]: Found error trace [2018-06-22 01:08:08,021 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:08,021 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:08,021 INFO ]: Analyzing trace with hash -2103798100, now seen corresponding path program 3 times [2018-06-22 01:08:08,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:08,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:08,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:08,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:08,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:08,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:08,199 INFO ]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:08,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:08,199 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) [2018-06-22 01:08:08,221 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:08:08,304 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:08:08,304 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:08,307 INFO ]: Computing forward predicates... [2018-06-22 01:08:08,597 INFO ]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:08,630 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:08,630 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:08:08,630 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:08:08,630 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:08:08,630 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:08:08,630 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 13 states. [2018-06-22 01:08:08,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:08,881 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-22 01:08:08,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:08:08,882 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:08:08,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:08,882 INFO ]: With dead ends: 22 [2018-06-22 01:08:08,882 INFO ]: Without dead ends: 22 [2018-06-22 01:08:08,882 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:08:08,882 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:08:08,884 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 01:08:08,884 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:08:08,884 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-22 01:08:08,884 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-22 01:08:08,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:08,885 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-22 01:08:08,885 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:08:08,885 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-22 01:08:08,885 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:08:08,885 INFO ]: Found error trace [2018-06-22 01:08:08,885 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:08,885 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:08,885 INFO ]: Analyzing trace with hash -792403118, now seen corresponding path program 4 times [2018-06-22 01:08:08,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:08,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:08,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:08,886 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:08,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:08,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:09,698 INFO ]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:08:09,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:09,698 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:08:09,705 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:08:09,751 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:08:09,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:09,756 INFO ]: Computing forward predicates... [2018-06-22 01:08:09,896 INFO ]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:08:09,916 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:09,916 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:08:09,917 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:08:09,917 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:08:09,917 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:08:09,917 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2018-06-22 01:08:10,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:10,458 INFO ]: Finished difference Result 29 states and 31 transitions. [2018-06-22 01:08:10,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:08:10,458 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:08:10,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:10,458 INFO ]: With dead ends: 29 [2018-06-22 01:08:10,458 INFO ]: Without dead ends: 25 [2018-06-22 01:08:10,459 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:08:10,459 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:08:10,460 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 01:08:10,460 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:08:10,461 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 01:08:10,461 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2018-06-22 01:08:10,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:10,461 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 01:08:10,461 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:08:10,461 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 01:08:10,462 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:08:10,462 INFO ]: Found error trace [2018-06-22 01:08:10,462 INFO ]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:10,462 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:10,462 INFO ]: Analyzing trace with hash -1423760589, now seen corresponding path program 5 times [2018-06-22 01:08:10,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:10,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:10,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:10,463 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:10,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:10,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:10,628 INFO ]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:10,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:10,629 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:08:10,634 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:08:10,685 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:08:10,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:10,689 INFO ]: Computing forward predicates... [2018-06-22 01:08:10,740 INFO ]: Checked inductivity of 24 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:10,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:10,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 01:08:10,763 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:08:10,763 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:08:10,763 INFO ]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:08:10,763 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 17 states. [2018-06-22 01:08:11,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:11,014 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-22 01:08:11,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:08:11,014 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 01:08:11,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:11,015 INFO ]: With dead ends: 26 [2018-06-22 01:08:11,015 INFO ]: Without dead ends: 26 [2018-06-22 01:08:11,015 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:08:11,015 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:08:11,017 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 01:08:11,017 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:08:11,019 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-22 01:08:11,019 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-22 01:08:11,019 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:11,019 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-22 01:08:11,019 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:08:11,019 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-22 01:08:11,019 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:08:11,019 INFO ]: Found error trace [2018-06-22 01:08:11,019 INFO ]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:11,020 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:11,020 INFO ]: Analyzing trace with hash -1186076757, now seen corresponding path program 6 times [2018-06-22 01:08:11,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:11,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:11,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:11,021 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:11,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:11,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:11,413 INFO ]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:08:11,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:11,413 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:08:11,419 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:08:11,464 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:08:11,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:11,470 INFO ]: Computing forward predicates... [2018-06-22 01:08:11,700 INFO ]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:08:11,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:11,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-22 01:08:11,733 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:08:11,733 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:08:11,733 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:08:11,733 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2018-06-22 01:08:12,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:12,168 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-22 01:08:12,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:08:12,168 INFO ]: Start accepts. Automaton has 16 states. Word has length 23 [2018-06-22 01:08:12,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:12,169 INFO ]: With dead ends: 34 [2018-06-22 01:08:12,169 INFO ]: Without dead ends: 29 [2018-06-22 01:08:12,170 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:08:12,170 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:08:12,171 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 01:08:12,171 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:08:12,172 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:08:12,172 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2018-06-22 01:08:12,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:12,172 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:08:12,172 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:08:12,172 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:08:12,173 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:08:12,173 INFO ]: Found error trace [2018-06-22 01:08:12,173 INFO ]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:12,173 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:12,173 INFO ]: Analyzing trace with hash -1193849076, now seen corresponding path program 7 times [2018-06-22 01:08:12,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:12,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:12,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:12,174 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:12,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:12,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:13,201 INFO ]: Checked inductivity of 40 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:13,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:13,201 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:08:13,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:13,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:13,259 INFO ]: Computing forward predicates... [2018-06-22 01:08:13,306 INFO ]: Checked inductivity of 40 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:13,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:13,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-22 01:08:13,336 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:08:13,336 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:08:13,337 INFO ]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:08:13,337 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 21 states. [2018-06-22 01:08:13,863 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 01:08:14,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:14,083 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-22 01:08:14,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:08:14,083 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-22 01:08:14,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:14,083 INFO ]: With dead ends: 30 [2018-06-22 01:08:14,083 INFO ]: Without dead ends: 30 [2018-06-22 01:08:14,084 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=418, Invalid=988, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:08:14,084 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:08:14,085 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 01:08:14,085 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:08:14,086 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-22 01:08:14,086 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-22 01:08:14,086 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:14,086 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-22 01:08:14,086 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:08:14,086 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-22 01:08:14,086 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:08:14,086 INFO ]: Found error trace [2018-06-22 01:08:14,086 INFO ]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:14,086 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:14,086 INFO ]: Analyzing trace with hash 1646212850, now seen corresponding path program 8 times [2018-06-22 01:08:14,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:14,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:14,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:14,087 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:14,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:14,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:14,531 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:08:14,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:14,532 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:08:14,538 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:08:14,576 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:08:14,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:14,582 INFO ]: Computing forward predicates... [2018-06-22 01:08:14,840 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:08:14,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:14,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-22 01:08:14,860 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:08:14,861 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:08:14,861 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:08:14,861 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 19 states. [2018-06-22 01:08:15,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:15,464 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-22 01:08:15,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:08:15,465 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-22 01:08:15,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:15,465 INFO ]: With dead ends: 39 [2018-06-22 01:08:15,465 INFO ]: Without dead ends: 33 [2018-06-22 01:08:15,465 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:08:15,465 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:08:15,467 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 01:08:15,467 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:08:15,467 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 01:08:15,468 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2018-06-22 01:08:15,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:15,468 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 01:08:15,468 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:08:15,468 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 01:08:15,468 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:08:15,468 INFO ]: Found error trace [2018-06-22 01:08:15,468 INFO ]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:15,468 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:15,469 INFO ]: Analyzing trace with hash 636749267, now seen corresponding path program 9 times [2018-06-22 01:08:15,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:15,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:15,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:15,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:15,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:15,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:16,119 INFO ]: Checked inductivity of 60 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:16,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:16,120 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:08:16,125 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:08:16,212 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:08:16,212 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:16,217 INFO ]: Computing forward predicates... [2018-06-22 01:08:16,272 INFO ]: Checked inductivity of 60 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:16,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:16,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-22 01:08:16,298 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:08:16,298 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:08:16,298 INFO ]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:08:16,298 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 25 states. [2018-06-22 01:08:16,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:16,730 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-22 01:08:16,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:08:16,731 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-22 01:08:16,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:16,731 INFO ]: With dead ends: 34 [2018-06-22 01:08:16,731 INFO ]: Without dead ends: 34 [2018-06-22 01:08:16,732 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=1461, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:08:16,732 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:08:16,734 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 01:08:16,734 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:08:16,735 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:08:16,735 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-22 01:08:16,735 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:16,735 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:08:16,735 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:08:16,735 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:08:16,735 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:08:16,735 INFO ]: Found error trace [2018-06-22 01:08:16,736 INFO ]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:16,736 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:16,736 INFO ]: Analyzing trace with hash -1734780661, now seen corresponding path program 10 times [2018-06-22 01:08:16,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:16,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:16,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:16,736 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:16,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:16,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:17,314 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:08:17,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:17,314 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:08:17,320 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:08:17,366 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:08:17,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:17,373 INFO ]: Computing forward predicates... [2018-06-22 01:08:17,636 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:08:17,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:17,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-22 01:08:17,656 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:08:17,656 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:08:17,656 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:08:17,656 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 22 states. [2018-06-22 01:08:18,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:18,452 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-22 01:08:18,452 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:08:18,452 INFO ]: Start accepts. Automaton has 22 states. Word has length 31 [2018-06-22 01:08:18,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:18,452 INFO ]: With dead ends: 44 [2018-06-22 01:08:18,452 INFO ]: Without dead ends: 37 [2018-06-22 01:08:18,453 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=1491, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:08:18,453 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:08:18,455 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 01:08:18,455 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:08:18,456 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-22 01:08:18,456 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2018-06-22 01:08:18,462 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:18,462 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-22 01:08:18,462 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:08:18,462 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-22 01:08:18,463 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:08:18,463 INFO ]: Found error trace [2018-06-22 01:08:18,463 INFO ]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:18,463 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:18,463 INFO ]: Analyzing trace with hash -1246113940, now seen corresponding path program 11 times [2018-06-22 01:08:18,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:18,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:18,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:18,463 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:18,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:18,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:18,990 INFO ]: Checked inductivity of 84 backedges. 57 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:18,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:18,990 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:08:18,997 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:08:19,048 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:08:19,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:19,053 INFO ]: Computing forward predicates... [2018-06-22 01:08:19,122 INFO ]: Checked inductivity of 84 backedges. 63 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:19,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:19,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-22 01:08:19,155 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:08:19,155 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:08:19,155 INFO ]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:08:19,155 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 29 states. [2018-06-22 01:08:20,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:20,135 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-22 01:08:20,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:08:20,135 INFO ]: Start accepts. Automaton has 29 states. Word has length 34 [2018-06-22 01:08:20,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:20,135 INFO ]: With dead ends: 38 [2018-06-22 01:08:20,135 INFO ]: Without dead ends: 38 [2018-06-22 01:08:20,136 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=836, Invalid=2026, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:08:20,136 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:08:20,139 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 01:08:20,139 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:08:20,139 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-22 01:08:20,139 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-22 01:08:20,140 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:20,140 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-22 01:08:20,140 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:08:20,140 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-22 01:08:20,140 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:08:20,140 INFO ]: Found error trace [2018-06-22 01:08:20,140 INFO ]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:20,140 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:20,141 INFO ]: Analyzing trace with hash 26002066, now seen corresponding path program 12 times [2018-06-22 01:08:20,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:20,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:20,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:20,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:20,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:20,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:20,878 INFO ]: Checked inductivity of 91 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:08:20,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:20,878 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:08:20,884 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:08:20,940 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:08:20,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:20,947 INFO ]: Computing forward predicates... [2018-06-22 01:08:21,180 INFO ]: Checked inductivity of 91 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:08:21,201 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:21,201 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-22 01:08:21,201 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:08:21,201 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:08:21,201 INFO ]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:08:21,201 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 25 states. [2018-06-22 01:08:22,261 WARN ]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:08:22,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:22,765 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-22 01:08:22,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:08:22,767 INFO ]: Start accepts. Automaton has 25 states. Word has length 35 [2018-06-22 01:08:22,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:22,767 INFO ]: With dead ends: 49 [2018-06-22 01:08:22,767 INFO ]: Without dead ends: 41 [2018-06-22 01:08:22,768 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=1991, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:08:22,768 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:08:22,770 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-22 01:08:22,770 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:08:22,771 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-22 01:08:22,771 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2018-06-22 01:08:22,771 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:22,771 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-22 01:08:22,771 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:08:22,771 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-22 01:08:22,779 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:08:22,779 INFO ]: Found error trace [2018-06-22 01:08:22,779 INFO ]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:22,779 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:22,779 INFO ]: Analyzing trace with hash 316219507, now seen corresponding path program 13 times [2018-06-22 01:08:22,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:22,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:22,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:22,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:22,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:22,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:23,143 INFO ]: Checked inductivity of 112 backedges. 77 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:23,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:23,144 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:08:23,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:23,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:23,208 INFO ]: Computing forward predicates... [2018-06-22 01:08:23,571 INFO ]: Checked inductivity of 112 backedges. 84 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:23,595 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:23,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-22 01:08:23,595 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:08:23,596 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:08:23,596 INFO ]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:08:23,596 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 33 states. [2018-06-22 01:08:24,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:24,846 INFO ]: Finished difference Result 42 states and 43 transitions. [2018-06-22 01:08:24,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:08:24,846 INFO ]: Start accepts. Automaton has 33 states. Word has length 38 [2018-06-22 01:08:24,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:24,847 INFO ]: With dead ends: 42 [2018-06-22 01:08:24,847 INFO ]: Without dead ends: 42 [2018-06-22 01:08:24,848 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1099, Invalid=2683, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:08:24,848 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:08:24,850 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 01:08:24,850 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:08:24,850 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-22 01:08:24,850 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-22 01:08:24,851 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:24,851 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-22 01:08:24,851 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:08:24,854 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-22 01:08:24,855 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:08:24,855 INFO ]: Found error trace [2018-06-22 01:08:24,855 INFO ]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:24,855 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:24,855 INFO ]: Analyzing trace with hash 1213698667, now seen corresponding path program 14 times [2018-06-22 01:08:24,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:24,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:24,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:24,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:24,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:24,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:25,771 INFO ]: Checked inductivity of 120 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:08:25,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:25,788 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:08:25,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:08:25,889 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:08:25,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:25,899 INFO ]: Computing forward predicates... [2018-06-22 01:08:26,703 INFO ]: Checked inductivity of 120 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:08:26,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:26,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-22 01:08:26,724 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:08:26,724 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:08:26,724 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:08:26,725 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 28 states. [2018-06-22 01:08:27,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:27,846 INFO ]: Finished difference Result 54 states and 56 transitions. [2018-06-22 01:08:27,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:08:27,846 INFO ]: Start accepts. Automaton has 28 states. Word has length 39 [2018-06-22 01:08:27,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:27,846 INFO ]: With dead ends: 54 [2018-06-22 01:08:27,846 INFO ]: Without dead ends: 45 [2018-06-22 01:08:27,847 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=193, Invalid=2563, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:08:27,847 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:08:27,849 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-22 01:08:27,849 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:08:27,849 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-22 01:08:27,849 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2018-06-22 01:08:27,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:27,849 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-22 01:08:27,849 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:08:27,849 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-22 01:08:27,852 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:08:27,852 INFO ]: Found error trace [2018-06-22 01:08:27,852 INFO ]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:27,852 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:27,852 INFO ]: Analyzing trace with hash -24111156, now seen corresponding path program 15 times [2018-06-22 01:08:27,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:27,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:27,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:27,853 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:27,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:27,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:29,088 INFO ]: Checked inductivity of 144 backedges. 100 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:29,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:29,088 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:08:29,094 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:08:29,204 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:08:29,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:29,209 INFO ]: Computing forward predicates... [2018-06-22 01:08:29,262 INFO ]: Checked inductivity of 144 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:29,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:29,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-22 01:08:29,282 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:08:29,282 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:08:29,282 INFO ]: CoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:08:29,282 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 37 states. [2018-06-22 01:08:30,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:30,128 INFO ]: Finished difference Result 46 states and 47 transitions. [2018-06-22 01:08:30,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:08:30,129 INFO ]: Start accepts. Automaton has 37 states. Word has length 42 [2018-06-22 01:08:30,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:30,130 INFO ]: With dead ends: 46 [2018-06-22 01:08:30,130 INFO ]: Without dead ends: 46 [2018-06-22 01:08:30,130 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1398, Invalid=3432, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:08:30,131 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:08:30,132 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 01:08:30,132 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:08:30,133 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-06-22 01:08:30,133 INFO ]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-06-22 01:08:30,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:30,133 INFO ]: Abstraction has 44 states and 45 transitions. [2018-06-22 01:08:30,133 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:08:30,133 INFO ]: Start isEmpty. Operand 44 states and 45 transitions. [2018-06-22 01:08:30,134 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:08:30,134 INFO ]: Found error trace [2018-06-22 01:08:30,134 INFO ]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:30,134 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:30,134 INFO ]: Analyzing trace with hash -746617294, now seen corresponding path program 16 times [2018-06-22 01:08:30,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:30,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:30,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:30,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:30,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:30,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:30,784 INFO ]: Checked inductivity of 153 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:08:30,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:30,810 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:08:30,817 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:08:30,884 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:08:30,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:30,894 INFO ]: Computing forward predicates... [2018-06-22 01:08:31,284 INFO ]: Checked inductivity of 153 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:08:31,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:31,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-22 01:08:31,304 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:08:31,304 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:08:31,305 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:08:31,305 INFO ]: Start difference. First operand 44 states and 45 transitions. Second operand 31 states. [2018-06-22 01:08:32,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:32,707 INFO ]: Finished difference Result 59 states and 61 transitions. [2018-06-22 01:08:32,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:08:32,710 INFO ]: Start accepts. Automaton has 31 states. Word has length 43 [2018-06-22 01:08:32,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:32,711 INFO ]: With dead ends: 59 [2018-06-22 01:08:32,711 INFO ]: Without dead ends: 49 [2018-06-22 01:08:32,711 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=215, Invalid=3207, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:08:32,712 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:08:32,718 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 01:08:32,718 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:08:32,719 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-06-22 01:08:32,719 INFO ]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2018-06-22 01:08:32,719 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:32,719 INFO ]: Abstraction has 47 states and 48 transitions. [2018-06-22 01:08:32,719 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:08:32,719 INFO ]: Start isEmpty. Operand 47 states and 48 transitions. [2018-06-22 01:08:32,719 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:08:32,719 INFO ]: Found error trace [2018-06-22 01:08:32,719 INFO ]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:32,719 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:32,720 INFO ]: Analyzing trace with hash 88371987, now seen corresponding path program 17 times [2018-06-22 01:08:32,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:32,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:32,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:32,720 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:32,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:32,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:33,282 INFO ]: Checked inductivity of 180 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:33,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:33,282 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:08:33,288 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:08:33,362 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:08:33,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:33,369 INFO ]: Computing forward predicates... [2018-06-22 01:08:33,426 INFO ]: Checked inductivity of 180 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:33,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:33,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-22 01:08:33,446 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:08:33,446 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:08:33,447 INFO ]: CoverageRelationStatistics Valid=242, Invalid=1398, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:08:33,447 INFO ]: Start difference. First operand 47 states and 48 transitions. Second operand 41 states. [2018-06-22 01:08:34,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:34,480 INFO ]: Finished difference Result 50 states and 51 transitions. [2018-06-22 01:08:34,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:08:34,481 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-22 01:08:34,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:34,481 INFO ]: With dead ends: 50 [2018-06-22 01:08:34,481 INFO ]: Without dead ends: 50 [2018-06-22 01:08:34,482 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1733, Invalid=4273, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 01:08:34,482 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:08:34,484 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 01:08:34,484 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:08:34,484 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-06-22 01:08:34,484 INFO ]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-06-22 01:08:34,484 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:34,484 INFO ]: Abstraction has 48 states and 49 transitions. [2018-06-22 01:08:34,484 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:08:34,484 INFO ]: Start isEmpty. Operand 48 states and 49 transitions. [2018-06-22 01:08:34,485 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:08:34,485 INFO ]: Found error trace [2018-06-22 01:08:34,485 INFO ]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:34,485 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:34,485 INFO ]: Analyzing trace with hash -1554607157, now seen corresponding path program 18 times [2018-06-22 01:08:34,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:34,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:34,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:34,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:34,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:34,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:35,206 INFO ]: Checked inductivity of 190 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:08:35,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:35,206 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:08:35,211 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:08:35,292 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 01:08:35,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:35,300 INFO ]: Computing forward predicates... [2018-06-22 01:08:35,672 INFO ]: Checked inductivity of 190 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:08:35,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:35,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-22 01:08:35,692 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:08:35,692 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:08:35,692 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:08:35,692 INFO ]: Start difference. First operand 48 states and 49 transitions. Second operand 34 states. [2018-06-22 01:08:37,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:37,289 INFO ]: Finished difference Result 64 states and 66 transitions. [2018-06-22 01:08:37,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:08:37,289 INFO ]: Start accepts. Automaton has 34 states. Word has length 47 [2018-06-22 01:08:37,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:37,289 INFO ]: With dead ends: 64 [2018-06-22 01:08:37,289 INFO ]: Without dead ends: 53 [2018-06-22 01:08:37,290 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=237, Invalid=3923, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:08:37,290 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:08:37,291 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-06-22 01:08:37,291 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:08:37,292 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-06-22 01:08:37,292 INFO ]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2018-06-22 01:08:37,292 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:37,292 INFO ]: Abstraction has 51 states and 52 transitions. [2018-06-22 01:08:37,292 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:08:37,292 INFO ]: Start isEmpty. Operand 51 states and 52 transitions. [2018-06-22 01:08:37,292 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 01:08:37,292 INFO ]: Found error trace [2018-06-22 01:08:37,293 INFO ]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:37,293 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:37,293 INFO ]: Analyzing trace with hash 1562912812, now seen corresponding path program 19 times [2018-06-22 01:08:37,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:37,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:37,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:37,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:37,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:37,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:38,375 INFO ]: Checked inductivity of 220 backedges. 155 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:38,376 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:38,376 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:08:38,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:38,455 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:38,460 INFO ]: Computing forward predicates... [2018-06-22 01:08:39,076 INFO ]: Checked inductivity of 220 backedges. 165 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:39,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:39,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-06-22 01:08:39,096 INFO ]: Interpolant automaton has 45 states [2018-06-22 01:08:39,096 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-22 01:08:39,097 INFO ]: CoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:08:39,097 INFO ]: Start difference. First operand 51 states and 52 transitions. Second operand 45 states. [2018-06-22 01:08:40,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:40,361 INFO ]: Finished difference Result 54 states and 55 transitions. [2018-06-22 01:08:40,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:08:40,361 INFO ]: Start accepts. Automaton has 45 states. Word has length 50 [2018-06-22 01:08:40,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:40,361 INFO ]: With dead ends: 54 [2018-06-22 01:08:40,361 INFO ]: Without dead ends: 54 [2018-06-22 01:08:40,363 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2104, Invalid=5206, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 01:08:40,363 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:08:40,364 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 01:08:40,364 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:08:40,365 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-06-22 01:08:40,365 INFO ]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-06-22 01:08:40,365 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:40,365 INFO ]: Abstraction has 52 states and 53 transitions. [2018-06-22 01:08:40,365 INFO ]: Interpolant automaton has 45 states. [2018-06-22 01:08:40,365 INFO ]: Start isEmpty. Operand 52 states and 53 transitions. [2018-06-22 01:08:40,366 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-22 01:08:40,366 INFO ]: Found error trace [2018-06-22 01:08:40,366 INFO ]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:40,366 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:40,366 INFO ]: Analyzing trace with hash 1206485458, now seen corresponding path program 20 times [2018-06-22 01:08:40,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:40,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:40,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:40,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:40,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:40,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:41,479 INFO ]: Checked inductivity of 231 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:08:41,480 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:41,480 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:08:41,486 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:08:41,561 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:08:41,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:41,569 INFO ]: Computing forward predicates... [2018-06-22 01:08:42,020 INFO ]: Checked inductivity of 231 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:08:42,039 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:42,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-22 01:08:42,040 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:08:42,040 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:08:42,040 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:08:42,040 INFO ]: Start difference. First operand 52 states and 53 transitions. Second operand 37 states. [2018-06-22 01:08:44,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:44,868 INFO ]: Finished difference Result 69 states and 71 transitions. [2018-06-22 01:08:44,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:08:44,869 INFO ]: Start accepts. Automaton has 37 states. Word has length 51 [2018-06-22 01:08:44,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:44,870 INFO ]: With dead ends: 69 [2018-06-22 01:08:44,870 INFO ]: Without dead ends: 57 [2018-06-22 01:08:44,871 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=259, Invalid=4711, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:08:44,871 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:08:44,872 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 01:08:44,872 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:08:44,873 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-06-22 01:08:44,873 INFO ]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2018-06-22 01:08:44,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:44,873 INFO ]: Abstraction has 55 states and 56 transitions. [2018-06-22 01:08:44,873 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:08:44,873 INFO ]: Start isEmpty. Operand 55 states and 56 transitions. [2018-06-22 01:08:44,873 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-22 01:08:44,873 INFO ]: Found error trace [2018-06-22 01:08:44,874 INFO ]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:44,874 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:44,874 INFO ]: Analyzing trace with hash -601358925, now seen corresponding path program 21 times [2018-06-22 01:08:44,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:44,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:44,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:44,874 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:44,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:44,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:46,147 INFO ]: Checked inductivity of 264 backedges. 187 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:46,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:46,147 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:08:46,153 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:08:46,265 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 01:08:46,265 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:46,271 INFO ]: Computing forward predicates... [2018-06-22 01:08:46,313 INFO ]: Checked inductivity of 264 backedges. 198 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:46,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:46,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-06-22 01:08:46,337 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:08:46,337 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:08:46,337 INFO ]: CoverageRelationStatistics Valid=338, Invalid=2014, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:08:46,337 INFO ]: Start difference. First operand 55 states and 56 transitions. Second operand 49 states. [2018-06-22 01:08:47,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:47,815 INFO ]: Finished difference Result 58 states and 59 transitions. [2018-06-22 01:08:47,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:08:47,816 INFO ]: Start accepts. Automaton has 49 states. Word has length 54 [2018-06-22 01:08:47,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:47,816 INFO ]: With dead ends: 58 [2018-06-22 01:08:47,816 INFO ]: Without dead ends: 58 [2018-06-22 01:08:47,816 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2511, Invalid=6231, Unknown=0, NotChecked=0, Total=8742 [2018-06-22 01:08:47,817 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:08:47,818 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 01:08:47,818 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:08:47,818 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-06-22 01:08:47,818 INFO ]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-06-22 01:08:47,818 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:47,818 INFO ]: Abstraction has 56 states and 57 transitions. [2018-06-22 01:08:47,818 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:08:47,818 INFO ]: Start isEmpty. Operand 56 states and 57 transitions. [2018-06-22 01:08:47,819 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-22 01:08:47,819 INFO ]: Found error trace [2018-06-22 01:08:47,819 INFO ]: trace histogram [12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:47,819 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:47,819 INFO ]: Analyzing trace with hash -1461428949, now seen corresponding path program 22 times [2018-06-22 01:08:47,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:47,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:47,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:47,819 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:47,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:47,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:49,026 INFO ]: Checked inductivity of 276 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 01:08:49,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:49,027 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:08:49,033 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:08:49,116 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:08:49,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:49,128 INFO ]: Computing forward predicates... [2018-06-22 01:08:49,755 INFO ]: Checked inductivity of 276 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-22 01:08:49,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:49,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-22 01:08:49,775 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:08:49,775 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:08:49,775 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:08:49,775 INFO ]: Start difference. First operand 56 states and 57 transitions. Second operand 40 states. [2018-06-22 01:08:52,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:52,404 INFO ]: Finished difference Result 74 states and 76 transitions. [2018-06-22 01:08:52,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:08:52,405 INFO ]: Start accepts. Automaton has 40 states. Word has length 55 [2018-06-22 01:08:52,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:52,405 INFO ]: With dead ends: 74 [2018-06-22 01:08:52,405 INFO ]: Without dead ends: 61 [2018-06-22 01:08:52,406 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=281, Invalid=5571, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 01:08:52,406 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:08:52,407 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-06-22 01:08:52,407 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:08:52,407 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-06-22 01:08:52,407 INFO ]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2018-06-22 01:08:52,408 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:52,408 INFO ]: Abstraction has 59 states and 60 transitions. [2018-06-22 01:08:52,408 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:08:52,408 INFO ]: Start isEmpty. Operand 59 states and 60 transitions. [2018-06-22 01:08:52,408 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-22 01:08:52,408 INFO ]: Found error trace [2018-06-22 01:08:52,408 INFO ]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:52,408 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:52,408 INFO ]: Analyzing trace with hash -1076887412, now seen corresponding path program 23 times [2018-06-22 01:08:52,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:52,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:52,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:52,409 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:52,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:52,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:53,331 INFO ]: Checked inductivity of 312 backedges. 222 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:53,331 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:53,331 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:08:53,338 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:08:53,498 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-22 01:08:53,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:53,510 INFO ]: Computing forward predicates... [2018-06-22 01:08:53,580 INFO ]: Checked inductivity of 312 backedges. 234 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:53,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:53,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-06-22 01:08:53,603 INFO ]: Interpolant automaton has 53 states [2018-06-22 01:08:53,603 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-22 01:08:53,604 INFO ]: CoverageRelationStatistics Valid=392, Invalid=2364, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:08:53,604 INFO ]: Start difference. First operand 59 states and 60 transitions. Second operand 53 states. [2018-06-22 01:08:55,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:55,350 INFO ]: Finished difference Result 62 states and 63 transitions. [2018-06-22 01:08:55,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 01:08:55,350 INFO ]: Start accepts. Automaton has 53 states. Word has length 58 [2018-06-22 01:08:55,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:55,351 INFO ]: With dead ends: 62 [2018-06-22 01:08:55,351 INFO ]: Without dead ends: 62 [2018-06-22 01:08:55,352 INFO ]: 0 DeclaredPredicates, 160 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2954, Invalid=7348, Unknown=0, NotChecked=0, Total=10302 [2018-06-22 01:08:55,352 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:08:55,353 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-06-22 01:08:55,353 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:08:55,354 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-06-22 01:08:55,354 INFO ]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-06-22 01:08:55,354 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:55,354 INFO ]: Abstraction has 60 states and 61 transitions. [2018-06-22 01:08:55,354 INFO ]: Interpolant automaton has 53 states. [2018-06-22 01:08:55,354 INFO ]: Start isEmpty. Operand 60 states and 61 transitions. [2018-06-22 01:08:55,354 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-22 01:08:55,354 INFO ]: Found error trace [2018-06-22 01:08:55,354 INFO ]: trace histogram [13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:55,354 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:55,355 INFO ]: Analyzing trace with hash 977057138, now seen corresponding path program 24 times [2018-06-22 01:08:55,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:55,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:55,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:55,355 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:08:55,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:55,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:57,282 INFO ]: Checked inductivity of 325 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 01:08:57,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:08:57,282 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:08:57,289 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:08:57,409 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-22 01:08:57,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:57,424 INFO ]: Computing forward predicates... [2018-06-22 01:08:58,224 INFO ]: Checked inductivity of 325 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 01:08:58,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:08:58,246 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-06-22 01:08:58,246 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:08:58,246 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:08:58,246 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:08:58,246 INFO ]: Start difference. First operand 60 states and 61 transitions. Second operand 43 states. [2018-06-22 01:08:58,777 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-06-22 01:09:00,644 WARN ]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:09:03,291 WARN ]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2018-06-22 01:09:03,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:03,993 INFO ]: Finished difference Result 79 states and 81 transitions. [2018-06-22 01:09:03,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:09:03,993 INFO ]: Start accepts. Automaton has 43 states. Word has length 59 [2018-06-22 01:09:03,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:03,993 INFO ]: With dead ends: 79 [2018-06-22 01:09:03,993 INFO ]: Without dead ends: 65 [2018-06-22 01:09:03,994 INFO ]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=303, Invalid=6503, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 01:09:03,994 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:09:03,996 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-06-22 01:09:03,996 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:09:03,996 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-06-22 01:09:03,996 INFO ]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2018-06-22 01:09:03,996 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:03,997 INFO ]: Abstraction has 63 states and 64 transitions. [2018-06-22 01:09:03,997 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:09:03,997 INFO ]: Start isEmpty. Operand 63 states and 64 transitions. [2018-06-22 01:09:03,997 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-22 01:09:03,997 INFO ]: Found error trace [2018-06-22 01:09:03,997 INFO ]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:03,997 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:03,997 INFO ]: Analyzing trace with hash -503988141, now seen corresponding path program 25 times [2018-06-22 01:09:03,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:03,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:03,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:03,998 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:03,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:04,036 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:09:04,676 WARN ]: Verification canceled [2018-06-22 01:09:04,803 WARN ]: Timeout [2018-06-22 01:09:04,803 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:09:04 BoogieIcfgContainer [2018-06-22 01:09:04,803 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:09:04,804 INFO ]: Toolchain (without parser) took 62522.10 ms. Allocated memory was 305.7 MB in the beginning and 783.3 MB in the end (delta: 477.6 MB). Free memory was 260.0 MB in the beginning and 755.2 MB in the end (delta: -495.2 MB). Peak memory consumption was 56.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:09:04,806 INFO ]: SmtParser took 0.14 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:09:04,806 INFO ]: ChcToBoogie took 65.74 ms. Allocated memory is still 305.7 MB. Free memory was 260.0 MB in the beginning and 258.0 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:09:04,806 INFO ]: Boogie Preprocessor took 34.50 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 256.0 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:09:04,807 INFO ]: RCFGBuilder took 342.83 ms. Allocated memory is still 305.7 MB. Free memory was 256.0 MB in the beginning and 246.0 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:09:04,807 INFO ]: TraceAbstraction took 62068.11 ms. Allocated memory was 305.7 MB in the beginning and 783.3 MB in the end (delta: 477.6 MB). Free memory was 246.0 MB in the beginning and 755.2 MB in the end (delta: -509.2 MB). Peak memory consumption was 42.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:09:04,810 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.14 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.74 ms. Allocated memory is still 305.7 MB. Free memory was 260.0 MB in the beginning and 258.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.50 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 256.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 342.83 ms. Allocated memory is still 305.7 MB. Free memory was 256.0 MB in the beginning and 246.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62068.11 ms. Allocated memory was 305.7 MB in the beginning and 783.3 MB in the end (delta: 477.6 MB). Free memory was 246.0 MB in the beginning and 755.2 MB in the end (delta: -509.2 MB). Peak memory consumption was 42.4 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 63 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 62.0s OverallTime, 35 OverallIterations, 14 TraceHistogramMax, 32.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 367 SDtfs, 1052 SDslu, 3650 SDs, 0 SdLazy, 12412 SolverSat, 3207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2381 GetRequests, 934 SyntacticMatches, 132 SemanticMatches, 1315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10601 ImplicationChecksByTransitivity, 42.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 93 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 695374 SizeOfPredicates, 1647 NumberOfNonLiveVariables, 12553 ConjunctsInSsa, 4523 ConjunctsInUnsatCore, 62 InterpolantComputations, 7 PerfectInterpolantSequences, 3032/6031 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/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-09-04-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe2-big2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-09-04-822.csv Completed graceful shutdown