java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:10:16,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:10:16,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:10:16,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:10:16,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:10:16,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:10:16,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:10:16,817 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:10:16,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:10:16,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:10:16,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:10:16,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:10:16,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:10:16,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:10:16,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:10:16,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:10:16,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:10:16,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:10:16,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:10:16,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:10:16,838 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:10:16,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:10:16,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:10:16,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:10:16,843 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:10:16,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:10:16,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:10:16,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:10:16,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:10:16,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:10:16,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:10:16,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:10:16,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:10:16,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:10:16,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:10:16,853 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:10:16,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:10:16,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:10:16,874 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:10:16,874 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:10:16,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:10:16,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:10:16,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:10:16,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:10:16,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:10:16,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:10:16,877 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:10:16,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:10:16,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:10:16,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:10:16,878 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:10:16,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:10:16,878 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:10:16,884 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:10:16,884 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:10:16,942 INFO ]: Repository-Root is: /tmp [2018-06-22 01:10:16,959 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:10:16,962 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:10:16,964 INFO ]: Initializing SmtParser... [2018-06-22 01:10:16,964 INFO ]: SmtParser initialized [2018-06-22 01:10:16,965 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-22 01:10:16,966 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:10:17,068 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 unknown [2018-06-22 01:10:17,251 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-22 01:10:17,262 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:10:17,275 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:10:17,275 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:10:17,275 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:10:17,276 INFO ]: ChcToBoogie initialized [2018-06-22 01:10:17,279 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,342 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17 Unit [2018-06-22 01:10:17,342 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:10:17,342 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:10:17,343 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:10:17,343 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:10:17,368 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,368 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,374 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,375 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,377 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,380 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,381 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... [2018-06-22 01:10:17,382 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:10:17,387 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:10:17,387 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:10:17,387 INFO ]: RCFGBuilder initialized [2018-06-22 01:10:17,388 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:10:17,406 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:10:17,406 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:10:17,406 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:10:17,406 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:10:17,406 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:10:17,406 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:10:17,543 INFO ]: Using library mode [2018-06-22 01:10:17,544 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:10:17 BoogieIcfgContainer [2018-06-22 01:10:17,544 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:10:17,545 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:10:17,545 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:10:17,549 INFO ]: TraceAbstraction initialized [2018-06-22 01:10:17,550 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:10:17" (1/3) ... [2018-06-22 01:10:17,551 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ff00e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:10:17, skipping insertion in model container [2018-06-22 01:10:17,551 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:17" (2/3) ... [2018-06-22 01:10:17,551 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ff00e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:10:17, skipping insertion in model container [2018-06-22 01:10:17,551 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:10:17" (3/3) ... [2018-06-22 01:10:17,553 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:10:17,563 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:10:17,571 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:10:17,617 INFO ]: Using default assertion order modulation [2018-06-22 01:10:17,617 INFO ]: Interprodecural is true [2018-06-22 01:10:17,617 INFO ]: Hoare is false [2018-06-22 01:10:17,617 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:10:17,617 INFO ]: Backedges is TWOTRACK [2018-06-22 01:10:17,617 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:10:17,617 INFO ]: Difference is false [2018-06-22 01:10:17,617 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:10:17,617 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:10:17,633 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:10:17,643 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:10:17,643 INFO ]: Found error trace [2018-06-22 01:10:17,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:17,644 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:17,649 INFO ]: Analyzing trace with hash 1951839708, now seen corresponding path program 1 times [2018-06-22 01:10:17,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:17,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:17,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:17,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:17,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:17,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:17,969 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:17,972 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:10:17,972 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:10:17,974 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:10:17,992 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:10:17,992 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:10:17,995 INFO ]: Start difference. First operand 12 states. Second operand 5 states. [2018-06-22 01:10:18,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:18,152 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-22 01:10:18,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:10:18,154 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:10:18,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:18,163 INFO ]: With dead ends: 15 [2018-06-22 01:10:18,163 INFO ]: Without dead ends: 15 [2018-06-22 01:10:18,165 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:10:18,181 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:10:18,201 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:10:18,203 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:10:18,203 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:10:18,205 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-06-22 01:10:18,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:18,205 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:10:18,205 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:10:18,205 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:10:18,206 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:10:18,206 INFO ]: Found error trace [2018-06-22 01:10:18,206 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:18,206 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:18,206 INFO ]: Analyzing trace with hash 375606352, now seen corresponding path program 1 times [2018-06-22 01:10:18,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:18,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:18,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:18,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:18,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:18,222 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,298 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:18,298 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:10:18,298 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:10:18,300 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:10:18,300 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:10:18,300 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:10:18,301 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-22 01:10:18,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:18,394 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-22 01:10:18,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:10:18,394 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:10:18,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:18,395 INFO ]: With dead ends: 16 [2018-06-22 01:10:18,395 INFO ]: Without dead ends: 16 [2018-06-22 01:10:18,396 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:10:18,396 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:10:18,398 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:10:18,398 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:10:18,398 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-06-22 01:10:18,398 INFO ]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 10 [2018-06-22 01:10:18,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:18,398 INFO ]: Abstraction has 12 states and 15 transitions. [2018-06-22 01:10:18,398 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:10:18,398 INFO ]: Start isEmpty. Operand 12 states and 15 transitions. [2018-06-22 01:10:18,401 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:10:18,401 INFO ]: Found error trace [2018-06-22 01:10:18,401 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:18,401 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:18,401 INFO ]: Analyzing trace with hash 490122956, now seen corresponding path program 1 times [2018-06-22 01:10:18,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:18,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:18,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:18,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:18,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:18,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,487 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:18,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:18,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:18,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:18,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:18,576 INFO ]: Computing forward predicates... [2018-06-22 01:10:18,694 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:18,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:18,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-22 01:10:18,717 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:10:18,717 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:10:18,717 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:10:18,718 INFO ]: Start difference. First operand 12 states and 15 transitions. Second operand 7 states. [2018-06-22 01:10:18,925 WARN ]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:10:19,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:19,259 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-22 01:10:19,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:10:19,260 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 01:10:19,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:19,260 INFO ]: With dead ends: 17 [2018-06-22 01:10:19,260 INFO ]: Without dead ends: 14 [2018-06-22 01:10:19,261 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:10:19,261 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:10:19,263 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:10:19,263 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:10:19,263 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 01:10:19,263 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2018-06-22 01:10:19,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:19,264 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 01:10:19,264 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:10:19,264 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 01:10:19,264 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:10:19,264 INFO ]: Found error trace [2018-06-22 01:10:19,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:19,264 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:19,264 INFO ]: Analyzing trace with hash 538146048, now seen corresponding path program 1 times [2018-06-22 01:10:19,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:19,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:19,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:19,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:19,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:19,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:19,397 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:19,397 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:10:19,397 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:10:19,397 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:10:19,397 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:10:19,397 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:10:19,398 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2018-06-22 01:10:19,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:19,638 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-22 01:10:19,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:10:19,639 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:10:19,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:19,640 INFO ]: With dead ends: 15 [2018-06-22 01:10:19,640 INFO ]: Without dead ends: 15 [2018-06-22 01:10:19,640 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:10:19,640 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:10:19,642 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 01:10:19,642 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:10:19,642 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 01:10:19,642 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2018-06-22 01:10:19,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:19,643 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 01:10:19,643 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:10:19,643 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 01:10:19,645 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:10:19,645 INFO ]: Found error trace [2018-06-22 01:10:19,645 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:19,645 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:19,646 INFO ]: Analyzing trace with hash -499224148, now seen corresponding path program 1 times [2018-06-22 01:10:19,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:19,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:19,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:19,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:19,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:19,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:20,048 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:20,048 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:20,048 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:20,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:20,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:20,070 INFO ]: Computing forward predicates... [2018-06-22 01:10:20,171 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:20,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:20,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:10:20,197 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:10:20,198 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:10:20,198 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:10:20,198 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-06-22 01:10:20,788 WARN ]: Spent 324.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-06-22 01:10:20,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:20,941 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-22 01:10:20,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:10:20,945 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:10:20,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:20,945 INFO ]: With dead ends: 28 [2018-06-22 01:10:20,945 INFO ]: Without dead ends: 28 [2018-06-22 01:10:20,946 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:10:20,946 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:10:20,951 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-06-22 01:10:20,951 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:10:20,952 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 01:10:20,952 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2018-06-22 01:10:20,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:20,952 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 01:10:20,952 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:10:20,952 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 01:10:20,953 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:10:20,953 INFO ]: Found error trace [2018-06-22 01:10:20,953 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:20,953 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:20,953 INFO ]: Analyzing trace with hash -397000792, now seen corresponding path program 1 times [2018-06-22 01:10:20,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:20,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:20,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:20,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:20,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:20,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:21,027 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:21,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:21,027 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:21,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:21,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:21,060 INFO ]: Computing forward predicates... [2018-06-22 01:10:21,075 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:21,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:21,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:10:21,096 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:10:21,096 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:10:21,097 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:10:21,097 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 7 states. [2018-06-22 01:10:21,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:21,130 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-22 01:10:21,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:10:21,130 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 01:10:21,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:21,131 INFO ]: With dead ends: 19 [2018-06-22 01:10:21,131 INFO ]: Without dead ends: 19 [2018-06-22 01:10:21,131 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:10:21,131 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:10:21,133 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-22 01:10:21,133 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:10:21,134 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-22 01:10:21,134 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2018-06-22 01:10:21,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:21,134 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-22 01:10:21,134 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:10:21,134 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-22 01:10:21,134 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:10:21,134 INFO ]: Found error trace [2018-06-22 01:10:21,135 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:21,135 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:21,135 INFO ]: Analyzing trace with hash -747686356, now seen corresponding path program 2 times [2018-06-22 01:10:21,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:21,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:21,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:21,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:21,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:21,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:21,239 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:21,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:21,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:21,246 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:21,283 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:21,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:21,287 INFO ]: Computing forward predicates... [2018-06-22 01:10:21,338 INFO ]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:21,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:21,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-22 01:10:21,362 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:10:21,362 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:10:21,363 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:10:21,363 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 11 states. [2018-06-22 01:10:21,533 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 01:10:21,851 WARN ]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:10:22,158 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:10:22,590 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 01:10:23,223 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 01:10:23,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:23,380 INFO ]: Finished difference Result 37 states and 44 transitions. [2018-06-22 01:10:23,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:10:23,380 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 01:10:23,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:23,381 INFO ]: With dead ends: 37 [2018-06-22 01:10:23,381 INFO ]: Without dead ends: 37 [2018-06-22 01:10:23,381 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:10:23,382 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:10:23,386 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-06-22 01:10:23,386 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:10:23,387 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-06-22 01:10:23,387 INFO ]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2018-06-22 01:10:23,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:23,387 INFO ]: Abstraction has 19 states and 24 transitions. [2018-06-22 01:10:23,387 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:10:23,387 INFO ]: Start isEmpty. Operand 19 states and 24 transitions. [2018-06-22 01:10:23,387 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:10:23,387 INFO ]: Found error trace [2018-06-22 01:10:23,387 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:23,388 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:23,391 INFO ]: Analyzing trace with hash 674089768, now seen corresponding path program 2 times [2018-06-22 01:10:23,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:23,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:23,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:23,392 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:23,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:23,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:23,974 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:23,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:23,974 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:23,982 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:23,999 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:23,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:24,001 INFO ]: Computing forward predicates... [2018-06-22 01:10:24,048 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:24,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:24,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:10:24,070 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:10:24,070 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:10:24,070 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:10:24,070 INFO ]: Start difference. First operand 19 states and 24 transitions. Second operand 9 states. [2018-06-22 01:10:24,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:24,098 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-22 01:10:24,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:10:24,099 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-22 01:10:24,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:24,100 INFO ]: With dead ends: 23 [2018-06-22 01:10:24,100 INFO ]: Without dead ends: 23 [2018-06-22 01:10:24,101 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:10:24,101 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:10:24,104 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 01:10:24,104 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:10:24,105 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-22 01:10:24,105 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2018-06-22 01:10:24,105 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:24,105 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-22 01:10:24,105 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:10:24,105 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-22 01:10:24,105 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:10:24,105 INFO ]: Found error trace [2018-06-22 01:10:24,106 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:24,106 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:24,106 INFO ]: Analyzing trace with hash 254537052, now seen corresponding path program 3 times [2018-06-22 01:10:24,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:24,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:24,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:24,107 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:24,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:24,124 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:24,350 INFO ]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:10:24,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:24,351 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:24,359 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:24,383 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:10:24,383 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:24,390 INFO ]: Computing forward predicates... [2018-06-22 01:10:24,591 INFO ]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:24,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:24,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:10:24,613 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:10:24,613 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:10:24,613 INFO ]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:10:24,613 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 14 states. [2018-06-22 01:10:25,909 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:10:26,270 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-22 01:10:26,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:26,272 INFO ]: Finished difference Result 55 states and 64 transitions. [2018-06-22 01:10:26,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:10:26,272 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-22 01:10:26,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:26,273 INFO ]: With dead ends: 55 [2018-06-22 01:10:26,273 INFO ]: Without dead ends: 55 [2018-06-22 01:10:26,283 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=423, Invalid=1059, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:10:26,283 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:10:26,289 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 22. [2018-06-22 01:10:26,289 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:10:26,290 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-22 01:10:26,290 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2018-06-22 01:10:26,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:26,290 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-22 01:10:26,290 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:10:26,290 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-22 01:10:26,290 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:10:26,290 INFO ]: Found error trace [2018-06-22 01:10:26,290 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:26,291 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:26,291 INFO ]: Analyzing trace with hash -800033112, now seen corresponding path program 3 times [2018-06-22 01:10:26,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:26,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:26,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:26,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:26,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:26,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:26,918 INFO ]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:26,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:26,918 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:26,959 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:26,997 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:10:26,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:26,999 INFO ]: Computing forward predicates... [2018-06-22 01:10:27,035 INFO ]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:27,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:27,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:10:27,064 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:10:27,064 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:10:27,064 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:10:27,064 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 11 states. [2018-06-22 01:10:27,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:27,089 INFO ]: Finished difference Result 27 states and 33 transitions. [2018-06-22 01:10:27,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:10:27,089 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 01:10:27,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:27,090 INFO ]: With dead ends: 27 [2018-06-22 01:10:27,090 INFO ]: Without dead ends: 27 [2018-06-22 01:10:27,090 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:10:27,090 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:10:27,092 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-06-22 01:10:27,092 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:10:27,093 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-06-22 01:10:27,093 INFO ]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 17 [2018-06-22 01:10:27,093 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:27,093 INFO ]: Abstraction has 24 states and 30 transitions. [2018-06-22 01:10:27,093 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:10:27,093 INFO ]: Start isEmpty. Operand 24 states and 30 transitions. [2018-06-22 01:10:27,093 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:10:27,093 INFO ]: Found error trace [2018-06-22 01:10:27,093 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:27,093 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:27,094 INFO ]: Analyzing trace with hash 1528673580, now seen corresponding path program 4 times [2018-06-22 01:10:27,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:27,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:27,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:27,095 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:27,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:27,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:27,183 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:10:27,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:27,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:27,190 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:10:27,214 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:27,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:27,216 INFO ]: Computing forward predicates... [2018-06-22 01:10:27,329 INFO ]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:27,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:27,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-22 01:10:27,351 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:10:27,351 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:10:27,351 INFO ]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:10:27,351 INFO ]: Start difference. First operand 24 states and 30 transitions. Second operand 17 states. [2018-06-22 01:10:28,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:28,602 INFO ]: Finished difference Result 77 states and 88 transitions. [2018-06-22 01:10:28,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:10:28,602 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-22 01:10:28,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:28,605 INFO ]: With dead ends: 77 [2018-06-22 01:10:28,605 INFO ]: Without dead ends: 77 [2018-06-22 01:10:28,606 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=761, Invalid=1995, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:10:28,606 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 01:10:28,609 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 25. [2018-06-22 01:10:28,609 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:10:28,610 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-22 01:10:28,610 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-06-22 01:10:28,610 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:28,611 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-22 01:10:28,611 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:10:28,611 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-22 01:10:28,611 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:10:28,611 INFO ]: Found error trace [2018-06-22 01:10:28,611 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:28,611 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:28,611 INFO ]: Analyzing trace with hash -92913112, now seen corresponding path program 4 times [2018-06-22 01:10:28,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:28,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:28,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:28,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:28,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:28,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:28,713 INFO ]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:28,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:28,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:28,719 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:10:28,748 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:28,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:28,750 INFO ]: Computing forward predicates... [2018-06-22 01:10:29,059 INFO ]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:29,095 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:29,095 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:10:29,095 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:10:29,096 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:10:29,096 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:10:29,096 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 13 states. [2018-06-22 01:10:29,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:29,183 INFO ]: Finished difference Result 31 states and 38 transitions. [2018-06-22 01:10:29,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:10:29,183 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:10:29,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:29,184 INFO ]: With dead ends: 31 [2018-06-22 01:10:29,184 INFO ]: Without dead ends: 31 [2018-06-22 01:10:29,184 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:10:29,184 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:10:29,187 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 01:10:29,187 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:10:29,188 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-06-22 01:10:29,188 INFO ]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 19 [2018-06-22 01:10:29,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:29,188 INFO ]: Abstraction has 27 states and 34 transitions. [2018-06-22 01:10:29,188 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:10:29,188 INFO ]: Start isEmpty. Operand 27 states and 34 transitions. [2018-06-22 01:10:29,188 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:10:29,188 INFO ]: Found error trace [2018-06-22 01:10:29,188 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:29,188 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:29,189 INFO ]: Analyzing trace with hash -168148900, now seen corresponding path program 5 times [2018-06-22 01:10:29,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:29,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:29,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:29,189 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:29,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:29,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:29,369 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:10:29,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:29,407 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:29,415 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:29,434 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:10:29,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:29,437 INFO ]: Computing forward predicates... [2018-06-22 01:10:29,605 INFO ]: Checked inductivity of 31 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:29,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:29,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 01:10:29,640 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:10:29,640 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:10:29,641 INFO ]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:10:29,642 INFO ]: Start difference. First operand 27 states and 34 transitions. Second operand 20 states. [2018-06-22 01:10:31,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:31,233 INFO ]: Finished difference Result 103 states and 116 transitions. [2018-06-22 01:10:31,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 01:10:31,233 INFO ]: Start accepts. Automaton has 20 states. Word has length 19 [2018-06-22 01:10:31,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:31,234 INFO ]: With dead ends: 103 [2018-06-22 01:10:31,234 INFO ]: Without dead ends: 103 [2018-06-22 01:10:31,237 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1268, Invalid=3424, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:10:31,238 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:10:31,246 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 28. [2018-06-22 01:10:31,246 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:10:31,247 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-06-22 01:10:31,247 INFO ]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2018-06-22 01:10:31,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:31,247 INFO ]: Abstraction has 28 states and 36 transitions. [2018-06-22 01:10:31,247 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:10:31,247 INFO ]: Start isEmpty. Operand 28 states and 36 transitions. [2018-06-22 01:10:31,248 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:10:31,248 INFO ]: Found error trace [2018-06-22 01:10:31,248 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:31,248 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:31,248 INFO ]: Analyzing trace with hash 844574120, now seen corresponding path program 5 times [2018-06-22 01:10:31,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:31,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:31,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:31,249 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:31,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:31,263 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:31,353 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:10:31,353 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:31,353 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:31,359 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:31,379 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:10:31,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:31,381 INFO ]: Computing forward predicates... [2018-06-22 01:10:31,459 INFO ]: Checked inductivity of 67 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:31,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:31,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-06-22 01:10:31,480 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:10:31,480 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:10:31,480 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:10:31,481 INFO ]: Start difference. First operand 28 states and 36 transitions. Second operand 12 states. [2018-06-22 01:10:31,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:31,567 INFO ]: Finished difference Result 40 states and 48 transitions. [2018-06-22 01:10:31,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:10:31,568 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 01:10:31,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:31,568 INFO ]: With dead ends: 40 [2018-06-22 01:10:31,568 INFO ]: Without dead ends: 28 [2018-06-22 01:10:31,568 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:10:31,568 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:10:31,571 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:10:31,571 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:10:31,571 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-06-22 01:10:31,571 INFO ]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2018-06-22 01:10:31,571 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:31,571 INFO ]: Abstraction has 28 states and 35 transitions. [2018-06-22 01:10:31,571 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:10:31,572 INFO ]: Start isEmpty. Operand 28 states and 35 transitions. [2018-06-22 01:10:31,572 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:10:31,572 INFO ]: Found error trace [2018-06-22 01:10:31,572 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:31,572 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:31,572 INFO ]: Analyzing trace with hash 1330787372, now seen corresponding path program 6 times [2018-06-22 01:10:31,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:31,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:31,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:31,573 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:31,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:31,582 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:31,736 INFO ]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:10:31,736 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:31,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:31,755 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:10:31,802 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:10:31,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:31,804 INFO ]: Computing forward predicates... [2018-06-22 01:10:32,005 INFO ]: Checked inductivity of 43 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:32,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:32,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-06-22 01:10:32,027 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:10:32,027 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:10:32,027 INFO ]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:10:32,027 INFO ]: Start difference. First operand 28 states and 35 transitions. Second operand 23 states. [2018-06-22 01:10:32,780 WARN ]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-22 01:10:34,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:34,248 INFO ]: Finished difference Result 105 states and 118 transitions. [2018-06-22 01:10:34,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:10:34,248 INFO ]: Start accepts. Automaton has 23 states. Word has length 21 [2018-06-22 01:10:34,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:34,249 INFO ]: With dead ends: 105 [2018-06-22 01:10:34,249 INFO ]: Without dead ends: 105 [2018-06-22 01:10:34,251 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1676, Invalid=4486, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 01:10:34,251 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 01:10:34,255 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 29. [2018-06-22 01:10:34,255 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:10:34,255 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-06-22 01:10:34,255 INFO ]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 21 [2018-06-22 01:10:34,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:34,255 INFO ]: Abstraction has 29 states and 37 transitions. [2018-06-22 01:10:34,255 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:10:34,255 INFO ]: Start isEmpty. Operand 29 states and 37 transitions. [2018-06-22 01:10:34,257 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:10:34,257 INFO ]: Found error trace [2018-06-22 01:10:34,257 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:34,257 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:34,257 INFO ]: Analyzing trace with hash 1884968652, now seen corresponding path program 6 times [2018-06-22 01:10:34,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:34,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:34,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:34,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:34,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:34,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:35,322 INFO ]: Checked inductivity of 69 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:10:35,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:35,322 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:35,328 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:10:35,351 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:10:35,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:35,354 INFO ]: Computing forward predicates... [2018-06-22 01:10:35,741 INFO ]: Checked inductivity of 69 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:10:35,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:35,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 19 [2018-06-22 01:10:35,763 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:10:35,763 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:10:35,763 INFO ]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:10:35,764 INFO ]: Start difference. First operand 29 states and 37 transitions. Second operand 19 states. [2018-06-22 01:10:36,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:36,053 INFO ]: Finished difference Result 38 states and 45 transitions. [2018-06-22 01:10:36,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:10:36,053 INFO ]: Start accepts. Automaton has 19 states. Word has length 22 [2018-06-22 01:10:36,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:36,054 INFO ]: With dead ends: 38 [2018-06-22 01:10:36,054 INFO ]: Without dead ends: 29 [2018-06-22 01:10:36,054 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:10:36,054 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:10:36,056 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:10:36,056 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:10:36,058 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-06-22 01:10:36,058 INFO ]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2018-06-22 01:10:36,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:36,059 INFO ]: Abstraction has 29 states and 36 transitions. [2018-06-22 01:10:36,059 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:10:36,059 INFO ]: Start isEmpty. Operand 29 states and 36 transitions. [2018-06-22 01:10:36,059 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:10:36,059 INFO ]: Found error trace [2018-06-22 01:10:36,059 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:36,059 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:36,059 INFO ]: Analyzing trace with hash -222539224, now seen corresponding path program 7 times [2018-06-22 01:10:36,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:36,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:36,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:36,060 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:36,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:36,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:36,251 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:36,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:36,251 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:36,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:36,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:36,279 INFO ]: Computing forward predicates... [2018-06-22 01:10:37,230 INFO ]: Checked inductivity of 72 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:10:37,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:37,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-06-22 01:10:37,252 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:10:37,252 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:10:37,252 INFO ]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:10:37,252 INFO ]: Start difference. First operand 29 states and 36 transitions. Second operand 20 states. [2018-06-22 01:10:37,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:37,620 INFO ]: Finished difference Result 37 states and 43 transitions. [2018-06-22 01:10:37,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:10:37,620 INFO ]: Start accepts. Automaton has 20 states. Word has length 23 [2018-06-22 01:10:37,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:37,620 INFO ]: With dead ends: 37 [2018-06-22 01:10:37,620 INFO ]: Without dead ends: 29 [2018-06-22 01:10:37,621 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:10:37,621 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:10:37,623 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:10:37,623 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:10:37,624 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-06-22 01:10:37,624 INFO ]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2018-06-22 01:10:37,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:37,624 INFO ]: Abstraction has 29 states and 35 transitions. [2018-06-22 01:10:37,624 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:10:37,624 INFO ]: Start isEmpty. Operand 29 states and 35 transitions. [2018-06-22 01:10:37,624 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:10:37,624 INFO ]: Found error trace [2018-06-22 01:10:37,625 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:37,625 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:37,625 INFO ]: Analyzing trace with hash 490312540, now seen corresponding path program 7 times [2018-06-22 01:10:37,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:37,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:37,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:37,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:37,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:37,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:37,735 INFO ]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:10:37,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:37,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:37,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:37,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:37,763 INFO ]: Computing forward predicates... [2018-06-22 01:10:37,995 INFO ]: Checked inductivity of 57 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:38,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:38,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2018-06-22 01:10:38,016 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:10:38,016 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:10:38,017 INFO ]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:10:38,017 INFO ]: Start difference. First operand 29 states and 35 transitions. Second operand 26 states. [2018-06-22 01:10:39,231 WARN ]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-22 01:10:40,167 WARN ]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 01:10:41,642 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:10:42,129 WARN ]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-22 01:10:42,399 WARN ]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-22 01:10:42,715 WARN ]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-06-22 01:10:42,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:42,869 INFO ]: Finished difference Result 93 states and 104 transitions. [2018-06-22 01:10:42,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-22 01:10:42,869 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-22 01:10:42,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:42,870 INFO ]: With dead ends: 93 [2018-06-22 01:10:42,870 INFO ]: Without dead ends: 93 [2018-06-22 01:10:42,871 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1751, Invalid=4569, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:10:42,872 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 01:10:42,875 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 30. [2018-06-22 01:10:42,875 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:10:42,876 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-06-22 01:10:42,876 INFO ]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2018-06-22 01:10:42,876 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:42,876 INFO ]: Abstraction has 30 states and 37 transitions. [2018-06-22 01:10:42,876 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:10:42,876 INFO ]: Start isEmpty. Operand 30 states and 37 transitions. [2018-06-22 01:10:42,891 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:10:42,891 INFO ]: Found error trace [2018-06-22 01:10:42,891 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:42,891 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:42,892 INFO ]: Analyzing trace with hash -1130773940, now seen corresponding path program 8 times [2018-06-22 01:10:42,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:42,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:42,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:42,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:10:42,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:42,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:43,202 INFO ]: Checked inductivity of 76 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:10:43,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:43,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:43,209 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:43,228 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:43,228 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:43,231 INFO ]: Computing forward predicates... [2018-06-22 01:10:43,394 INFO ]: Checked inductivity of 76 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:10:43,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:43,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-06-22 01:10:43,416 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:10:43,416 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:10:43,416 INFO ]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:10:43,417 INFO ]: Start difference. First operand 30 states and 37 transitions. Second operand 21 states. [2018-06-22 01:10:43,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:43,699 INFO ]: Finished difference Result 38 states and 44 transitions. [2018-06-22 01:10:43,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:10:43,699 INFO ]: Start accepts. Automaton has 21 states. Word has length 24 [2018-06-22 01:10:43,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:43,699 INFO ]: With dead ends: 38 [2018-06-22 01:10:43,699 INFO ]: Without dead ends: 31 [2018-06-22 01:10:43,700 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:10:43,700 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:10:43,702 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-06-22 01:10:43,702 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:10:43,702 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-06-22 01:10:43,702 INFO ]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2018-06-22 01:10:43,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:43,702 INFO ]: Abstraction has 30 states and 36 transitions. [2018-06-22 01:10:43,702 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:10:43,702 INFO ]: Start isEmpty. Operand 30 states and 36 transitions. [2018-06-22 01:10:43,703 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:10:43,703 INFO ]: Found error trace [2018-06-22 01:10:43,703 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:43,703 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:43,703 INFO ]: Analyzing trace with hash 778720936, now seen corresponding path program 9 times [2018-06-22 01:10:43,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:43,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:43,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:43,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:43,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:43,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:44,279 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:44,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:44,279 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:44,285 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:44,386 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:10:44,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:44,389 INFO ]: Computing forward predicates... [2018-06-22 01:10:45,048 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 01:10:45,780 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:10:45,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:45,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 27 [2018-06-22 01:10:45,847 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:10:45,848 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:10:45,848 INFO ]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:10:45,848 INFO ]: Start difference. First operand 30 states and 36 transitions. Second operand 27 states. [2018-06-22 01:10:47,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:47,276 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-22 01:10:47,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:10:47,277 INFO ]: Start accepts. Automaton has 27 states. Word has length 25 [2018-06-22 01:10:47,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:47,277 INFO ]: With dead ends: 43 [2018-06-22 01:10:47,277 INFO ]: Without dead ends: 37 [2018-06-22 01:10:47,278 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:10:47,278 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:10:47,279 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-06-22 01:10:47,279 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:10:47,280 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-22 01:10:47,280 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 25 [2018-06-22 01:10:47,280 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:47,280 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-22 01:10:47,280 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:10:47,280 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-22 01:10:47,281 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:10:47,281 INFO ]: Found error trace [2018-06-22 01:10:47,281 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:47,281 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:47,281 INFO ]: Analyzing trace with hash -72568020, now seen corresponding path program 8 times [2018-06-22 01:10:47,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:47,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:47,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:47,282 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:47,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:47,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:47,527 INFO ]: Checked inductivity of 73 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:10:47,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:47,527 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:47,536 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:10:47,558 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:10:47,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:47,561 INFO ]: Computing forward predicates... [2018-06-22 01:10:47,906 INFO ]: Checked inductivity of 73 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:47,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:47,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-06-22 01:10:47,926 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:10:47,926 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:10:47,926 INFO ]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:10:47,926 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 29 states. [2018-06-22 01:10:49,388 WARN ]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-06-22 01:10:51,074 WARN ]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:10:51,633 WARN ]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-06-22 01:10:52,240 WARN ]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-06-22 01:10:52,764 WARN ]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-06-22 01:10:53,325 WARN ]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-06-22 01:10:53,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:53,327 INFO ]: Finished difference Result 81 states and 90 transitions. [2018-06-22 01:10:53,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 01:10:53,327 INFO ]: Start accepts. Automaton has 29 states. Word has length 25 [2018-06-22 01:10:53,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:53,328 INFO ]: With dead ends: 81 [2018-06-22 01:10:53,328 INFO ]: Without dead ends: 81 [2018-06-22 01:10:53,329 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1708, Invalid=4454, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 01:10:53,330 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:10:53,332 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 31. [2018-06-22 01:10:53,332 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:10:53,333 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-22 01:10:53,333 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 25 [2018-06-22 01:10:53,333 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:53,333 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-22 01:10:53,333 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:10:53,333 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-22 01:10:53,334 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:10:53,334 INFO ]: Found error trace [2018-06-22 01:10:53,336 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:53,336 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:53,336 INFO ]: Analyzing trace with hash -156480052, now seen corresponding path program 10 times [2018-06-22 01:10:53,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:53,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:53,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:53,337 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:53,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:53,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:54,046 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:54,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:54,046 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) [2018-06-22 01:10:54,061 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:54,086 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:10:54,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:54,089 INFO ]: Computing forward predicates... [2018-06-22 01:10:54,434 INFO ]: Checked inductivity of 87 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:10:54,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:54,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 27 [2018-06-22 01:10:54,469 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:10:54,469 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:10:54,469 INFO ]: CoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:10:54,470 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 27 states. [2018-06-22 01:10:55,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:55,506 INFO ]: Finished difference Result 44 states and 49 transitions. [2018-06-22 01:10:55,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:10:55,506 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-22 01:10:55,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:55,506 INFO ]: With dead ends: 44 [2018-06-22 01:10:55,506 INFO ]: Without dead ends: 39 [2018-06-22 01:10:55,507 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=979, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:10:55,507 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:10:55,509 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-06-22 01:10:55,509 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:10:55,509 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-22 01:10:55,509 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 26 [2018-06-22 01:10:55,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:55,509 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-22 01:10:55,509 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:10:55,510 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-22 01:10:55,511 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:10:55,511 INFO ]: Found error trace [2018-06-22 01:10:55,511 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:55,511 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:55,511 INFO ]: Analyzing trace with hash 917060392, now seen corresponding path program 11 times [2018-06-22 01:10:55,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:55,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:55,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:55,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:55,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:55,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:55,831 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:10:55,831 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:55,831 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:55,838 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:10:55,876 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:10:55,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:55,879 INFO ]: Computing forward predicates... [2018-06-22 01:10:56,137 INFO ]: Checked inductivity of 94 backedges. 24 proven. 64 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:10:56,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:56,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 30 [2018-06-22 01:10:56,159 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:10:56,159 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:10:56,159 INFO ]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:10:56,159 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 30 states. [2018-06-22 01:10:56,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:10:56,612 INFO ]: Finished difference Result 51 states and 56 transitions. [2018-06-22 01:10:56,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:10:56,612 INFO ]: Start accepts. Automaton has 30 states. Word has length 27 [2018-06-22 01:10:56,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:10:56,612 INFO ]: With dead ends: 51 [2018-06-22 01:10:56,612 INFO ]: Without dead ends: 39 [2018-06-22 01:10:56,613 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=1177, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:10:56,613 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:10:56,614 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-06-22 01:10:56,614 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:10:56,615 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-06-22 01:10:56,615 INFO ]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2018-06-22 01:10:56,615 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:10:56,615 INFO ]: Abstraction has 31 states and 35 transitions. [2018-06-22 01:10:56,615 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:10:56,615 INFO ]: Start isEmpty. Operand 31 states and 35 transitions. [2018-06-22 01:10:56,615 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:10:56,615 INFO ]: Found error trace [2018-06-22 01:10:56,616 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:10:56,616 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:10:56,616 INFO ]: Analyzing trace with hash -1177950628, now seen corresponding path program 9 times [2018-06-22 01:10:56,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:10:56,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:10:56,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:56,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:10:56,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:10:56,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:56,758 INFO ]: Checked inductivity of 91 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:10:56,758 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:10:56,758 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:10:56,764 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:10:56,792 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:10:56,792 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:10:56,794 INFO ]: Computing forward predicates... [2018-06-22 01:10:59,792 INFO ]: Checked inductivity of 91 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:10:59,814 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:10:59,814 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2018-06-22 01:10:59,814 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:10:59,814 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:10:59,814 INFO ]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:10:59,814 INFO ]: Start difference. First operand 31 states and 35 transitions. Second operand 32 states. [2018-06-22 01:11:01,399 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-06-22 01:11:02,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:02,617 INFO ]: Finished difference Result 69 states and 76 transitions. [2018-06-22 01:11:02,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:11:02,617 INFO ]: Start accepts. Automaton has 32 states. Word has length 27 [2018-06-22 01:11:02,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:02,618 INFO ]: With dead ends: 69 [2018-06-22 01:11:02,618 INFO ]: Without dead ends: 69 [2018-06-22 01:11:02,619 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1535, Invalid=4165, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 01:11:02,619 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:11:02,620 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 32. [2018-06-22 01:11:02,620 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:02,624 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-06-22 01:11:02,624 INFO ]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2018-06-22 01:11:02,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:02,624 INFO ]: Abstraction has 32 states and 37 transitions. [2018-06-22 01:11:02,624 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:11:02,624 INFO ]: Start isEmpty. Operand 32 states and 37 transitions. [2018-06-22 01:11:02,624 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:11:02,624 INFO ]: Found error trace [2018-06-22 01:11:02,624 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:02,624 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:02,625 INFO ]: Analyzing trace with hash -162924212, now seen corresponding path program 12 times [2018-06-22 01:11:02,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:02,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:02,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:02,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:02,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:02,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:03,143 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:03,143 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:03,143 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:03,150 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:11:03,177 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:11:03,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:03,179 INFO ]: Computing forward predicates... [2018-06-22 01:11:03,398 INFO ]: Checked inductivity of 102 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 01:11:03,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:11:03,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 27 [2018-06-22 01:11:03,426 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:11:03,427 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:11:03,427 INFO ]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:11:03,427 INFO ]: Start difference. First operand 32 states and 37 transitions. Second operand 27 states. [2018-06-22 01:11:03,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:03,694 INFO ]: Finished difference Result 44 states and 48 transitions. [2018-06-22 01:11:03,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:11:03,694 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-22 01:11:03,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:03,694 INFO ]: With dead ends: 44 [2018-06-22 01:11:03,694 INFO ]: Without dead ends: 41 [2018-06-22 01:11:03,695 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:11:03,695 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:11:03,696 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-22 01:11:03,696 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:03,697 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-22 01:11:03,697 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2018-06-22 01:11:03,697 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:03,697 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-22 01:11:03,697 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:11:03,697 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-22 01:11:03,698 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:11:03,698 INFO ]: Found error trace [2018-06-22 01:11:03,698 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:03,698 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:03,698 INFO ]: Analyzing trace with hash 717291432, now seen corresponding path program 13 times [2018-06-22 01:11:03,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:03,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:03,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:03,699 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:03,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:03,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:04,143 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:04,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:04,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:04,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:11:04,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:04,190 INFO ]: Computing forward predicates... [2018-06-22 01:11:04,274 INFO ]: Checked inductivity of 111 backedges. 20 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:11:04,296 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:11:04,296 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 27 [2018-06-22 01:11:04,296 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:11:04,297 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:11:04,297 INFO ]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:11:04,297 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 27 states. [2018-06-22 01:11:05,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:05,204 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-22 01:11:05,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:11:05,204 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-22 01:11:05,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:05,205 INFO ]: With dead ends: 43 [2018-06-22 01:11:05,205 INFO ]: Without dead ends: 41 [2018-06-22 01:11:05,205 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:11:05,205 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:11:05,207 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-22 01:11:05,207 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:05,207 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 01:11:05,207 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-22 01:11:05,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:05,207 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 01:11:05,207 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:11:05,207 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 01:11:05,208 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:11:05,208 INFO ]: Found error trace [2018-06-22 01:11:05,208 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:05,208 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:05,208 INFO ]: Analyzing trace with hash -1278397908, now seen corresponding path program 10 times [2018-06-22 01:11:05,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:05,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:05,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:05,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:11:05,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:05,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:05,720 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:05,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:05,720 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:05,728 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:11:05,760 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:11:05,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:05,764 INFO ]: Computing forward predicates... [2018-06-22 01:11:06,497 INFO ]: Checked inductivity of 111 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:11:06,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:11:06,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 35 [2018-06-22 01:11:06,521 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:11:06,521 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:11:06,521 INFO ]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:11:06,521 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 35 states. [2018-06-22 01:11:07,944 WARN ]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-06-22 01:11:08,899 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-06-22 01:11:08,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:08,967 INFO ]: Finished difference Result 56 states and 60 transitions. [2018-06-22 01:11:08,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:11:08,967 INFO ]: Start accepts. Automaton has 35 states. Word has length 29 [2018-06-22 01:11:08,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:08,968 INFO ]: With dead ends: 56 [2018-06-22 01:11:08,968 INFO ]: Without dead ends: 56 [2018-06-22 01:11:08,969 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1211, Invalid=3619, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:11:08,969 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:11:08,970 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 32. [2018-06-22 01:11:08,970 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:08,970 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 01:11:08,971 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-22 01:11:08,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:08,971 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 01:11:08,971 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:11:08,971 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 01:11:08,971 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:11:08,971 INFO ]: Found error trace [2018-06-22 01:11:08,971 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:08,971 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:08,971 INFO ]: Analyzing trace with hash -2060794676, now seen corresponding path program 14 times [2018-06-22 01:11:08,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:08,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:08,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:08,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:08,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:08,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:09,901 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:09,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:09,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:09,911 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:11:09,935 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:11:09,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:09,938 INFO ]: Computing forward predicates... [2018-06-22 01:11:10,008 INFO ]: Checked inductivity of 121 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:11:10,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:11:10,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 27 [2018-06-22 01:11:10,031 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:11:10,031 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:11:10,031 INFO ]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:11:10,032 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 27 states. [2018-06-22 01:11:10,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:10,657 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 01:11:10,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:11:10,658 INFO ]: Start accepts. Automaton has 27 states. Word has length 30 [2018-06-22 01:11:10,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:10,658 INFO ]: With dead ends: 43 [2018-06-22 01:11:10,658 INFO ]: Without dead ends: 42 [2018-06-22 01:11:10,658 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:11:10,658 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:11:10,660 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 01:11:10,660 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:10,660 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-22 01:11:10,660 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-22 01:11:10,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:10,660 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-22 01:11:10,660 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:11:10,660 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-22 01:11:10,661 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:11:10,661 INFO ]: Found error trace [2018-06-22 01:11:10,661 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:10,661 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:10,661 INFO ]: Analyzing trace with hash -977511936, now seen corresponding path program 11 times [2018-06-22 01:11:10,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:10,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:10,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:10,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:10,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:10,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:11,112 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:11:11,372 WARN ]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:11:11,643 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:11,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:11,643 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:11,656 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:11:11,685 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:11:11,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:11,688 INFO ]: Computing forward predicates... [2018-06-22 01:11:11,945 INFO ]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:11,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:11:11,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 37 [2018-06-22 01:11:11,978 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:11:11,978 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:11:11,979 INFO ]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:11:11,979 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 37 states. [2018-06-22 01:11:12,334 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-06-22 01:11:13,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:13,660 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 01:11:13,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:11:13,660 INFO ]: Start accepts. Automaton has 37 states. Word has length 30 [2018-06-22 01:11:13,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:13,660 INFO ]: With dead ends: 43 [2018-06-22 01:11:13,660 INFO ]: Without dead ends: 43 [2018-06-22 01:11:13,661 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=642, Invalid=3018, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:11:13,661 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:11:13,662 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-06-22 01:11:13,662 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:13,662 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-22 01:11:13,662 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-22 01:11:13,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:13,662 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-22 01:11:13,662 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:11:13,662 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-22 01:11:13,662 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:11:13,662 INFO ]: Found error trace [2018-06-22 01:11:13,662 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:13,663 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:13,663 INFO ]: Analyzing trace with hash -239981396, now seen corresponding path program 12 times [2018-06-22 01:11:13,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:13,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:13,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:13,663 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:13,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:13,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:13,819 INFO ]: Checked inductivity of 132 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:11:13,819 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:13,819 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:13,828 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:11:13,855 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:11:13,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:13,856 INFO ]: Computing forward predicates... [2018-06-22 01:11:13,874 INFO ]: Checked inductivity of 132 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:11:13,894 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:11:13,894 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-22 01:11:13,894 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:11:13,895 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:11:13,895 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:11:13,895 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2018-06-22 01:11:13,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:13,913 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-22 01:11:13,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:11:13,913 INFO ]: Start accepts. Automaton has 15 states. Word has length 31 [2018-06-22 01:11:13,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:13,913 INFO ]: With dead ends: 44 [2018-06-22 01:11:13,913 INFO ]: Without dead ends: 32 [2018-06-22 01:11:13,913 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:11:13,914 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:11:13,914 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:11:13,914 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:11:13,915 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-22 01:11:13,915 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 31 [2018-06-22 01:11:13,915 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:13,915 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-22 01:11:13,915 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:11:13,915 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-22 01:11:13,915 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:11:13,915 INFO ]: Found error trace [2018-06-22 01:11:13,915 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:13,915 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:13,915 INFO ]: Analyzing trace with hash 2012849192, now seen corresponding path program 15 times [2018-06-22 01:11:13,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:13,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:13,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:13,916 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:13,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:13,926 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:14,267 INFO ]: Checked inductivity of 132 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:11:14,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:14,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:14,273 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:11:14,310 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:11:14,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:14,312 INFO ]: Computing forward predicates... [2018-06-22 01:11:14,559 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:11:14,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:11:14,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 29 [2018-06-22 01:11:14,581 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:11:14,581 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:11:14,581 INFO ]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:11:14,581 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-22 01:11:15,315 WARN ]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-06-22 01:11:15,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:15,764 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-22 01:11:15,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:11:15,765 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-22 01:11:15,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:15,765 INFO ]: With dead ends: 34 [2018-06-22 01:11:15,765 INFO ]: Without dead ends: 33 [2018-06-22 01:11:15,765 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:11:15,765 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:11:15,766 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:11:15,766 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:11:15,766 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-22 01:11:15,766 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-22 01:11:15,766 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:15,766 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-22 01:11:15,766 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:11:15,766 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-22 01:11:15,767 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:11:15,767 INFO ]: Found error trace [2018-06-22 01:11:15,767 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:11:15,767 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:11:15,767 INFO ]: Analyzing trace with hash -553209780, now seen corresponding path program 16 times [2018-06-22 01:11:15,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:11:15,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:11:15,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:15,767 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:11:15,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:11:15,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:15,868 INFO ]: Checked inductivity of 144 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:11:15,869 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:11:15,869 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) [2018-06-22 01:11:15,884 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:11:15,911 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:11:15,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:11:15,913 INFO ]: Computing forward predicates... [2018-06-22 01:11:15,928 INFO ]: Checked inductivity of 144 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 01:11:15,949 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:11:15,949 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-22 01:11:15,949 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:11:15,949 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:11:15,949 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:11:15,949 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 15 states. [2018-06-22 01:11:15,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:11:15,964 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-22 01:11:15,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:11:15,964 INFO ]: Start accepts. Automaton has 15 states. Word has length 32 [2018-06-22 01:11:15,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:11:15,964 INFO ]: With dead ends: 17 [2018-06-22 01:11:15,964 INFO ]: Without dead ends: 0 [2018-06-22 01:11:15,965 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:11:15,965 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:11:15,965 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:11:15,965 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:11:15,965 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:11:15,965 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-06-22 01:11:15,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:11:15,965 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:11:15,965 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:11:15,965 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:11:15,965 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:11:15,969 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:11:15 BoogieIcfgContainer [2018-06-22 01:11:15,969 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:11:15,970 INFO ]: Toolchain (without parser) took 58706.76 ms. Allocated memory was 308.8 MB in the beginning and 544.7 MB in the end (delta: 235.9 MB). Free memory was 266.2 MB in the beginning and 323.6 MB in the end (delta: -57.4 MB). Peak memory consumption was 178.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:11:15,970 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:11:15,971 INFO ]: ChcToBoogie took 66.65 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:11:15,971 INFO ]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 262.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:11:15,971 INFO ]: RCFGBuilder took 157.33 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 255.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:11:15,972 INFO ]: TraceAbstraction took 58423.79 ms. Allocated memory was 308.8 MB in the beginning and 544.7 MB in the end (delta: 235.9 MB). Free memory was 254.2 MB in the beginning and 323.6 MB in the end (delta: -69.4 MB). Peak memory consumption was 166.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:11:15,974 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.65 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 262.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 157.33 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 255.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58423.79 ms. Allocated memory was 308.8 MB in the beginning and 544.7 MB in the end (delta: 235.9 MB). Free memory was 254.2 MB in the beginning and 323.6 MB in the end (delta: -69.4 MB). Peak memory consumption was 166.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. SAFE Result, 58.3s OverallTime, 32 OverallIterations, 12 TraceHistogramMax, 34.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 350 SDtfs, 1086 SDslu, 3459 SDs, 0 SdLazy, 4867 SolverSat, 2042 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1591 GetRequests, 476 SyntacticMatches, 63 SemanticMatches, 1052 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9713 ImplicationChecksByTransitivity, 45.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=31, 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, 32 MinimizatonAttempts, 521 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 1335 NumberOfCodeBlocks, 1335 NumberOfCodeBlocksAsserted, 132 NumberOfCheckSat, 1274 ConstructedInterpolants, 0 QuantifiedInterpolants, 126761 SizeOfPredicates, 102 NumberOfNonLiveVariables, 4656 ConjunctsInSsa, 1705 ConjunctsInUnsatCore, 61 InterpolantComputations, 5 PerfectInterpolantSequences, 1485/3916 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-11-15-983.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-11-15-983.csv Received shutdown request...