java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:50:49,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:50:49,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:50:49,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:50:49,856 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:50:49,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:50:49,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:50:49,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:50:49,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:50:49,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:50:49,866 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:50:49,866 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:50:49,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:50:49,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:50:49,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:50:49,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:50:49,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:50:49,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:50:49,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:50:49,886 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:50:49,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:50:49,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:50:49,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:50:49,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:50:49,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:50:49,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:50:49,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:50:49,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:50:49,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:50:49,894 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:50:49,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:50:49,895 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:50:49,895 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:50:49,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:50:49,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:50:49,898 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:50:49,911 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:50:49,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:50:49,912 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:50:49,912 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:50:49,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:50:49,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:50:49,913 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:50:49,913 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:50:49,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:50:49,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:50:49,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:50:49,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:50:49,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:50:49,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:50:49,914 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:50:49,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:50:49,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:50:49,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:50:49,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:50:49,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:50:49,916 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:50:49,917 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:50:49,917 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:50:49,960 INFO ]: Repository-Root is: /tmp [2018-06-25 09:50:49,974 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:50:49,977 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:50:49,979 INFO ]: Initializing SmtParser... [2018-06-25 09:50:49,979 INFO ]: SmtParser initialized [2018-06-25 09:50:49,980 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-25 09:50:49,981 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:50:50,077 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@606a01bc [2018-06-25 09:50:50,333 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-25 09:50:50,337 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:50:50,343 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:50:50,344 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:50:50,344 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:50:50,344 INFO ]: ChcToBoogie initialized [2018-06-25 09:50:50,347 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,411 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50 Unit [2018-06-25 09:50:50,411 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:50:50,412 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:50:50,412 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:50:50,412 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:50:50,429 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,429 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,435 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,435 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,439 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,441 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,442 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (1/1) ... [2018-06-25 09:50:50,444 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:50:50,445 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:50:50,445 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:50:50,445 INFO ]: RCFGBuilder initialized [2018-06-25 09:50:50,446 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (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-25 09:50:50,457 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:50:50,457 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:50:50,457 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:50:50,457 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:50:50,457 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:50:50,457 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 09:50:50,829 INFO ]: Using library mode [2018-06-25 09:50:50,829 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:50 BoogieIcfgContainer [2018-06-25 09:50:50,829 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:50:50,830 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:50:50,831 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:50:50,834 INFO ]: TraceAbstraction initialized [2018-06-25 09:50:50,834 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:50" (1/3) ... [2018-06-25 09:50:50,835 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d53d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:50:50, skipping insertion in model container [2018-06-25 09:50:50,835 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:50" (2/3) ... [2018-06-25 09:50:50,835 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d53d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:50:50, skipping insertion in model container [2018-06-25 09:50:50,835 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:50" (3/3) ... [2018-06-25 09:50:50,837 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:50:50,846 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:50:50,852 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:50:50,894 INFO ]: Using default assertion order modulation [2018-06-25 09:50:50,895 INFO ]: Interprodecural is true [2018-06-25 09:50:50,895 INFO ]: Hoare is false [2018-06-25 09:50:50,895 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:50:50,895 INFO ]: Backedges is TWOTRACK [2018-06-25 09:50:50,895 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:50:50,895 INFO ]: Difference is false [2018-06-25 09:50:50,895 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:50:50,895 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:50:50,909 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:50:50,920 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:50:50,920 INFO ]: Found error trace [2018-06-25 09:50:50,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:50,921 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:50,927 INFO ]: Analyzing trace with hash -1121097302, now seen corresponding path program 1 times [2018-06-25 09:50:50,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:50,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:50,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:50,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:50,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:51,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:51,191 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:51,195 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:51,195 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:50:51,197 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:51,209 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:51,209 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:51,211 INFO ]: Start difference. First operand 13 states. Second operand 6 states. [2018-06-25 09:50:51,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:51,806 INFO ]: Finished difference Result 24 states and 61 transitions. [2018-06-25 09:50:51,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:51,807 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-25 09:50:51,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:51,817 INFO ]: With dead ends: 24 [2018-06-25 09:50:51,817 INFO ]: Without dead ends: 23 [2018-06-25 09:50:51,819 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:51,836 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:50:51,855 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-06-25 09:50:51,857 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:50:51,857 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-06-25 09:50:51,858 INFO ]: Start accepts. Automaton has 14 states and 33 transitions. Word has length 10 [2018-06-25 09:50:51,859 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:51,859 INFO ]: Abstraction has 14 states and 33 transitions. [2018-06-25 09:50:51,859 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:51,860 INFO ]: Start isEmpty. Operand 14 states and 33 transitions. [2018-06-25 09:50:51,860 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:51,860 INFO ]: Found error trace [2018-06-25 09:50:51,860 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:51,860 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:51,860 INFO ]: Analyzing trace with hash 765728508, now seen corresponding path program 1 times [2018-06-25 09:50:51,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:51,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:51,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:51,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:51,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:51,882 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:51,939 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:51,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:51,939 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:50:51,940 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:51,940 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:51,940 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:51,941 INFO ]: Start difference. First operand 14 states and 33 transitions. Second operand 5 states. [2018-06-25 09:50:52,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:52,169 INFO ]: Finished difference Result 21 states and 53 transitions. [2018-06-25 09:50:52,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:52,170 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:50:52,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:52,170 INFO ]: With dead ends: 21 [2018-06-25 09:50:52,171 INFO ]: Without dead ends: 21 [2018-06-25 09:50:52,171 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:52,171 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:50:52,174 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-25 09:50:52,174 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:50:52,175 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2018-06-25 09:50:52,175 INFO ]: Start accepts. Automaton has 17 states and 43 transitions. Word has length 11 [2018-06-25 09:50:52,175 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:52,175 INFO ]: Abstraction has 17 states and 43 transitions. [2018-06-25 09:50:52,175 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:52,175 INFO ]: Start isEmpty. Operand 17 states and 43 transitions. [2018-06-25 09:50:52,176 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:52,176 INFO ]: Found error trace [2018-06-25 09:50:52,176 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:52,176 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:52,176 INFO ]: Analyzing trace with hash -1561049264, now seen corresponding path program 1 times [2018-06-25 09:50:52,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:52,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:52,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:52,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,197 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:52,267 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:52,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:52,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:52,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:52,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:52,333 INFO ]: Computing forward predicates... [2018-06-25 09:50:52,352 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:52,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:52,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 09:50:52,384 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:52,384 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:52,384 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:52,385 INFO ]: Start difference. First operand 17 states and 43 transitions. Second operand 5 states. [2018-06-25 09:50:52,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:52,782 INFO ]: Finished difference Result 23 states and 59 transitions. [2018-06-25 09:50:52,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:52,784 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:50:52,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:52,784 INFO ]: With dead ends: 23 [2018-06-25 09:50:52,784 INFO ]: Without dead ends: 21 [2018-06-25 09:50:52,785 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:52,785 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:50:52,788 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-25 09:50:52,789 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:50:52,789 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 39 transitions. [2018-06-25 09:50:52,789 INFO ]: Start accepts. Automaton has 17 states and 39 transitions. Word has length 11 [2018-06-25 09:50:52,789 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:52,789 INFO ]: Abstraction has 17 states and 39 transitions. [2018-06-25 09:50:52,789 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:52,789 INFO ]: Start isEmpty. Operand 17 states and 39 transitions. [2018-06-25 09:50:52,790 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:52,790 INFO ]: Found error trace [2018-06-25 09:50:52,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:52,790 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:52,790 INFO ]: Analyzing trace with hash 1988965460, now seen corresponding path program 1 times [2018-06-25 09:50:52,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:52,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:52,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:52,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:52,985 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:52,985 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:52,985 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:52,985 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:52,985 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:52,985 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:52,985 INFO ]: Start difference. First operand 17 states and 39 transitions. Second operand 4 states. [2018-06-25 09:50:53,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:53,134 INFO ]: Finished difference Result 26 states and 63 transitions. [2018-06-25 09:50:53,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:53,134 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:50:53,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:53,135 INFO ]: With dead ends: 26 [2018-06-25 09:50:53,135 INFO ]: Without dead ends: 26 [2018-06-25 09:50:53,136 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:53,136 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:50:53,138 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-25 09:50:53,138 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:50:53,139 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-06-25 09:50:53,139 INFO ]: Start accepts. Automaton has 21 states and 50 transitions. Word has length 11 [2018-06-25 09:50:53,139 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:53,139 INFO ]: Abstraction has 21 states and 50 transitions. [2018-06-25 09:50:53,139 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:53,139 INFO ]: Start isEmpty. Operand 21 states and 50 transitions. [2018-06-25 09:50:53,140 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:53,140 INFO ]: Found error trace [2018-06-25 09:50:53,140 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:53,140 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:53,140 INFO ]: Analyzing trace with hash -301961266, now seen corresponding path program 1 times [2018-06-25 09:50:53,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:53,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:53,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:53,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,152 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,323 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:53,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:53,324 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:53,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:53,354 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,356 INFO ]: Computing forward predicates... [2018-06-25 09:50:53,362 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:53,391 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:53,391 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:50:53,391 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:53,392 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:53,392 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:53,392 INFO ]: Start difference. First operand 21 states and 50 transitions. Second operand 6 states. [2018-06-25 09:50:53,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:53,491 INFO ]: Finished difference Result 28 states and 69 transitions. [2018-06-25 09:50:53,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:53,491 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 09:50:53,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:53,492 INFO ]: With dead ends: 28 [2018-06-25 09:50:53,492 INFO ]: Without dead ends: 26 [2018-06-25 09:50:53,492 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:53,492 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:50:53,495 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-25 09:50:53,495 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:50:53,496 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 48 transitions. [2018-06-25 09:50:53,496 INFO ]: Start accepts. Automaton has 21 states and 48 transitions. Word has length 11 [2018-06-25 09:50:53,496 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:53,496 INFO ]: Abstraction has 21 states and 48 transitions. [2018-06-25 09:50:53,496 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:53,496 INFO ]: Start isEmpty. Operand 21 states and 48 transitions. [2018-06-25 09:50:53,496 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:53,496 INFO ]: Found error trace [2018-06-25 09:50:53,496 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:53,496 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:53,497 INFO ]: Analyzing trace with hash -187444662, now seen corresponding path program 1 times [2018-06-25 09:50:53,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:53,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,510 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,559 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:53,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:53,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:53,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:53,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,585 INFO ]: Computing forward predicates... [2018-06-25 09:50:53,628 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:53,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:53,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-25 09:50:53,648 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:50:53,648 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:50:53,648 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:53,648 INFO ]: Start difference. First operand 21 states and 48 transitions. Second operand 8 states. [2018-06-25 09:50:53,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:53,927 INFO ]: Finished difference Result 46 states and 111 transitions. [2018-06-25 09:50:53,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:50:53,928 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 09:50:53,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:53,929 INFO ]: With dead ends: 46 [2018-06-25 09:50:53,929 INFO ]: Without dead ends: 34 [2018-06-25 09:50:53,929 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:50:53,929 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:50:53,935 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-06-25 09:50:53,935 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:50:53,936 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2018-06-25 09:50:53,936 INFO ]: Start accepts. Automaton has 26 states and 56 transitions. Word has length 11 [2018-06-25 09:50:53,936 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:53,936 INFO ]: Abstraction has 26 states and 56 transitions. [2018-06-25 09:50:53,936 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:50:53,936 INFO ]: Start isEmpty. Operand 26 states and 56 transitions. [2018-06-25 09:50:53,936 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:53,936 INFO ]: Found error trace [2018-06-25 09:50:53,936 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:53,936 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:53,936 INFO ]: Analyzing trace with hash 1575075134, now seen corresponding path program 1 times [2018-06-25 09:50:53,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:53,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:53,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:53,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,955 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:54,083 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:54,083 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:54,083 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:54,083 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:54,083 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:54,083 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:54,083 INFO ]: Start difference. First operand 26 states and 56 transitions. Second operand 4 states. [2018-06-25 09:50:54,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:54,168 INFO ]: Finished difference Result 28 states and 57 transitions. [2018-06-25 09:50:54,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:54,169 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:50:54,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:54,169 INFO ]: With dead ends: 28 [2018-06-25 09:50:54,169 INFO ]: Without dead ends: 28 [2018-06-25 09:50:54,169 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:54,170 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:50:54,172 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-06-25 09:50:54,172 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:50:54,173 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-25 09:50:54,173 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 11 [2018-06-25 09:50:54,173 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:54,173 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-25 09:50:54,173 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:54,173 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-25 09:50:54,173 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:54,173 INFO ]: Found error trace [2018-06-25 09:50:54,173 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:54,174 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:54,174 INFO ]: Analyzing trace with hash -1939903300, now seen corresponding path program 1 times [2018-06-25 09:50:54,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:54,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:54,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:54,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:54,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:54,190 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:54,456 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:54,456 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:54,456 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:54,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:54,488 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:54,491 INFO ]: Computing forward predicates... [2018-06-25 09:50:55,005 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:55,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:55,039 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-25 09:50:55,040 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:50:55,040 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:50:55,040 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:50:55,040 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 14 states. [2018-06-25 09:50:55,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:55,614 INFO ]: Finished difference Result 59 states and 127 transitions. [2018-06-25 09:50:55,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:50:55,623 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-25 09:50:55,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:55,624 INFO ]: With dead ends: 59 [2018-06-25 09:50:55,624 INFO ]: Without dead ends: 57 [2018-06-25 09:50:55,624 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:50:55,624 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:50:55,628 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 27. [2018-06-25 09:50:55,628 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:50:55,629 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2018-06-25 09:50:55,629 INFO ]: Start accepts. Automaton has 27 states and 54 transitions. Word has length 12 [2018-06-25 09:50:55,629 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:55,629 INFO ]: Abstraction has 27 states and 54 transitions. [2018-06-25 09:50:55,629 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:50:55,629 INFO ]: Start isEmpty. Operand 27 states and 54 transitions. [2018-06-25 09:50:55,635 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:55,635 INFO ]: Found error trace [2018-06-25 09:50:55,635 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:55,635 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:55,635 INFO ]: Analyzing trace with hash -292165702, now seen corresponding path program 1 times [2018-06-25 09:50:55,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:55,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:55,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:55,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:55,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:55,649 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:55,685 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:55,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:55,685 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-25 09:50:55,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:55,726 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:55,728 INFO ]: Computing forward predicates... [2018-06-25 09:50:55,732 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:55,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:55,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:50:55,764 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:55,764 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:55,764 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:55,764 INFO ]: Start difference. First operand 27 states and 54 transitions. Second operand 6 states. [2018-06-25 09:50:55,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:55,827 INFO ]: Finished difference Result 48 states and 102 transitions. [2018-06-25 09:50:55,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:50:55,828 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-25 09:50:55,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:55,829 INFO ]: With dead ends: 48 [2018-06-25 09:50:55,829 INFO ]: Without dead ends: 45 [2018-06-25 09:50:55,829 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:55,829 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:50:55,833 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-06-25 09:50:55,833 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:50:55,834 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 63 transitions. [2018-06-25 09:50:55,834 INFO ]: Start accepts. Automaton has 32 states and 63 transitions. Word has length 13 [2018-06-25 09:50:55,834 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:55,834 INFO ]: Abstraction has 32 states and 63 transitions. [2018-06-25 09:50:55,834 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:55,834 INFO ]: Start isEmpty. Operand 32 states and 63 transitions. [2018-06-25 09:50:55,834 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:55,834 INFO ]: Found error trace [2018-06-25 09:50:55,834 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:55,834 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:55,835 INFO ]: Analyzing trace with hash 84856572, now seen corresponding path program 2 times [2018-06-25 09:50:55,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:55,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:55,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:55,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:55,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:55,845 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:55,882 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:55,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:55,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:55,890 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:55,934 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:55,934 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:55,936 INFO ]: Computing forward predicates... [2018-06-25 09:50:55,941 INFO ]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:55,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:55,960 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:50:55,960 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:55,961 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:55,961 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:55,961 INFO ]: Start difference. First operand 32 states and 63 transitions. Second operand 6 states. [2018-06-25 09:50:56,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,008 INFO ]: Finished difference Result 45 states and 96 transitions. [2018-06-25 09:50:56,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:50:56,009 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-25 09:50:56,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,010 INFO ]: With dead ends: 45 [2018-06-25 09:50:56,010 INFO ]: Without dead ends: 39 [2018-06-25 09:50:56,010 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:56,011 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:50:56,023 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-06-25 09:50:56,023 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:50:56,024 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2018-06-25 09:50:56,024 INFO ]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 13 [2018-06-25 09:50:56,024 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,024 INFO ]: Abstraction has 33 states and 68 transitions. [2018-06-25 09:50:56,024 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:56,024 INFO ]: Start isEmpty. Operand 33 states and 68 transitions. [2018-06-25 09:50:56,024 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:56,024 INFO ]: Found error trace [2018-06-25 09:50:56,024 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,024 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,025 INFO ]: Analyzing trace with hash 226051002, now seen corresponding path program 1 times [2018-06-25 09:50:56,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,025 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:56,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,040 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,208 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:56,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:56,208 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:56,208 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:56,208 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:56,208 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:56,208 INFO ]: Start difference. First operand 33 states and 68 transitions. Second operand 4 states. [2018-06-25 09:50:56,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,256 INFO ]: Finished difference Result 37 states and 77 transitions. [2018-06-25 09:50:56,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:56,256 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:50:56,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,257 INFO ]: With dead ends: 37 [2018-06-25 09:50:56,257 INFO ]: Without dead ends: 37 [2018-06-25 09:50:56,257 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:56,257 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:50:56,260 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-06-25 09:50:56,260 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:50:56,261 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2018-06-25 09:50:56,261 INFO ]: Start accepts. Automaton has 34 states and 71 transitions. Word has length 13 [2018-06-25 09:50:56,261 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,261 INFO ]: Abstraction has 34 states and 71 transitions. [2018-06-25 09:50:56,261 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:56,261 INFO ]: Start isEmpty. Operand 34 states and 71 transitions. [2018-06-25 09:50:56,261 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:56,261 INFO ]: Found error trace [2018-06-25 09:50:56,261 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,261 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,262 INFO ]: Analyzing trace with hash 1898537256, now seen corresponding path program 2 times [2018-06-25 09:50:56,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:56,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,272 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,314 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:50:56,314 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:56,314 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:50:56,314 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:56,314 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:56,314 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:56,314 INFO ]: Start difference. First operand 34 states and 71 transitions. Second operand 5 states. [2018-06-25 09:50:56,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,413 INFO ]: Finished difference Result 41 states and 87 transitions. [2018-06-25 09:50:56,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:56,413 INFO ]: Start accepts. Automaton has 5 states. Word has length 14 [2018-06-25 09:50:56,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,413 INFO ]: With dead ends: 41 [2018-06-25 09:50:56,413 INFO ]: Without dead ends: 41 [2018-06-25 09:50:56,413 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:56,413 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 09:50:56,417 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-25 09:50:56,417 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:50:56,418 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 78 transitions. [2018-06-25 09:50:56,418 INFO ]: Start accepts. Automaton has 37 states and 78 transitions. Word has length 14 [2018-06-25 09:50:56,418 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,418 INFO ]: Abstraction has 37 states and 78 transitions. [2018-06-25 09:50:56,418 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:56,418 INFO ]: Start isEmpty. Operand 37 states and 78 transitions. [2018-06-25 09:50:56,419 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:56,419 INFO ]: Found error trace [2018-06-25 09:50:56,419 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,419 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,419 INFO ]: Analyzing trace with hash -1591624112, now seen corresponding path program 1 times [2018-06-25 09:50:56,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:56,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,429 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,470 INFO ]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:56,470 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:56,470 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:56,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:56,508 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,510 INFO ]: Computing forward predicates... [2018-06-25 09:50:56,553 INFO ]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:56,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:56,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-06-25 09:50:56,585 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:50:56,585 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:50:56,585 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:56,585 INFO ]: Start difference. First operand 37 states and 78 transitions. Second operand 9 states. [2018-06-25 09:50:56,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,865 INFO ]: Finished difference Result 61 states and 135 transitions. [2018-06-25 09:50:56,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:50:56,865 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-25 09:50:56,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,866 INFO ]: With dead ends: 61 [2018-06-25 09:50:56,866 INFO ]: Without dead ends: 55 [2018-06-25 09:50:56,866 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:50:56,866 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:50:56,869 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 39. [2018-06-25 09:50:56,869 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:50:56,870 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 81 transitions. [2018-06-25 09:50:56,870 INFO ]: Start accepts. Automaton has 39 states and 81 transitions. Word has length 14 [2018-06-25 09:50:56,870 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,870 INFO ]: Abstraction has 39 states and 81 transitions. [2018-06-25 09:50:56,870 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:50:56,870 INFO ]: Start isEmpty. Operand 39 states and 81 transitions. [2018-06-25 09:50:56,870 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:56,870 INFO ]: Found error trace [2018-06-25 09:50:56,871 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,871 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,871 INFO ]: Analyzing trace with hash -1584235944, now seen corresponding path program 1 times [2018-06-25 09:50:56,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:56,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,881 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,911 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:56,911 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:56,911 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:56,911 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:56,911 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:56,911 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:56,911 INFO ]: Start difference. First operand 39 states and 81 transitions. Second operand 3 states. [2018-06-25 09:50:56,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,919 INFO ]: Finished difference Result 41 states and 84 transitions. [2018-06-25 09:50:56,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:56,919 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-25 09:50:56,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,920 INFO ]: With dead ends: 41 [2018-06-25 09:50:56,920 INFO ]: Without dead ends: 29 [2018-06-25 09:50:56,920 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:56,920 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:50:56,922 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-06-25 09:50:56,922 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:50:56,922 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-06-25 09:50:56,922 INFO ]: Start accepts. Automaton has 28 states and 54 transitions. Word has length 14 [2018-06-25 09:50:56,922 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,922 INFO ]: Abstraction has 28 states and 54 transitions. [2018-06-25 09:50:56,922 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:56,922 INFO ]: Start isEmpty. Operand 28 states and 54 transitions. [2018-06-25 09:50:56,923 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:50:56,923 INFO ]: Found error trace [2018-06-25 09:50:56,923 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,923 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,923 INFO ]: Analyzing trace with hash -1284157790, now seen corresponding path program 1 times [2018-06-25 09:50:56,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:56,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,933 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:57,445 INFO ]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:57,445 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:57,445 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) [2018-06-25 09:50:57,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:57,498 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:57,500 INFO ]: Computing forward predicates... [2018-06-25 09:50:57,718 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:57,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:57,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:50:57,742 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:50:57,742 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:50:57,742 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:57,743 INFO ]: Start difference. First operand 28 states and 54 transitions. Second operand 12 states. [2018-06-25 09:50:58,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:58,014 INFO ]: Finished difference Result 35 states and 68 transitions. [2018-06-25 09:50:58,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:50:58,014 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 09:50:58,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:58,014 INFO ]: With dead ends: 35 [2018-06-25 09:50:58,014 INFO ]: Without dead ends: 34 [2018-06-25 09:50:58,015 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:50:58,015 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:50:58,017 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-25 09:50:58,017 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:50:58,017 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 62 transitions. [2018-06-25 09:50:58,018 INFO ]: Start accepts. Automaton has 32 states and 62 transitions. Word has length 15 [2018-06-25 09:50:58,018 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:58,018 INFO ]: Abstraction has 32 states and 62 transitions. [2018-06-25 09:50:58,018 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:50:58,018 INFO ]: Start isEmpty. Operand 32 states and 62 transitions. [2018-06-25 09:50:58,018 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:58,018 INFO ]: Found error trace [2018-06-25 09:50:58,018 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:58,018 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:58,018 INFO ]: Analyzing trace with hash 1989444286, now seen corresponding path program 1 times [2018-06-25 09:50:58,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:58,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:58,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:58,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:58,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:58,029 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:58,201 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:50:58,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:58,201 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:58,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:58,246 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:58,249 INFO ]: Computing forward predicates... [2018-06-25 09:50:58,339 INFO ]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:50:58,358 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:58,358 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-06-25 09:50:58,359 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:50:58,359 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:50:58,359 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:58,359 INFO ]: Start difference. First operand 32 states and 62 transitions. Second operand 12 states. [2018-06-25 09:50:58,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:58,558 INFO ]: Finished difference Result 32 states and 61 transitions. [2018-06-25 09:50:58,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:50:58,558 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-25 09:50:58,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:58,558 INFO ]: With dead ends: 32 [2018-06-25 09:50:58,558 INFO ]: Without dead ends: 25 [2018-06-25 09:50:58,559 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:50:58,559 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:50:58,560 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-25 09:50:58,560 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:50:58,560 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. [2018-06-25 09:50:58,561 INFO ]: Start accepts. Automaton has 24 states and 49 transitions. Word has length 16 [2018-06-25 09:50:58,561 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:58,561 INFO ]: Abstraction has 24 states and 49 transitions. [2018-06-25 09:50:58,561 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:50:58,561 INFO ]: Start isEmpty. Operand 24 states and 49 transitions. [2018-06-25 09:50:58,561 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:58,561 INFO ]: Found error trace [2018-06-25 09:50:58,561 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:58,561 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:58,561 INFO ]: Analyzing trace with hash -1783935474, now seen corresponding path program 1 times [2018-06-25 09:50:58,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:58,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:58,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:58,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:58,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:58,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:58,814 INFO ]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:58,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:58,815 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:58,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:58,844 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:58,847 INFO ]: Computing forward predicates... [2018-06-25 09:50:59,128 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-06-25 09:50:59,327 INFO ]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:59,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:59,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-06-25 09:50:59,358 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:50:59,358 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:50:59,358 INFO ]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:50:59,358 INFO ]: Start difference. First operand 24 states and 49 transitions. Second operand 18 states. [2018-06-25 09:51:00,607 WARN ]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:51:01,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:01,158 INFO ]: Finished difference Result 120 states and 291 transitions. [2018-06-25 09:51:01,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:51:01,162 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-25 09:51:01,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:01,163 INFO ]: With dead ends: 120 [2018-06-25 09:51:01,163 INFO ]: Without dead ends: 112 [2018-06-25 09:51:01,164 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:51:01,164 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-25 09:51:01,169 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 40. [2018-06-25 09:51:01,169 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:51:01,169 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2018-06-25 09:51:01,170 INFO ]: Start accepts. Automaton has 40 states and 90 transitions. Word has length 16 [2018-06-25 09:51:01,170 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:01,170 INFO ]: Abstraction has 40 states and 90 transitions. [2018-06-25 09:51:01,170 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:51:01,170 INFO ]: Start isEmpty. Operand 40 states and 90 transitions. [2018-06-25 09:51:01,170 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:51:01,170 INFO ]: Found error trace [2018-06-25 09:51:01,170 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:01,170 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:01,171 INFO ]: Analyzing trace with hash 82991944, now seen corresponding path program 1 times [2018-06-25 09:51:01,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:01,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:01,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:01,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,187 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,266 INFO ]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:51:01,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:01,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:01,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:01,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,297 INFO ]: Computing forward predicates... [2018-06-25 09:51:01,309 INFO ]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:51:01,340 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:01,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-25 09:51:01,340 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:01,340 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:01,340 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:01,340 INFO ]: Start difference. First operand 40 states and 90 transitions. Second operand 10 states. [2018-06-25 09:51:01,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:01,423 INFO ]: Finished difference Result 67 states and 158 transitions. [2018-06-25 09:51:01,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:51:01,424 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-25 09:51:01,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:01,424 INFO ]: With dead ends: 67 [2018-06-25 09:51:01,424 INFO ]: Without dead ends: 63 [2018-06-25 09:51:01,424 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:51:01,424 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-25 09:51:01,426 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-06-25 09:51:01,426 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 09:51:01,428 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 121 transitions. [2018-06-25 09:51:01,429 INFO ]: Start accepts. Automaton has 54 states and 121 transitions. Word has length 16 [2018-06-25 09:51:01,429 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:01,429 INFO ]: Abstraction has 54 states and 121 transitions. [2018-06-25 09:51:01,429 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:01,429 INFO ]: Start isEmpty. Operand 54 states and 121 transitions. [2018-06-25 09:51:01,429 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:51:01,429 INFO ]: Found error trace [2018-06-25 09:51:01,429 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:01,430 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:01,430 INFO ]: Analyzing trace with hash 1150094596, now seen corresponding path program 1 times [2018-06-25 09:51:01,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:01,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:01,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:01,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,443 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,544 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:01,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:01,544 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:01,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:01,580 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,582 INFO ]: Computing forward predicates... [2018-06-25 09:51:01,585 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:01,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:01,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:51:01,605 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:51:01,605 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:51:01,605 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:51:01,606 INFO ]: Start difference. First operand 54 states and 121 transitions. Second operand 6 states. [2018-06-25 09:51:01,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:01,648 INFO ]: Finished difference Result 59 states and 124 transitions. [2018-06-25 09:51:01,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:51:01,648 INFO ]: Start accepts. Automaton has 6 states. Word has length 16 [2018-06-25 09:51:01,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:01,649 INFO ]: With dead ends: 59 [2018-06-25 09:51:01,649 INFO ]: Without dead ends: 59 [2018-06-25 09:51:01,649 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:51:01,649 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:51:01,651 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 48. [2018-06-25 09:51:01,651 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:51:01,652 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 104 transitions. [2018-06-25 09:51:01,652 INFO ]: Start accepts. Automaton has 48 states and 104 transitions. Word has length 16 [2018-06-25 09:51:01,652 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:01,652 INFO ]: Abstraction has 48 states and 104 transitions. [2018-06-25 09:51:01,652 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:51:01,652 INFO ]: Start isEmpty. Operand 48 states and 104 transitions. [2018-06-25 09:51:01,653 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:01,653 INFO ]: Found error trace [2018-06-25 09:51:01,653 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:01,653 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:01,653 INFO ]: Analyzing trace with hash 256696212, now seen corresponding path program 2 times [2018-06-25 09:51:01,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:01,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:01,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:01,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,664 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,753 INFO ]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 09:51:01,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:01,753 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:01,758 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:01,811 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:01,811 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,813 INFO ]: Computing forward predicates... [2018-06-25 09:51:02,191 INFO ]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:02,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:02,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-25 09:51:02,213 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:02,214 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:02,214 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:02,214 INFO ]: Start difference. First operand 48 states and 104 transitions. Second operand 10 states. [2018-06-25 09:51:02,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:02,486 INFO ]: Finished difference Result 88 states and 189 transitions. [2018-06-25 09:51:02,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:51:02,486 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-25 09:51:02,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:02,486 INFO ]: With dead ends: 88 [2018-06-25 09:51:02,487 INFO ]: Without dead ends: 76 [2018-06-25 09:51:02,487 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:51:02,487 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-25 09:51:02,489 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 43. [2018-06-25 09:51:02,489 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:51:02,491 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 83 transitions. [2018-06-25 09:51:02,491 INFO ]: Start accepts. Automaton has 43 states and 83 transitions. Word has length 17 [2018-06-25 09:51:02,491 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:02,491 INFO ]: Abstraction has 43 states and 83 transitions. [2018-06-25 09:51:02,491 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:02,491 INFO ]: Start isEmpty. Operand 43 states and 83 transitions. [2018-06-25 09:51:02,492 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:02,492 INFO ]: Found error trace [2018-06-25 09:51:02,492 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:02,492 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:02,492 INFO ]: Analyzing trace with hash 1060631192, now seen corresponding path program 1 times [2018-06-25 09:51:02,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:02,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:02,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:02,492 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:02,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:02,501 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:02,791 INFO ]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:51:02,792 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:02,792 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:02,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:02,822 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:02,823 INFO ]: Computing forward predicates... [2018-06-25 09:51:02,835 INFO ]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:51:02,865 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:51:02,865 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-25 09:51:02,865 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:51:02,865 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:51:02,865 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:51:02,865 INFO ]: Start difference. First operand 43 states and 83 transitions. Second operand 7 states. [2018-06-25 09:51:02,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:02,920 INFO ]: Finished difference Result 43 states and 79 transitions. [2018-06-25 09:51:02,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:51:02,920 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-25 09:51:02,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:02,920 INFO ]: With dead ends: 43 [2018-06-25 09:51:02,920 INFO ]: Without dead ends: 43 [2018-06-25 09:51:02,920 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:02,921 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:51:02,922 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-06-25 09:51:02,922 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:51:02,923 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 74 transitions. [2018-06-25 09:51:02,923 INFO ]: Start accepts. Automaton has 40 states and 74 transitions. Word has length 17 [2018-06-25 09:51:02,923 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:02,923 INFO ]: Abstraction has 40 states and 74 transitions. [2018-06-25 09:51:02,923 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:51:02,923 INFO ]: Start isEmpty. Operand 40 states and 74 transitions. [2018-06-25 09:51:02,923 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:02,923 INFO ]: Found error trace [2018-06-25 09:51:02,923 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:02,924 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:02,924 INFO ]: Analyzing trace with hash -1459328742, now seen corresponding path program 3 times [2018-06-25 09:51:02,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:02,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:02,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:02,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:02,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:02,933 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:03,326 INFO ]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:03,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:03,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:03,331 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:03,357 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:03,357 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:03,358 INFO ]: Computing forward predicates... [2018-06-25 09:51:03,420 INFO ]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:51:03,439 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:03,439 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2018-06-25 09:51:03,439 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:51:03,439 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:51:03,439 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:51:03,439 INFO ]: Start difference. First operand 40 states and 74 transitions. Second operand 12 states. [2018-06-25 09:51:03,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:03,548 INFO ]: Finished difference Result 66 states and 120 transitions. [2018-06-25 09:51:03,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:51:03,549 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-25 09:51:03,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:03,550 INFO ]: With dead ends: 66 [2018-06-25 09:51:03,550 INFO ]: Without dead ends: 57 [2018-06-25 09:51:03,550 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:51:03,550 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:51:03,552 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-06-25 09:51:03,552 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:51:03,552 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 84 transitions. [2018-06-25 09:51:03,553 INFO ]: Start accepts. Automaton has 46 states and 84 transitions. Word has length 17 [2018-06-25 09:51:03,553 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:03,553 INFO ]: Abstraction has 46 states and 84 transitions. [2018-06-25 09:51:03,553 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:51:03,553 INFO ]: Start isEmpty. Operand 46 states and 84 transitions. [2018-06-25 09:51:03,553 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:03,553 INFO ]: Found error trace [2018-06-25 09:51:03,553 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:03,553 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:03,553 INFO ]: Analyzing trace with hash -812298016, now seen corresponding path program 1 times [2018-06-25 09:51:03,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:03,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:03,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:03,554 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:03,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:03,568 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:03,624 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:03,624 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:03,624 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:03,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:03,653 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:03,655 INFO ]: Computing forward predicates... [2018-06-25 09:51:03,701 INFO ]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:03,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:03,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 09:51:03,720 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:51:03,720 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:51:03,720 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:51:03,721 INFO ]: Start difference. First operand 46 states and 84 transitions. Second operand 9 states. [2018-06-25 09:51:03,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:03,790 INFO ]: Finished difference Result 57 states and 101 transitions. [2018-06-25 09:51:03,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:51:03,791 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-25 09:51:03,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:03,791 INFO ]: With dead ends: 57 [2018-06-25 09:51:03,791 INFO ]: Without dead ends: 49 [2018-06-25 09:51:03,791 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:51:03,791 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:51:03,793 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-25 09:51:03,793 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:51:03,794 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-06-25 09:51:03,794 INFO ]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 17 [2018-06-25 09:51:03,794 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:03,794 INFO ]: Abstraction has 43 states and 74 transitions. [2018-06-25 09:51:03,794 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:51:03,794 INFO ]: Start isEmpty. Operand 43 states and 74 transitions. [2018-06-25 09:51:03,794 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:03,794 INFO ]: Found error trace [2018-06-25 09:51:03,794 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:03,794 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:03,794 INFO ]: Analyzing trace with hash 589831140, now seen corresponding path program 1 times [2018-06-25 09:51:03,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:03,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:03,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:03,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:03,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:03,805 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:04,079 INFO ]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:04,079 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:04,079 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:04,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:04,108 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:04,110 INFO ]: Computing forward predicates... [2018-06-25 09:51:04,117 INFO ]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:04,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:04,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:51:04,141 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:51:04,142 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:51:04,142 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:51:04,142 INFO ]: Start difference. First operand 43 states and 74 transitions. Second operand 7 states. [2018-06-25 09:51:04,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:04,192 INFO ]: Finished difference Result 53 states and 89 transitions. [2018-06-25 09:51:04,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:51:04,193 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-25 09:51:04,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:04,193 INFO ]: With dead ends: 53 [2018-06-25 09:51:04,193 INFO ]: Without dead ends: 44 [2018-06-25 09:51:04,194 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:04,194 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:51:04,196 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-06-25 09:51:04,196 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:51:04,196 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2018-06-25 09:51:04,196 INFO ]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 17 [2018-06-25 09:51:04,196 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:04,196 INFO ]: Abstraction has 37 states and 62 transitions. [2018-06-25 09:51:04,196 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:51:04,196 INFO ]: Start isEmpty. Operand 37 states and 62 transitions. [2018-06-25 09:51:04,196 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:04,196 INFO ]: Found error trace [2018-06-25 09:51:04,196 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:04,196 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:04,197 INFO ]: Analyzing trace with hash 1350450094, now seen corresponding path program 1 times [2018-06-25 09:51:04,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:04,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:04,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:04,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:04,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:04,208 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:04,314 INFO ]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:51:04,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:04,315 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:04,321 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:04,343 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:04,345 INFO ]: Computing forward predicates... [2018-06-25 09:51:04,401 INFO ]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:51:04,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:04,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-06-25 09:51:04,422 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:04,422 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:04,422 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:04,422 INFO ]: Start difference. First operand 37 states and 62 transitions. Second operand 10 states. [2018-06-25 09:51:04,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:04,643 INFO ]: Finished difference Result 57 states and 98 transitions. [2018-06-25 09:51:04,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:51:04,643 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-25 09:51:04,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:04,644 INFO ]: With dead ends: 57 [2018-06-25 09:51:04,644 INFO ]: Without dead ends: 55 [2018-06-25 09:51:04,644 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:04,644 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:51:04,645 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 40. [2018-06-25 09:51:04,646 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:51:04,646 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-06-25 09:51:04,646 INFO ]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 17 [2018-06-25 09:51:04,646 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:04,646 INFO ]: Abstraction has 40 states and 69 transitions. [2018-06-25 09:51:04,646 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:04,646 INFO ]: Start isEmpty. Operand 40 states and 69 transitions. [2018-06-25 09:51:04,646 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:51:04,646 INFO ]: Found error trace [2018-06-25 09:51:04,646 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:04,647 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:04,647 INFO ]: Analyzing trace with hash -1077589784, now seen corresponding path program 1 times [2018-06-25 09:51:04,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:04,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:04,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:04,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:04,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:04,656 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,015 INFO ]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:05,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:05,015 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:05,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:05,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,047 INFO ]: Computing forward predicates... [2018-06-25 09:51:05,073 INFO ]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:05,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:05,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-06-25 09:51:05,097 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:05,097 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:05,097 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:05,097 INFO ]: Start difference. First operand 40 states and 69 transitions. Second operand 10 states. [2018-06-25 09:51:05,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:05,226 INFO ]: Finished difference Result 48 states and 78 transitions. [2018-06-25 09:51:05,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:51:05,226 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-25 09:51:05,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:05,227 INFO ]: With dead ends: 48 [2018-06-25 09:51:05,227 INFO ]: Without dead ends: 48 [2018-06-25 09:51:05,227 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:05,227 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:51:05,228 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-06-25 09:51:05,228 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 09:51:05,229 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2018-06-25 09:51:05,229 INFO ]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 17 [2018-06-25 09:51:05,229 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:05,229 INFO ]: Abstraction has 41 states and 66 transitions. [2018-06-25 09:51:05,229 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:05,229 INFO ]: Start isEmpty. Operand 41 states and 66 transitions. [2018-06-25 09:51:05,229 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:51:05,229 INFO ]: Found error trace [2018-06-25 09:51:05,229 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:05,229 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:05,230 INFO ]: Analyzing trace with hash 2144494414, now seen corresponding path program 2 times [2018-06-25 09:51:05,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:05,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:05,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:05,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,241 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,304 INFO ]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:51:05,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:05,304 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:05,310 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:05,335 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:05,335 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,336 INFO ]: Computing forward predicates... [2018-06-25 09:51:05,365 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:51:05,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:05,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-25 09:51:05,384 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:51:05,384 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:51:05,384 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:51:05,384 INFO ]: Start difference. First operand 41 states and 66 transitions. Second operand 11 states. [2018-06-25 09:51:05,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:05,527 INFO ]: Finished difference Result 55 states and 88 transitions. [2018-06-25 09:51:05,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:51:05,542 INFO ]: Start accepts. Automaton has 11 states. Word has length 18 [2018-06-25 09:51:05,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:05,542 INFO ]: With dead ends: 55 [2018-06-25 09:51:05,542 INFO ]: Without dead ends: 54 [2018-06-25 09:51:05,542 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:05,542 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 09:51:05,544 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 43. [2018-06-25 09:51:05,544 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:51:05,544 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2018-06-25 09:51:05,544 INFO ]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 18 [2018-06-25 09:51:05,544 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:05,544 INFO ]: Abstraction has 43 states and 68 transitions. [2018-06-25 09:51:05,544 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:51:05,544 INFO ]: Start isEmpty. Operand 43 states and 68 transitions. [2018-06-25 09:51:05,545 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:51:05,545 INFO ]: Found error trace [2018-06-25 09:51:05,545 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:05,545 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:05,545 INFO ]: Analyzing trace with hash 945184482, now seen corresponding path program 2 times [2018-06-25 09:51:05,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:05,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:05,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,545 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:05,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,554 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,609 INFO ]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:05,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:05,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:05,615 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:05,641 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:05,641 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,643 INFO ]: Computing forward predicates... [2018-06-25 09:51:05,696 INFO ]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:05,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:05,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-06-25 09:51:05,717 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:51:05,717 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:51:05,717 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:51:05,717 INFO ]: Start difference. First operand 43 states and 68 transitions. Second operand 13 states. [2018-06-25 09:51:05,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:05,854 INFO ]: Finished difference Result 54 states and 89 transitions. [2018-06-25 09:51:05,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:51:05,854 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 09:51:05,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:05,854 INFO ]: With dead ends: 54 [2018-06-25 09:51:05,854 INFO ]: Without dead ends: 42 [2018-06-25 09:51:05,854 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:05,854 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:51:05,856 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-06-25 09:51:05,856 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:51:05,856 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-06-25 09:51:05,856 INFO ]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 18 [2018-06-25 09:51:05,856 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:05,856 INFO ]: Abstraction has 36 states and 58 transitions. [2018-06-25 09:51:05,856 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:51:05,856 INFO ]: Start isEmpty. Operand 36 states and 58 transitions. [2018-06-25 09:51:05,856 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:51:05,856 INFO ]: Found error trace [2018-06-25 09:51:05,856 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:05,857 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:05,858 INFO ]: Analyzing trace with hash 62913498, now seen corresponding path program 3 times [2018-06-25 09:51:05,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:05,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:05,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,859 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:05,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,871 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,933 INFO ]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:51:05,933 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:05,933 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:05,939 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:05,970 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:05,970 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:05,972 INFO ]: Computing forward predicates... [2018-06-25 09:51:06,012 INFO ]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:51:06,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:06,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 09:51:06,032 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:06,032 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:06,032 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:06,032 INFO ]: Start difference. First operand 36 states and 58 transitions. Second operand 10 states. [2018-06-25 09:51:06,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:06,126 INFO ]: Finished difference Result 48 states and 81 transitions. [2018-06-25 09:51:06,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:51:06,126 INFO ]: Start accepts. Automaton has 10 states. Word has length 19 [2018-06-25 09:51:06,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:06,126 INFO ]: With dead ends: 48 [2018-06-25 09:51:06,126 INFO ]: Without dead ends: 48 [2018-06-25 09:51:06,127 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:51:06,127 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:51:06,128 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-06-25 09:51:06,128 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:51:06,128 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-06-25 09:51:06,128 INFO ]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 19 [2018-06-25 09:51:06,128 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:06,128 INFO ]: Abstraction has 36 states and 58 transitions. [2018-06-25 09:51:06,128 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:06,128 INFO ]: Start isEmpty. Operand 36 states and 58 transitions. [2018-06-25 09:51:06,129 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:51:06,129 INFO ]: Found error trace [2018-06-25 09:51:06,129 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:06,129 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:06,129 INFO ]: Analyzing trace with hash 1941047856, now seen corresponding path program 4 times [2018-06-25 09:51:06,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:06,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:06,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:06,129 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:06,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:06,138 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,206 INFO ]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:06,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:06,206 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:06,212 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:06,240 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:06,240 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,242 INFO ]: Computing forward predicates... [2018-06-25 09:51:06,303 INFO ]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:06,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:06,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-25 09:51:06,323 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:51:06,323 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:51:06,323 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:51:06,323 INFO ]: Start difference. First operand 36 states and 58 transitions. Second operand 11 states. [2018-06-25 09:51:06,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:06,434 INFO ]: Finished difference Result 48 states and 78 transitions. [2018-06-25 09:51:06,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:51:06,434 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-25 09:51:06,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:06,434 INFO ]: With dead ends: 48 [2018-06-25 09:51:06,434 INFO ]: Without dead ends: 35 [2018-06-25 09:51:06,435 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:06,435 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:51:06,436 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-25 09:51:06,436 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:51:06,436 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2018-06-25 09:51:06,436 INFO ]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 20 [2018-06-25 09:51:06,436 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:06,436 INFO ]: Abstraction has 27 states and 45 transitions. [2018-06-25 09:51:06,436 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:51:06,436 INFO ]: Start isEmpty. Operand 27 states and 45 transitions. [2018-06-25 09:51:06,437 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:51:06,437 INFO ]: Found error trace [2018-06-25 09:51:06,437 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:06,437 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:06,437 INFO ]: Analyzing trace with hash 1670242172, now seen corresponding path program 4 times [2018-06-25 09:51:06,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:06,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:06,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:06,437 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:06,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:06,452 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,670 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:51:06,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:06,670 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:06,675 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:06,720 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:06,720 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,726 INFO ]: Computing forward predicates... [2018-06-25 09:51:11,501 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:11,520 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:11,520 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-25 09:51:11,520 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:51:11,520 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:51:11,520 INFO ]: CoverageRelationStatistics Valid=73, Invalid=472, Unknown=7, NotChecked=0, Total=552 [2018-06-25 09:51:11,520 INFO ]: Start difference. First operand 27 states and 45 transitions. Second operand 24 states. [2018-06-25 09:51:12,916 WARN ]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-06-25 09:51:15,285 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-06-25 09:51:17,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:17,143 INFO ]: Finished difference Result 182 states and 327 transitions. [2018-06-25 09:51:17,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-25 09:51:17,164 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-25 09:51:17,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:17,165 INFO ]: With dead ends: 182 [2018-06-25 09:51:17,165 INFO ]: Without dead ends: 170 [2018-06-25 09:51:17,166 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=837, Invalid=2935, Unknown=10, NotChecked=0, Total=3782 [2018-06-25 09:51:17,166 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-25 09:51:17,167 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 47. [2018-06-25 09:51:17,167 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:51:17,168 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 83 transitions. [2018-06-25 09:51:17,168 INFO ]: Start accepts. Automaton has 47 states and 83 transitions. Word has length 20 [2018-06-25 09:51:17,168 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:17,168 INFO ]: Abstraction has 47 states and 83 transitions. [2018-06-25 09:51:17,168 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:51:17,168 INFO ]: Start isEmpty. Operand 47 states and 83 transitions. [2018-06-25 09:51:17,168 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:51:17,168 INFO ]: Found error trace [2018-06-25 09:51:17,168 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:17,168 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:17,168 INFO ]: Analyzing trace with hash 491161142, now seen corresponding path program 2 times [2018-06-25 09:51:17,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:17,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:17,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:17,171 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:17,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:17,181 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:17,869 INFO ]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:17,869 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:17,870 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) [2018-06-25 09:51:17,885 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:17,948 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:17,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:17,950 INFO ]: Computing forward predicates... [2018-06-25 09:51:18,160 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:18,179 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:18,179 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-25 09:51:18,179 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:51:18,179 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:51:18,179 INFO ]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:51:18,179 INFO ]: Start difference. First operand 47 states and 83 transitions. Second operand 16 states. [2018-06-25 09:51:18,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:18,525 INFO ]: Finished difference Result 107 states and 188 transitions. [2018-06-25 09:51:18,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:51:18,526 INFO ]: Start accepts. Automaton has 16 states. Word has length 20 [2018-06-25 09:51:18,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:18,527 INFO ]: With dead ends: 107 [2018-06-25 09:51:18,527 INFO ]: Without dead ends: 96 [2018-06-25 09:51:18,527 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:51:18,527 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-25 09:51:18,531 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 64. [2018-06-25 09:51:18,531 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 09:51:18,532 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2018-06-25 09:51:18,532 INFO ]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 20 [2018-06-25 09:51:18,532 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:18,532 INFO ]: Abstraction has 64 states and 112 transitions. [2018-06-25 09:51:18,532 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:51:18,532 INFO ]: Start isEmpty. Operand 64 states and 112 transitions. [2018-06-25 09:51:18,532 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:51:18,532 INFO ]: Found error trace [2018-06-25 09:51:18,532 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:18,532 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:18,532 INFO ]: Analyzing trace with hash 1022047090, now seen corresponding path program 2 times [2018-06-25 09:51:18,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:18,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:18,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:18,533 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:18,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:18,541 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:18,655 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:18,655 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:18,655 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:18,662 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:18,695 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:18,695 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:18,696 INFO ]: Computing forward predicates... [2018-06-25 09:51:18,700 INFO ]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:18,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:18,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:51:18,724 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:51:18,724 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:51:18,724 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:18,724 INFO ]: Start difference. First operand 64 states and 112 transitions. Second operand 8 states. [2018-06-25 09:51:18,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:18,829 INFO ]: Finished difference Result 79 states and 132 transitions. [2018-06-25 09:51:18,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:51:18,829 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-25 09:51:18,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:18,830 INFO ]: With dead ends: 79 [2018-06-25 09:51:18,830 INFO ]: Without dead ends: 79 [2018-06-25 09:51:18,830 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:51:18,830 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 09:51:18,832 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-06-25 09:51:18,832 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 09:51:18,832 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 96 transitions. [2018-06-25 09:51:18,833 INFO ]: Start accepts. Automaton has 57 states and 96 transitions. Word has length 20 [2018-06-25 09:51:18,833 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:18,833 INFO ]: Abstraction has 57 states and 96 transitions. [2018-06-25 09:51:18,833 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:51:18,834 INFO ]: Start isEmpty. Operand 57 states and 96 transitions. [2018-06-25 09:51:18,834 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:51:18,834 INFO ]: Found error trace [2018-06-25 09:51:18,834 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:18,834 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:18,834 INFO ]: Analyzing trace with hash 2115794748, now seen corresponding path program 5 times [2018-06-25 09:51:18,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:18,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:18,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:18,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:18,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:18,844 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:18,934 INFO ]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:18,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:18,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:18,940 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:51:18,975 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:51:18,975 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:18,977 INFO ]: Computing forward predicates... [2018-06-25 09:51:19,075 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:19,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:19,094 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-06-25 09:51:19,094 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:51:19,095 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:51:19,095 INFO ]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:51:19,095 INFO ]: Start difference. First operand 57 states and 96 transitions. Second operand 19 states. [2018-06-25 09:51:19,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:19,428 INFO ]: Finished difference Result 150 states and 257 transitions. [2018-06-25 09:51:19,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:51:19,428 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-25 09:51:19,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:19,429 INFO ]: With dead ends: 150 [2018-06-25 09:51:19,429 INFO ]: Without dead ends: 133 [2018-06-25 09:51:19,429 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:51:19,429 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-25 09:51:19,433 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 83. [2018-06-25 09:51:19,433 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-25 09:51:19,434 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 138 transitions. [2018-06-25 09:51:19,434 INFO ]: Start accepts. Automaton has 83 states and 138 transitions. Word has length 21 [2018-06-25 09:51:19,434 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:19,434 INFO ]: Abstraction has 83 states and 138 transitions. [2018-06-25 09:51:19,434 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:51:19,434 INFO ]: Start isEmpty. Operand 83 states and 138 transitions. [2018-06-25 09:51:19,435 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:51:19,435 INFO ]: Found error trace [2018-06-25 09:51:19,435 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:19,435 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:19,435 INFO ]: Analyzing trace with hash 293442042, now seen corresponding path program 5 times [2018-06-25 09:51:19,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:19,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:19,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:19,435 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:19,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:19,445 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:19,742 INFO ]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:19,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:19,742 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:19,747 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:51:19,778 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:51:19,778 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:19,780 INFO ]: Computing forward predicates... [2018-06-25 09:51:19,827 INFO ]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:19,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:19,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 09:51:19,845 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:51:19,845 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:51:19,845 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:51:19,845 INFO ]: Start difference. First operand 83 states and 138 transitions. Second operand 11 states. [2018-06-25 09:51:19,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:19,932 INFO ]: Finished difference Result 106 states and 173 transitions. [2018-06-25 09:51:19,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:51:19,932 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-25 09:51:19,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:19,933 INFO ]: With dead ends: 106 [2018-06-25 09:51:19,933 INFO ]: Without dead ends: 91 [2018-06-25 09:51:19,933 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:51:19,933 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-25 09:51:19,935 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-06-25 09:51:19,935 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-25 09:51:19,937 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2018-06-25 09:51:19,937 INFO ]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 21 [2018-06-25 09:51:19,937 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:19,937 INFO ]: Abstraction has 80 states and 128 transitions. [2018-06-25 09:51:19,937 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:51:19,937 INFO ]: Start isEmpty. Operand 80 states and 128 transitions. [2018-06-25 09:51:19,937 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:51:19,937 INFO ]: Found error trace [2018-06-25 09:51:19,937 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:19,937 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:19,937 INFO ]: Analyzing trace with hash -1728792458, now seen corresponding path program 2 times [2018-06-25 09:51:19,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:19,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:19,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:19,938 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:19,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:19,947 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:20,103 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:20,103 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:20,103 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:20,108 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:20,139 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:20,139 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:20,141 INFO ]: Computing forward predicates... [2018-06-25 09:51:20,144 INFO ]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:20,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:20,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-25 09:51:20,162 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:51:20,163 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:51:20,163 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:51:20,163 INFO ]: Start difference. First operand 80 states and 128 transitions. Second operand 9 states. [2018-06-25 09:51:20,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:20,231 INFO ]: Finished difference Result 102 states and 162 transitions. [2018-06-25 09:51:20,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:51:20,236 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-25 09:51:20,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:20,236 INFO ]: With dead ends: 102 [2018-06-25 09:51:20,236 INFO ]: Without dead ends: 89 [2018-06-25 09:51:20,237 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:51:20,237 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-25 09:51:20,239 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 73. [2018-06-25 09:51:20,239 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-25 09:51:20,239 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2018-06-25 09:51:20,239 INFO ]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 21 [2018-06-25 09:51:20,239 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:20,239 INFO ]: Abstraction has 73 states and 113 transitions. [2018-06-25 09:51:20,239 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:51:20,239 INFO ]: Start isEmpty. Operand 73 states and 113 transitions. [2018-06-25 09:51:20,240 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:51:20,240 INFO ]: Found error trace [2018-06-25 09:51:20,240 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:20,240 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:20,240 INFO ]: Analyzing trace with hash -348003520, now seen corresponding path program 2 times [2018-06-25 09:51:20,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:20,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:20,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:20,240 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:20,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:20,252 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:20,388 INFO ]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:51:20,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:20,388 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:20,393 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:20,448 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:20,448 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:20,450 INFO ]: Computing forward predicates... [2018-06-25 09:51:20,485 INFO ]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:20,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:20,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-06-25 09:51:20,504 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:51:20,504 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:51:20,504 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:51:20,504 INFO ]: Start difference. First operand 73 states and 113 transitions. Second operand 11 states. [2018-06-25 09:51:20,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:20,576 INFO ]: Finished difference Result 95 states and 142 transitions. [2018-06-25 09:51:20,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:51:20,580 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-25 09:51:20,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:20,581 INFO ]: With dead ends: 95 [2018-06-25 09:51:20,581 INFO ]: Without dead ends: 92 [2018-06-25 09:51:20,581 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:51:20,581 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-25 09:51:20,583 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 66. [2018-06-25 09:51:20,583 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 09:51:20,583 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2018-06-25 09:51:20,584 INFO ]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 21 [2018-06-25 09:51:20,584 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:20,584 INFO ]: Abstraction has 66 states and 101 transitions. [2018-06-25 09:51:20,584 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:51:20,584 INFO ]: Start isEmpty. Operand 66 states and 101 transitions. [2018-06-25 09:51:20,584 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:51:20,584 INFO ]: Found error trace [2018-06-25 09:51:20,584 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:20,584 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:20,584 INFO ]: Analyzing trace with hash -1006388804, now seen corresponding path program 6 times [2018-06-25 09:51:20,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:20,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:20,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:20,585 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:20,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:20,596 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:21,463 INFO ]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:21,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:21,463 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:21,469 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:51:21,502 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:51:21,502 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:21,504 INFO ]: Computing forward predicates... [2018-06-25 09:51:21,536 INFO ]: Checked inductivity of 27 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:21,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:21,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2018-06-25 09:51:21,554 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:51:21,555 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:51:21,555 INFO ]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:51:21,555 INFO ]: Start difference. First operand 66 states and 101 transitions. Second operand 15 states. [2018-06-25 09:51:21,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:21,776 INFO ]: Finished difference Result 140 states and 218 transitions. [2018-06-25 09:51:21,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:51:21,776 INFO ]: Start accepts. Automaton has 15 states. Word has length 22 [2018-06-25 09:51:21,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:21,777 INFO ]: With dead ends: 140 [2018-06-25 09:51:21,777 INFO ]: Without dead ends: 136 [2018-06-25 09:51:21,777 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:51:21,777 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-25 09:51:21,779 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 78. [2018-06-25 09:51:21,779 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-25 09:51:21,781 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2018-06-25 09:51:21,781 INFO ]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 22 [2018-06-25 09:51:21,781 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:21,781 INFO ]: Abstraction has 78 states and 123 transitions. [2018-06-25 09:51:21,781 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:51:21,781 INFO ]: Start isEmpty. Operand 78 states and 123 transitions. [2018-06-25 09:51:21,782 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:51:21,782 INFO ]: Found error trace [2018-06-25 09:51:21,782 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:21,782 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:21,782 INFO ]: Analyzing trace with hash 1592769896, now seen corresponding path program 6 times [2018-06-25 09:51:21,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:21,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:21,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:21,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:21,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:21,795 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:21,919 INFO ]: Checked inductivity of 25 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:51:21,920 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:21,920 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:21,931 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:51:21,963 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:51:21,963 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:21,965 INFO ]: Computing forward predicates... [2018-06-25 09:51:22,000 INFO ]: Checked inductivity of 25 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:51:22,033 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:22,033 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2018-06-25 09:51:22,034 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:51:22,034 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:51:22,034 INFO ]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:51:22,034 INFO ]: Start difference. First operand 78 states and 123 transitions. Second operand 14 states. [2018-06-25 09:51:22,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:22,579 INFO ]: Finished difference Result 107 states and 168 transitions. [2018-06-25 09:51:22,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:51:22,580 INFO ]: Start accepts. Automaton has 14 states. Word has length 22 [2018-06-25 09:51:22,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:22,580 INFO ]: With dead ends: 107 [2018-06-25 09:51:22,580 INFO ]: Without dead ends: 105 [2018-06-25 09:51:22,580 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:51:22,580 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-25 09:51:22,582 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 64. [2018-06-25 09:51:22,582 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 09:51:22,583 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 101 transitions. [2018-06-25 09:51:22,583 INFO ]: Start accepts. Automaton has 64 states and 101 transitions. Word has length 22 [2018-06-25 09:51:22,583 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:22,583 INFO ]: Abstraction has 64 states and 101 transitions. [2018-06-25 09:51:22,583 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:51:22,583 INFO ]: Start isEmpty. Operand 64 states and 101 transitions. [2018-06-25 09:51:22,583 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:51:22,583 INFO ]: Found error trace [2018-06-25 09:51:22,583 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:22,583 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:22,583 INFO ]: Analyzing trace with hash -104251376, now seen corresponding path program 3 times [2018-06-25 09:51:22,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:22,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:22,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:22,585 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:22,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:22,594 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:22,868 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:51:22,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:22,868 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:22,874 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:22,910 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:22,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:22,912 INFO ]: Computing forward predicates... [2018-06-25 09:51:22,956 INFO ]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:51:22,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:22,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2018-06-25 09:51:22,976 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:51:22,976 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:51:22,976 INFO ]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:51:22,976 INFO ]: Start difference. First operand 64 states and 101 transitions. Second operand 16 states. [2018-06-25 09:51:23,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:23,199 INFO ]: Finished difference Result 87 states and 143 transitions. [2018-06-25 09:51:23,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:51:23,199 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-25 09:51:23,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:23,200 INFO ]: With dead ends: 87 [2018-06-25 09:51:23,200 INFO ]: Without dead ends: 66 [2018-06-25 09:51:23,200 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:51:23,200 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 09:51:23,201 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 54. [2018-06-25 09:51:23,201 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 09:51:23,202 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2018-06-25 09:51:23,202 INFO ]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 22 [2018-06-25 09:51:23,202 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:23,202 INFO ]: Abstraction has 54 states and 88 transitions. [2018-06-25 09:51:23,202 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:51:23,202 INFO ]: Start isEmpty. Operand 54 states and 88 transitions. [2018-06-25 09:51:23,202 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:51:23,202 INFO ]: Found error trace [2018-06-25 09:51:23,202 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:23,202 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:23,202 INFO ]: Analyzing trace with hash -1514652320, now seen corresponding path program 7 times [2018-06-25 09:51:23,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:23,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:23,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:23,203 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:23,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:23,210 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:23,417 INFO ]: Checked inductivity of 29 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:23,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:23,417 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:23,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:23,455 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:23,456 INFO ]: Computing forward predicates... [2018-06-25 09:51:23,469 INFO ]: Checked inductivity of 29 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:23,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:23,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:51:23,488 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:23,488 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:23,488 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:23,488 INFO ]: Start difference. First operand 54 states and 88 transitions. Second operand 10 states. [2018-06-25 09:51:23,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:23,542 INFO ]: Finished difference Result 68 states and 107 transitions. [2018-06-25 09:51:23,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:51:23,542 INFO ]: Start accepts. Automaton has 10 states. Word has length 23 [2018-06-25 09:51:23,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:23,543 INFO ]: With dead ends: 68 [2018-06-25 09:51:23,543 INFO ]: Without dead ends: 66 [2018-06-25 09:51:23,543 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:51:23,543 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 09:51:23,544 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-06-25 09:51:23,544 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:51:23,544 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 76 transitions. [2018-06-25 09:51:23,545 INFO ]: Start accepts. Automaton has 48 states and 76 transitions. Word has length 23 [2018-06-25 09:51:23,545 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:23,545 INFO ]: Abstraction has 48 states and 76 transitions. [2018-06-25 09:51:23,545 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:23,545 INFO ]: Start isEmpty. Operand 48 states and 76 transitions. [2018-06-25 09:51:23,545 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:23,545 INFO ]: Found error trace [2018-06-25 09:51:23,545 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:23,545 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:23,545 INFO ]: Analyzing trace with hash -280556038, now seen corresponding path program 7 times [2018-06-25 09:51:23,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:23,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:23,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:23,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:23,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:23,554 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:23,704 INFO ]: Checked inductivity of 32 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:51:23,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:23,704 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:23,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:23,749 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:23,751 INFO ]: Computing forward predicates... [2018-06-25 09:51:23,806 INFO ]: Checked inductivity of 32 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:51:23,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:23,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2018-06-25 09:51:23,825 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:51:23,825 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:51:23,825 INFO ]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:51:23,825 INFO ]: Start difference. First operand 48 states and 76 transitions. Second operand 14 states. [2018-06-25 09:51:24,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:24,014 INFO ]: Finished difference Result 73 states and 115 transitions. [2018-06-25 09:51:24,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:51:24,014 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-25 09:51:24,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:24,014 INFO ]: With dead ends: 73 [2018-06-25 09:51:24,014 INFO ]: Without dead ends: 67 [2018-06-25 09:51:24,015 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:51:24,015 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 09:51:24,016 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-06-25 09:51:24,016 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-25 09:51:24,016 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2018-06-25 09:51:24,016 INFO ]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 24 [2018-06-25 09:51:24,017 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:24,017 INFO ]: Abstraction has 51 states and 79 transitions. [2018-06-25 09:51:24,017 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:51:24,017 INFO ]: Start isEmpty. Operand 51 states and 79 transitions. [2018-06-25 09:51:24,017 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:24,017 INFO ]: Found error trace [2018-06-25 09:51:24,017 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:24,017 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:24,017 INFO ]: Analyzing trace with hash -276861954, now seen corresponding path program 1 times [2018-06-25 09:51:24,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:24,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:24,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:24,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:24,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:24,025 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:24,080 INFO ]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-25 09:51:24,080 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:51:24,080 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:51:24,080 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:51:24,080 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:51:24,080 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:24,080 INFO ]: Start difference. First operand 51 states and 79 transitions. Second operand 3 states. [2018-06-25 09:51:24,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:24,129 INFO ]: Finished difference Result 49 states and 70 transitions. [2018-06-25 09:51:24,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:51:24,129 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-25 09:51:24,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:24,130 INFO ]: With dead ends: 49 [2018-06-25 09:51:24,130 INFO ]: Without dead ends: 47 [2018-06-25 09:51:24,130 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:24,130 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-25 09:51:24,131 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-25 09:51:24,131 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:51:24,131 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2018-06-25 09:51:24,131 INFO ]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 24 [2018-06-25 09:51:24,131 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:24,131 INFO ]: Abstraction has 47 states and 68 transitions. [2018-06-25 09:51:24,131 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:51:24,131 INFO ]: Start isEmpty. Operand 47 states and 68 transitions. [2018-06-25 09:51:24,132 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:24,132 INFO ]: Found error trace [2018-06-25 09:51:24,132 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:24,132 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:24,132 INFO ]: Analyzing trace with hash -1025508610, now seen corresponding path program 2 times [2018-06-25 09:51:24,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:24,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:24,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:24,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:24,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:24,141 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:24,201 INFO ]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-25 09:51:24,201 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:51:24,201 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:51:24,201 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:51:24,201 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:51:24,201 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:24,201 INFO ]: Start difference. First operand 47 states and 68 transitions. Second operand 3 states. [2018-06-25 09:51:24,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:24,262 INFO ]: Finished difference Result 51 states and 72 transitions. [2018-06-25 09:51:24,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:51:24,262 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-25 09:51:24,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:24,263 INFO ]: With dead ends: 51 [2018-06-25 09:51:24,263 INFO ]: Without dead ends: 34 [2018-06-25 09:51:24,263 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:24,263 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:51:24,264 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-06-25 09:51:24,264 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:51:24,264 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-06-25 09:51:24,264 INFO ]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 24 [2018-06-25 09:51:24,264 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:24,264 INFO ]: Abstraction has 31 states and 46 transitions. [2018-06-25 09:51:24,264 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:51:24,264 INFO ]: Start isEmpty. Operand 31 states and 46 transitions. [2018-06-25 09:51:24,264 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:24,264 INFO ]: Found error trace [2018-06-25 09:51:24,264 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:24,264 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:24,264 INFO ]: Analyzing trace with hash -636917938, now seen corresponding path program 8 times [2018-06-25 09:51:24,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:24,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:24,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:24,265 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:24,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:24,280 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:24,522 INFO ]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:51:24,523 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:24,523 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:24,529 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:24,570 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:24,570 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:24,574 INFO ]: Computing forward predicates... [2018-06-25 09:51:30,108 INFO ]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:51:30,139 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:30,139 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-06-25 09:51:30,140 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:51:30,140 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:51:30,140 INFO ]: CoverageRelationStatistics Valid=82, Invalid=662, Unknown=12, NotChecked=0, Total=756 [2018-06-25 09:51:30,140 INFO ]: Start difference. First operand 31 states and 46 transitions. Second operand 28 states. [2018-06-25 09:51:31,750 WARN ]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-06-25 09:51:33,549 WARN ]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-06-25 09:51:36,344 WARN ]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-06-25 09:51:37,360 WARN ]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-06-25 09:51:37,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:37,473 INFO ]: Finished difference Result 221 states and 329 transitions. [2018-06-25 09:51:37,476 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-25 09:51:37,476 INFO ]: Start accepts. Automaton has 28 states. Word has length 24 [2018-06-25 09:51:37,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:37,476 INFO ]: With dead ends: 221 [2018-06-25 09:51:37,476 INFO ]: Without dead ends: 205 [2018-06-25 09:51:37,477 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1081, Invalid=4910, Unknown=15, NotChecked=0, Total=6006 [2018-06-25 09:51:37,477 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-25 09:51:37,480 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 53. [2018-06-25 09:51:37,480 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-25 09:51:37,480 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2018-06-25 09:51:37,481 INFO ]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 24 [2018-06-25 09:51:37,481 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:37,481 INFO ]: Abstraction has 53 states and 85 transitions. [2018-06-25 09:51:37,481 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:51:37,481 INFO ]: Start isEmpty. Operand 53 states and 85 transitions. [2018-06-25 09:51:37,481 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:37,481 INFO ]: Found error trace [2018-06-25 09:51:37,481 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:37,481 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:37,481 INFO ]: Analyzing trace with hash 137578376, now seen corresponding path program 3 times [2018-06-25 09:51:37,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:37,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:37,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:37,482 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:37,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:37,490 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:37,591 INFO ]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:37,591 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:37,591 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:37,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:37,635 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:37,635 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:37,637 INFO ]: Computing forward predicates... [2018-06-25 09:51:38,293 INFO ]: Checked inductivity of 32 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:51:38,316 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:38,316 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-25 09:51:38,316 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:51:38,316 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:51:38,316 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:38,316 INFO ]: Start difference. First operand 53 states and 85 transitions. Second operand 20 states. [2018-06-25 09:51:38,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:38,700 INFO ]: Finished difference Result 115 states and 170 transitions. [2018-06-25 09:51:38,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:51:38,700 INFO ]: Start accepts. Automaton has 20 states. Word has length 24 [2018-06-25 09:51:38,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:38,701 INFO ]: With dead ends: 115 [2018-06-25 09:51:38,701 INFO ]: Without dead ends: 98 [2018-06-25 09:51:38,701 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:51:38,702 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-25 09:51:38,703 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-06-25 09:51:38,703 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 09:51:38,703 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2018-06-25 09:51:38,703 INFO ]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 24 [2018-06-25 09:51:38,703 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:38,703 INFO ]: Abstraction has 67 states and 104 transitions. [2018-06-25 09:51:38,703 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:51:38,703 INFO ]: Start isEmpty. Operand 67 states and 104 transitions. [2018-06-25 09:51:38,704 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:38,704 INFO ]: Found error trace [2018-06-25 09:51:38,704 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:38,704 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:38,704 INFO ]: Analyzing trace with hash 1544540228, now seen corresponding path program 3 times [2018-06-25 09:51:38,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:38,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:38,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:38,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:38,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:38,714 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:38,837 INFO ]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:38,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:38,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:38,847 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:38,883 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:38,883 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:38,884 INFO ]: Computing forward predicates... [2018-06-25 09:51:38,889 INFO ]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:38,912 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:38,912 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:51:38,912 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:38,912 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:38,912 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:38,912 INFO ]: Start difference. First operand 67 states and 104 transitions. Second operand 10 states. [2018-06-25 09:51:39,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:39,010 INFO ]: Finished difference Result 94 states and 136 transitions. [2018-06-25 09:51:39,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:51:39,010 INFO ]: Start accepts. Automaton has 10 states. Word has length 24 [2018-06-25 09:51:39,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:39,011 INFO ]: With dead ends: 94 [2018-06-25 09:51:39,011 INFO ]: Without dead ends: 94 [2018-06-25 09:51:39,011 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:39,011 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-25 09:51:39,012 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 59. [2018-06-25 09:51:39,012 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-25 09:51:39,013 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2018-06-25 09:51:39,013 INFO ]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 24 [2018-06-25 09:51:39,013 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:39,013 INFO ]: Abstraction has 59 states and 87 transitions. [2018-06-25 09:51:39,013 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:39,013 INFO ]: Start isEmpty. Operand 59 states and 87 transitions. [2018-06-25 09:51:39,013 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:51:39,013 INFO ]: Found error trace [2018-06-25 09:51:39,013 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:39,013 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:39,013 INFO ]: Analyzing trace with hash 1393909024, now seen corresponding path program 9 times [2018-06-25 09:51:39,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:39,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:39,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:39,014 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:39,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:39,022 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:39,399 INFO ]: Checked inductivity of 37 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:39,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:39,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:39,405 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:39,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:51:39,444 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:39,447 INFO ]: Computing forward predicates... [2018-06-25 09:51:39,653 INFO ]: Checked inductivity of 37 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:39,671 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:39,672 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2018-06-25 09:51:39,672 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:51:39,672 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:51:39,672 INFO ]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:39,672 INFO ]: Start difference. First operand 59 states and 87 transitions. Second operand 17 states. [2018-06-25 09:51:39,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:39,905 INFO ]: Finished difference Result 137 states and 195 transitions. [2018-06-25 09:51:39,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:51:39,905 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-25 09:51:39,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:39,905 INFO ]: With dead ends: 137 [2018-06-25 09:51:39,905 INFO ]: Without dead ends: 137 [2018-06-25 09:51:39,906 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:51:39,906 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-25 09:51:39,908 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 80. [2018-06-25 09:51:39,908 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-25 09:51:39,909 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2018-06-25 09:51:39,909 INFO ]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 25 [2018-06-25 09:51:39,911 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:39,911 INFO ]: Abstraction has 80 states and 121 transitions. [2018-06-25 09:51:39,911 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:51:39,911 INFO ]: Start isEmpty. Operand 80 states and 121 transitions. [2018-06-25 09:51:39,911 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:51:39,911 INFO ]: Found error trace [2018-06-25 09:51:39,911 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:39,911 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:39,911 INFO ]: Analyzing trace with hash 1422397146, now seen corresponding path program 10 times [2018-06-25 09:51:39,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:39,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:39,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:39,912 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:39,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:39,921 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:40,011 INFO ]: Checked inductivity of 37 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:40,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:40,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:40,016 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:40,053 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:40,053 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:40,055 INFO ]: Computing forward predicates... [2018-06-25 09:51:40,102 INFO ]: Checked inductivity of 37 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:51:40,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:40,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2018-06-25 09:51:40,121 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:51:40,121 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:51:40,121 INFO ]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:51:40,121 INFO ]: Start difference. First operand 80 states and 121 transitions. Second operand 18 states. [2018-06-25 09:51:40,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:40,298 INFO ]: Finished difference Result 147 states and 211 transitions. [2018-06-25 09:51:40,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:51:40,299 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-25 09:51:40,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:40,300 INFO ]: With dead ends: 147 [2018-06-25 09:51:40,300 INFO ]: Without dead ends: 121 [2018-06-25 09:51:40,300 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:51:40,300 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-25 09:51:40,302 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 74. [2018-06-25 09:51:40,302 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-25 09:51:40,303 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2018-06-25 09:51:40,303 INFO ]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 25 [2018-06-25 09:51:40,304 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:40,304 INFO ]: Abstraction has 74 states and 111 transitions. [2018-06-25 09:51:40,304 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:51:40,304 INFO ]: Start isEmpty. Operand 74 states and 111 transitions. [2018-06-25 09:51:40,304 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:51:40,304 INFO ]: Found error trace [2018-06-25 09:51:40,304 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:40,304 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:40,304 INFO ]: Analyzing trace with hash 1353544352, now seen corresponding path program 8 times [2018-06-25 09:51:40,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:40,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:40,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:40,305 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:40,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:40,314 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:40,616 INFO ]: Checked inductivity of 36 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:40,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:40,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:51:40,629 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:40,698 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:40,698 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:40,701 INFO ]: Computing forward predicates... [2018-06-25 09:51:40,945 INFO ]: Checked inductivity of 36 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:40,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:40,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 09:51:40,977 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:51:40,977 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:51:40,977 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:51:40,977 INFO ]: Start difference. First operand 74 states and 111 transitions. Second operand 13 states. [2018-06-25 09:51:41,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:41,125 INFO ]: Finished difference Result 111 states and 158 transitions. [2018-06-25 09:51:41,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:51:41,125 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-25 09:51:41,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:41,126 INFO ]: With dead ends: 111 [2018-06-25 09:51:41,126 INFO ]: Without dead ends: 87 [2018-06-25 09:51:41,126 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:51:41,126 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 09:51:41,128 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 71. [2018-06-25 09:51:41,128 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-25 09:51:41,128 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2018-06-25 09:51:41,129 INFO ]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 25 [2018-06-25 09:51:41,129 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:41,129 INFO ]: Abstraction has 71 states and 101 transitions. [2018-06-25 09:51:41,129 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:51:41,129 INFO ]: Start isEmpty. Operand 71 states and 101 transitions. [2018-06-25 09:51:41,129 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:51:41,129 INFO ]: Found error trace [2018-06-25 09:51:41,129 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:41,129 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:41,129 INFO ]: Analyzing trace with hash -1823151452, now seen corresponding path program 3 times [2018-06-25 09:51:41,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:41,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:41,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:41,131 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:41,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:41,139 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:41,412 INFO ]: Checked inductivity of 36 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:41,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:41,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:41,418 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:41,468 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:41,468 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:41,469 INFO ]: Computing forward predicates... [2018-06-25 09:51:41,472 INFO ]: Checked inductivity of 36 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:51:41,492 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:41,492 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-25 09:51:41,492 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:51:41,492 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:51:41,492 INFO ]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:51:41,492 INFO ]: Start difference. First operand 71 states and 101 transitions. Second operand 11 states. [2018-06-25 09:51:41,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:41,571 INFO ]: Finished difference Result 107 states and 146 transitions. [2018-06-25 09:51:41,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:51:41,571 INFO ]: Start accepts. Automaton has 11 states. Word has length 25 [2018-06-25 09:51:41,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:41,571 INFO ]: With dead ends: 107 [2018-06-25 09:51:41,571 INFO ]: Without dead ends: 82 [2018-06-25 09:51:41,571 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:51:41,571 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-25 09:51:41,572 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 63. [2018-06-25 09:51:41,572 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 09:51:41,573 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2018-06-25 09:51:41,573 INFO ]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 25 [2018-06-25 09:51:41,573 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:41,573 INFO ]: Abstraction has 63 states and 87 transitions. [2018-06-25 09:51:41,573 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:51:41,573 INFO ]: Start isEmpty. Operand 63 states and 87 transitions. [2018-06-25 09:51:41,573 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:51:41,573 INFO ]: Found error trace [2018-06-25 09:51:41,573 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:41,573 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:41,573 INFO ]: Analyzing trace with hash 1377542254, now seen corresponding path program 3 times [2018-06-25 09:51:41,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:41,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:41,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:41,574 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:41,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:41,583 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:42,036 INFO ]: Checked inductivity of 36 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:51:42,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:42,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:42,041 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:42,080 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:42,080 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:42,082 INFO ]: Computing forward predicates... [2018-06-25 09:51:42,163 INFO ]: Checked inductivity of 36 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:42,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:42,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-25 09:51:42,183 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:51:42,183 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:51:42,183 INFO ]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:42,183 INFO ]: Start difference. First operand 63 states and 87 transitions. Second operand 20 states. [2018-06-25 09:51:42,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:42,630 INFO ]: Finished difference Result 118 states and 157 transitions. [2018-06-25 09:51:42,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:51:42,631 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-25 09:51:42,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:42,631 INFO ]: With dead ends: 118 [2018-06-25 09:51:42,631 INFO ]: Without dead ends: 114 [2018-06-25 09:51:42,631 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:51:42,632 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-25 09:51:42,633 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 58. [2018-06-25 09:51:42,633 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-25 09:51:42,633 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2018-06-25 09:51:42,633 INFO ]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 25 [2018-06-25 09:51:42,633 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:42,633 INFO ]: Abstraction has 58 states and 80 transitions. [2018-06-25 09:51:42,633 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:51:42,633 INFO ]: Start isEmpty. Operand 58 states and 80 transitions. [2018-06-25 09:51:42,633 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:51:42,633 INFO ]: Found error trace [2018-06-25 09:51:42,633 INFO ]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:42,633 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:42,633 INFO ]: Analyzing trace with hash -2015551710, now seen corresponding path program 4 times [2018-06-25 09:51:42,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:42,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:42,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:42,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:42,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:42,642 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:42,872 INFO ]: Checked inductivity of 40 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:42,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:42,872 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:42,878 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:42,918 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:42,918 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:42,921 INFO ]: Computing forward predicates... [2018-06-25 09:51:43,050 INFO ]: Checked inductivity of 40 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:43,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:43,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2018-06-25 09:51:43,069 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:51:43,069 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:51:43,069 INFO ]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:51:43,069 INFO ]: Start difference. First operand 58 states and 80 transitions. Second operand 19 states. [2018-06-25 09:51:43,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:43,339 INFO ]: Finished difference Result 101 states and 135 transitions. [2018-06-25 09:51:43,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:51:43,340 INFO ]: Start accepts. Automaton has 19 states. Word has length 26 [2018-06-25 09:51:43,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:43,340 INFO ]: With dead ends: 101 [2018-06-25 09:51:43,340 INFO ]: Without dead ends: 78 [2018-06-25 09:51:43,340 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:51:43,340 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-25 09:51:43,341 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 50. [2018-06-25 09:51:43,341 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-25 09:51:43,341 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2018-06-25 09:51:43,341 INFO ]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 26 [2018-06-25 09:51:43,341 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:43,341 INFO ]: Abstraction has 50 states and 69 transitions. [2018-06-25 09:51:43,341 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:51:43,341 INFO ]: Start isEmpty. Operand 50 states and 69 transitions. [2018-06-25 09:51:43,341 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:51:43,341 INFO ]: Found error trace [2018-06-25 09:51:43,341 INFO ]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:43,342 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:43,342 INFO ]: Analyzing trace with hash -129091856, now seen corresponding path program 9 times [2018-06-25 09:51:43,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:43,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:43,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:43,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:43,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:43,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:43,475 INFO ]: Checked inductivity of 50 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-25 09:51:43,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:43,475 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:43,482 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:43,551 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:51:43,551 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:43,554 INFO ]: Computing forward predicates... [2018-06-25 09:51:44,174 INFO ]: Checked inductivity of 50 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 09:51:44,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:44,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-06-25 09:51:44,193 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:51:44,193 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:51:44,193 INFO ]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:44,193 INFO ]: Start difference. First operand 50 states and 69 transitions. Second operand 20 states. [2018-06-25 09:51:44,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:44,480 INFO ]: Finished difference Result 76 states and 101 transitions. [2018-06-25 09:51:44,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:51:44,480 INFO ]: Start accepts. Automaton has 20 states. Word has length 28 [2018-06-25 09:51:44,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:44,480 INFO ]: With dead ends: 76 [2018-06-25 09:51:44,480 INFO ]: Without dead ends: 60 [2018-06-25 09:51:44,481 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:51:44,481 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-25 09:51:44,482 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-06-25 09:51:44,482 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:51:44,482 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-06-25 09:51:44,482 INFO ]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 28 [2018-06-25 09:51:44,482 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:44,482 INFO ]: Abstraction has 35 states and 50 transitions. [2018-06-25 09:51:44,482 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:51:44,482 INFO ]: Start isEmpty. Operand 35 states and 50 transitions. [2018-06-25 09:51:44,482 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:51:44,482 INFO ]: Found error trace [2018-06-25 09:51:44,482 INFO ]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:44,482 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:44,482 INFO ]: Analyzing trace with hash -2136522180, now seen corresponding path program 11 times [2018-06-25 09:51:44,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:44,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:44,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:44,483 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:44,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:44,528 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:44,841 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 09:51:45,239 INFO ]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:45,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:45,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:45,245 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:51:45,292 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:51:45,292 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:45,297 INFO ]: Computing forward predicates... [2018-06-25 09:51:45,990 INFO ]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:46,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:46,009 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 32 [2018-06-25 09:51:46,009 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:51:46,009 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:51:46,009 INFO ]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:51:46,009 INFO ]: Start difference. First operand 35 states and 50 transitions. Second operand 32 states. [2018-06-25 09:51:48,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:48,523 INFO ]: Finished difference Result 123 states and 169 transitions. [2018-06-25 09:51:48,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:51:48,524 INFO ]: Start accepts. Automaton has 32 states. Word has length 28 [2018-06-25 09:51:48,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:48,524 INFO ]: With dead ends: 123 [2018-06-25 09:51:48,524 INFO ]: Without dead ends: 113 [2018-06-25 09:51:48,524 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=465, Invalid=3567, Unknown=0, NotChecked=0, Total=4032 [2018-06-25 09:51:48,524 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-25 09:51:48,526 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 47. [2018-06-25 09:51:48,526 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:51:48,527 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2018-06-25 09:51:48,527 INFO ]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 28 [2018-06-25 09:51:48,527 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:48,527 INFO ]: Abstraction has 47 states and 70 transitions. [2018-06-25 09:51:48,527 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:51:48,527 INFO ]: Start isEmpty. Operand 47 states and 70 transitions. [2018-06-25 09:51:48,527 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:51:48,527 INFO ]: Found error trace [2018-06-25 09:51:48,527 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:48,527 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:48,527 INFO ]: Analyzing trace with hash -874906634, now seen corresponding path program 4 times [2018-06-25 09:51:48,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:48,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:48,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:48,527 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:48,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:48,533 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:48,684 INFO ]: Checked inductivity of 50 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:48,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:48,684 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:48,689 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:48,732 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:48,732 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:48,734 INFO ]: Computing forward predicates... [2018-06-25 09:51:48,839 INFO ]: Checked inductivity of 50 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:48,859 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:48,859 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-06-25 09:51:48,859 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:51:48,859 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:51:48,859 INFO ]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:51:48,859 INFO ]: Start difference. First operand 47 states and 70 transitions. Second operand 24 states. [2018-06-25 09:51:49,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:49,393 INFO ]: Finished difference Result 131 states and 180 transitions. [2018-06-25 09:51:49,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:51:49,393 INFO ]: Start accepts. Automaton has 24 states. Word has length 28 [2018-06-25 09:51:49,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:49,394 INFO ]: With dead ends: 131 [2018-06-25 09:51:49,394 INFO ]: Without dead ends: 111 [2018-06-25 09:51:49,394 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=476, Invalid=1686, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 09:51:49,394 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-25 09:51:49,395 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 68. [2018-06-25 09:51:49,395 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-25 09:51:49,396 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-06-25 09:51:49,396 INFO ]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 28 [2018-06-25 09:51:49,396 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:49,396 INFO ]: Abstraction has 68 states and 96 transitions. [2018-06-25 09:51:49,396 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:51:49,396 INFO ]: Start isEmpty. Operand 68 states and 96 transitions. [2018-06-25 09:51:49,396 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:51:49,396 INFO ]: Found error trace [2018-06-25 09:51:49,396 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:49,396 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:49,396 INFO ]: Analyzing trace with hash 1455702066, now seen corresponding path program 4 times [2018-06-25 09:51:49,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:49,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:49,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:49,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:49,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:49,407 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:49,465 INFO ]: Checked inductivity of 50 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:49,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:49,466 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:49,471 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:49,513 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:49,513 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:49,514 INFO ]: Computing forward predicates... [2018-06-25 09:51:49,518 INFO ]: Checked inductivity of 50 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:49,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:49,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-25 09:51:49,537 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:51:49,537 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:51:49,537 INFO ]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:51:49,537 INFO ]: Start difference. First operand 68 states and 96 transitions. Second operand 12 states. [2018-06-25 09:51:49,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:49,659 INFO ]: Finished difference Result 112 states and 152 transitions. [2018-06-25 09:51:49,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:51:49,660 INFO ]: Start accepts. Automaton has 12 states. Word has length 28 [2018-06-25 09:51:49,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:49,660 INFO ]: With dead ends: 112 [2018-06-25 09:51:49,660 INFO ]: Without dead ends: 112 [2018-06-25 09:51:49,660 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:51:49,660 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-25 09:51:49,661 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 69. [2018-06-25 09:51:49,661 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:51:49,662 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2018-06-25 09:51:49,662 INFO ]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 28 [2018-06-25 09:51:49,662 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:49,662 INFO ]: Abstraction has 69 states and 97 transitions. [2018-06-25 09:51:49,662 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:51:49,662 INFO ]: Start isEmpty. Operand 69 states and 97 transitions. [2018-06-25 09:51:49,662 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:51:49,662 INFO ]: Found error trace [2018-06-25 09:51:49,662 INFO ]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:49,662 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:49,662 INFO ]: Analyzing trace with hash 71302926, now seen corresponding path program 12 times [2018-06-25 09:51:49,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:49,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:49,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:49,663 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:49,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:49,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:49,760 INFO ]: Checked inductivity of 56 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:49,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:49,760 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:49,767 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:51:49,814 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:51:49,814 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:49,817 INFO ]: Computing forward predicates... [2018-06-25 09:51:49,896 INFO ]: Checked inductivity of 56 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:49,914 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:49,914 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-06-25 09:51:49,914 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:51:49,915 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:51:49,915 INFO ]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:49,915 INFO ]: Start difference. First operand 69 states and 97 transitions. Second operand 20 states. [2018-06-25 09:51:50,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:50,176 INFO ]: Finished difference Result 204 states and 276 transitions. [2018-06-25 09:51:50,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:51:50,176 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-25 09:51:50,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:50,176 INFO ]: With dead ends: 204 [2018-06-25 09:51:50,176 INFO ]: Without dead ends: 200 [2018-06-25 09:51:50,176 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:51:50,177 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-25 09:51:50,178 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 85. [2018-06-25 09:51:50,178 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-25 09:51:50,178 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2018-06-25 09:51:50,179 INFO ]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 29 [2018-06-25 09:51:50,179 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:50,179 INFO ]: Abstraction has 85 states and 125 transitions. [2018-06-25 09:51:50,179 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:51:50,179 INFO ]: Start isEmpty. Operand 85 states and 125 transitions. [2018-06-25 09:51:50,179 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:51:50,179 INFO ]: Found error trace [2018-06-25 09:51:50,179 INFO ]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:50,179 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:50,179 INFO ]: Analyzing trace with hash -1214173316, now seen corresponding path program 13 times [2018-06-25 09:51:50,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:50,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:50,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:50,180 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:50,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:50,190 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:50,434 INFO ]: Checked inductivity of 56 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:50,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:50,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:50,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:50,483 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:50,486 INFO ]: Computing forward predicates... [2018-06-25 09:51:50,620 INFO ]: Checked inductivity of 56 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:51:50,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:50,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-06-25 09:51:50,639 INFO ]: Interpolant automaton has 27 states [2018-06-25 09:51:50,639 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-25 09:51:50,639 INFO ]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:51:50,639 INFO ]: Start difference. First operand 85 states and 125 transitions. Second operand 27 states. [2018-06-25 09:51:51,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:51,101 INFO ]: Finished difference Result 185 states and 252 transitions. [2018-06-25 09:51:51,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:51:51,101 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-25 09:51:51,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:51,101 INFO ]: With dead ends: 185 [2018-06-25 09:51:51,101 INFO ]: Without dead ends: 148 [2018-06-25 09:51:51,102 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:51:51,102 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-25 09:51:51,104 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 88. [2018-06-25 09:51:51,104 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-25 09:51:51,104 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2018-06-25 09:51:51,104 INFO ]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 29 [2018-06-25 09:51:51,104 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:51,104 INFO ]: Abstraction has 88 states and 126 transitions. [2018-06-25 09:51:51,104 INFO ]: Interpolant automaton has 27 states. [2018-06-25 09:51:51,104 INFO ]: Start isEmpty. Operand 88 states and 126 transitions. [2018-06-25 09:51:51,104 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:51:51,104 INFO ]: Found error trace [2018-06-25 09:51:51,105 INFO ]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:51,105 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:51,105 INFO ]: Analyzing trace with hash -1214608326, now seen corresponding path program 10 times [2018-06-25 09:51:51,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:51,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:51,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:51,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:51,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:51,116 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:51:51,357 WARN ]: Verification canceled [2018-06-25 09:51:51,361 WARN ]: Timeout [2018-06-25 09:51:51,362 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:51:51 BoogieIcfgContainer [2018-06-25 09:51:51,362 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:51:51,362 INFO ]: Toolchain (without parser) took 61024.65 ms. Allocated memory was 303.0 MB in the beginning and 539.5 MB in the end (delta: 236.5 MB). Free memory was 255.4 MB in the beginning and 174.7 MB in the end (delta: 80.7 MB). Peak memory consumption was 317.2 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:51,363 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:51:51,363 INFO ]: ChcToBoogie took 67.48 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:51,364 INFO ]: Boogie Preprocessor took 32.53 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:51,364 INFO ]: RCFGBuilder took 384.48 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 239.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:51,364 INFO ]: TraceAbstraction took 60531.10 ms. Allocated memory was 303.0 MB in the beginning and 539.5 MB in the end (delta: 236.5 MB). Free memory was 237.5 MB in the beginning and 174.7 MB in the end (delta: 62.8 MB). Peak memory consumption was 299.2 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:51,366 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.48 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.53 ms. Allocated memory is still 303.0 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 384.48 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 239.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60531.10 ms. Allocated memory was 303.0 MB in the beginning and 539.5 MB in the end (delta: 236.5 MB). Free memory was 237.5 MB in the beginning and 174.7 MB in the end (delta: 62.8 MB). Peak memory consumption was 299.2 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 30 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 28 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 60.4s OverallTime, 60 OverallIterations, 5 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 2456 SDslu, 5308 SDs, 0 SdLazy, 8315 SolverSat, 2747 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2070 GetRequests, 910 SyntacticMatches, 22 SemanticMatches, 1138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6813 ImplicationChecksByTransitivity, 41.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=59, 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, 59 MinimizatonAttempts, 1546 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 2148 NumberOfCodeBlocks, 2148 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2039 ConstructedInterpolants, 30 QuantifiedInterpolants, 143745 SizeOfPredicates, 203 NumberOfNonLiveVariables, 14772 ConjunctsInSsa, 1554 ConjunctsInUnsatCore, 109 InterpolantComputations, 11 PerfectInterpolantSequences, 1577/2263 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-51-51-460.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-51-51-460.csv Completed graceful shutdown