java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:03:50,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:03:50,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:03:50,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:03:50,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:03:50,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:03:50,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:03:50,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:03:50,798 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:03:50,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:03:50,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:03:50,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:03:50,800 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:03:50,801 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:03:50,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:03:50,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:03:50,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:03:50,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:03:50,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:03:50,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:03:50,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:03:50,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:03:50,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:03:50,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:03:50,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:03:50,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:03:50,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:03:50,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:03:50,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:03:50,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:03:50,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:03:50,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:03:50,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:03:50,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:03:50,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:03:50,822 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:03:50,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:03:50,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:03:50,837 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:03:50,837 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:03:50,838 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:03:50,839 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:03:50,839 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:03:50,839 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:03:50,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:03:50,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:03:50,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:03:50,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:03:50,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:03:50,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:03:50,841 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:03:50,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:03:50,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:03:50,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:03:50,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:03:50,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:03:50,843 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:03:50,844 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:03:50,844 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:03:50,881 INFO ]: Repository-Root is: /tmp [2018-06-25 09:03:50,899 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:03:50,902 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:03:50,904 INFO ]: Initializing SmtParser... [2018-06-25 09:03:50,904 INFO ]: SmtParser initialized [2018-06-25 09:03:50,905 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 [2018-06-25 09:03:50,906 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:03:51,003 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 unknown [2018-06-25 09:03:51,212 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 [2018-06-25 09:03:51,216 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:03:51,225 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:03:51,226 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:03:51,226 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:03:51,226 INFO ]: ChcToBoogie initialized [2018-06-25 09:03:51,230 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,292 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51 Unit [2018-06-25 09:03:51,292 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:03:51,293 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:03:51,295 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:03:51,295 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:03:51,315 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,315 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,321 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,321 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,325 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,327 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,328 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (1/1) ... [2018-06-25 09:03:51,329 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:03:51,330 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:03:51,330 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:03:51,330 INFO ]: RCFGBuilder initialized [2018-06-25 09:03:51,331 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (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-25 09:03:51,350 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:03:51,350 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:03:51,350 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:03:51,350 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:03:51,350 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:03:51,350 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-25 09:03:51,626 INFO ]: Using library mode [2018-06-25 09:03:51,626 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:03:51 BoogieIcfgContainer [2018-06-25 09:03:51,627 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:03:51,632 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:03:51,632 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:03:51,639 INFO ]: TraceAbstraction initialized [2018-06-25 09:03:51,639 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:03:51" (1/3) ... [2018-06-25 09:03:51,640 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e46250a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:03:51, skipping insertion in model container [2018-06-25 09:03:51,640 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:51" (2/3) ... [2018-06-25 09:03:51,640 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e46250a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:03:51, skipping insertion in model container [2018-06-25 09:03:51,641 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:03:51" (3/3) ... [2018-06-25 09:03:51,645 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:03:51,653 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:03:51,659 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:03:51,700 INFO ]: Using default assertion order modulation [2018-06-25 09:03:51,700 INFO ]: Interprodecural is true [2018-06-25 09:03:51,700 INFO ]: Hoare is false [2018-06-25 09:03:51,700 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:03:51,700 INFO ]: Backedges is TWOTRACK [2018-06-25 09:03:51,700 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:03:51,700 INFO ]: Difference is false [2018-06-25 09:03:51,700 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:03:51,700 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:03:51,711 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:03:51,724 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:03:51,724 INFO ]: Found error trace [2018-06-25 09:03:51,725 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:51,726 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:51,731 INFO ]: Analyzing trace with hash -204783142, now seen corresponding path program 1 times [2018-06-25 09:03:51,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:51,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:51,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:51,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:51,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:51,835 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:51,965 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:51,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:51,967 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:51,969 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:51,979 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:51,980 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:51,981 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:03:52,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:52,043 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:03:52,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:52,044 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:03:52,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:52,055 INFO ]: With dead ends: 9 [2018-06-25 09:03:52,055 INFO ]: Without dead ends: 9 [2018-06-25 09:03:52,057 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:52,074 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:03:52,092 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:03:52,093 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:03:52,094 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:03:52,095 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:03:52,096 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:52,096 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:03:52,096 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:52,096 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:03:52,096 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:52,096 INFO ]: Found error trace [2018-06-25 09:03:52,096 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:52,096 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:52,096 INFO ]: Analyzing trace with hash -2057218350, now seen corresponding path program 1 times [2018-06-25 09:03:52,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:52,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:52,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:52,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:52,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:52,137 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:52,294 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:52,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:52,294 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:03:52,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:52,367 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:52,376 INFO ]: Computing forward predicates... [2018-06-25 09:03:52,502 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:52,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:52,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:03:52,538 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:03:52,538 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:03:52,538 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:52,538 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2018-06-25 09:03:52,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:52,831 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 09:03:52,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:03:52,832 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:03:52,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:52,832 INFO ]: With dead ends: 10 [2018-06-25 09:03:52,832 INFO ]: Without dead ends: 10 [2018-06-25 09:03:52,833 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:52,833 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:03:52,834 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:03:52,834 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:03:52,835 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-25 09:03:52,835 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-25 09:03:52,835 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:52,835 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-25 09:03:52,835 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:03:52,835 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-25 09:03:52,836 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:52,836 INFO ]: Found error trace [2018-06-25 09:03:52,836 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:52,836 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:52,836 INFO ]: Analyzing trace with hash -2050753703, now seen corresponding path program 1 times [2018-06-25 09:03:52,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:52,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:52,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:52,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:52,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:52,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:52,899 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:52,899 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:52,899 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:52,900 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:52,900 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:52,900 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:52,900 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2018-06-25 09:03:52,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:52,996 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 09:03:52,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:52,997 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:03:52,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:52,997 INFO ]: With dead ends: 11 [2018-06-25 09:03:52,997 INFO ]: Without dead ends: 10 [2018-06-25 09:03:52,998 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:52,998 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:03:52,999 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:03:52,999 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:03:52,999 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:03:53,000 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-25 09:03:53,000 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:53,000 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:03:53,000 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:53,000 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:03:53,000 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:53,000 INFO ]: Found error trace [2018-06-25 09:03:53,000 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:53,000 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:53,000 INFO ]: Analyzing trace with hash -2048906661, now seen corresponding path program 1 times [2018-06-25 09:03:53,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:53,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:53,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:53,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,029 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,131 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:53,131 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:53,131 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:53,132 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:53,132 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:53,132 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:53,132 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 3 states. [2018-06-25 09:03:53,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:53,215 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 09:03:53,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:53,216 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:03:53,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:53,216 INFO ]: With dead ends: 11 [2018-06-25 09:03:53,216 INFO ]: Without dead ends: 10 [2018-06-25 09:03:53,216 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:53,216 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:03:53,217 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:03:53,218 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:03:53,218 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-25 09:03:53,218 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-25 09:03:53,218 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:53,218 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-25 09:03:53,218 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:53,218 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-25 09:03:53,218 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:03:53,218 INFO ]: Found error trace [2018-06-25 09:03:53,218 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:53,218 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:53,219 INFO ]: Analyzing trace with hash 646832346, now seen corresponding path program 2 times [2018-06-25 09:03:53,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:53,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:53,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:53,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,266 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,432 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:53,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:53,432 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:53,451 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:03:53,545 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:03:53,545 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:53,548 INFO ]: Computing forward predicates... [2018-06-25 09:03:53,694 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:53,718 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:53,718 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:03:53,718 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:03:53,718 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:03:53,719 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:53,719 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-25 09:03:53,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:53,867 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-25 09:03:53,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:53,867 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:03:53,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:53,867 INFO ]: With dead ends: 11 [2018-06-25 09:03:53,867 INFO ]: Without dead ends: 11 [2018-06-25 09:03:53,868 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:53,868 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:03:53,869 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:03:53,869 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:03:53,869 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-25 09:03:53,869 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-25 09:03:53,869 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:53,869 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-25 09:03:53,869 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:03:53,869 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-25 09:03:53,870 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:03:53,870 INFO ]: Found error trace [2018-06-25 09:03:53,870 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:53,870 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:53,870 INFO ]: Analyzing trace with hash -1426941998, now seen corresponding path program 3 times [2018-06-25 09:03:53,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:53,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:53,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,871 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:53,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:53,904 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:54,180 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:54,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:54,180 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:54,190 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:03:54,261 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:03:54,261 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:54,265 INFO ]: Computing forward predicates... [2018-06-25 09:03:54,593 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:54,630 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:54,630 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 09:03:54,630 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:03:54,630 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:03:54,631 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:54,631 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-06-25 09:03:54,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:54,797 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-25 09:03:54,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:03:54,799 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-25 09:03:54,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:54,800 INFO ]: With dead ends: 12 [2018-06-25 09:03:54,800 INFO ]: Without dead ends: 12 [2018-06-25 09:03:54,800 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:54,800 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:03:54,801 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:03:54,801 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:03:54,802 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-25 09:03:54,802 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-25 09:03:54,802 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:54,802 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-25 09:03:54,802 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:03:54,802 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-25 09:03:54,802 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:03:54,802 INFO ]: Found error trace [2018-06-25 09:03:54,802 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:54,802 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:54,803 INFO ]: Analyzing trace with hash -1289437222, now seen corresponding path program 4 times [2018-06-25 09:03:54,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:54,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:54,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:54,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:54,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:54,837 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:55,244 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:55,245 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:55,245 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:55,254 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:03:55,313 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:03:55,313 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:55,318 INFO ]: Computing forward predicates... [2018-06-25 09:03:55,668 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:55,687 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:55,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 09:03:55,688 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:03:55,688 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:03:55,688 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:03:55,688 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-06-25 09:03:55,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:55,763 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-25 09:03:55,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:03:55,764 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 09:03:55,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:55,764 INFO ]: With dead ends: 13 [2018-06-25 09:03:55,764 INFO ]: Without dead ends: 13 [2018-06-25 09:03:55,765 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:03:55,765 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:03:55,766 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:03:55,766 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:03:55,766 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-25 09:03:55,767 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-25 09:03:55,767 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:55,767 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-25 09:03:55,767 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:03:55,767 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-25 09:03:55,767 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:03:55,767 INFO ]: Found error trace [2018-06-25 09:03:55,767 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:55,767 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:55,767 INFO ]: Analyzing trace with hash -1321756462, now seen corresponding path program 5 times [2018-06-25 09:03:55,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:55,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:55,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:55,768 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:55,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:55,828 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:56,006 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:56,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:56,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:56,019 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:03:56,093 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:03:56,093 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:56,097 INFO ]: Computing forward predicates... [2018-06-25 09:03:56,245 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:56,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:56,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 09:03:56,277 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:03:56,277 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:03:56,277 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:03:56,277 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-06-25 09:03:56,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:56,394 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-25 09:03:56,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:03:56,395 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:03:56,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:56,395 INFO ]: With dead ends: 14 [2018-06-25 09:03:56,395 INFO ]: Without dead ends: 14 [2018-06-25 09:03:56,395 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:03:56,395 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:03:56,397 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:03:56,397 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:03:56,397 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-25 09:03:56,397 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-25 09:03:56,397 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:56,397 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-25 09:03:56,397 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:03:56,397 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-25 09:03:56,397 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:03:56,397 INFO ]: Found error trace [2018-06-25 09:03:56,397 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:56,398 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:56,398 INFO ]: Analyzing trace with hash 1971314394, now seen corresponding path program 6 times [2018-06-25 09:03:56,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:56,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:56,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:56,398 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:56,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:56,431 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:56,638 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:56,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:56,638 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:56,644 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:03:56,729 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:03:56,729 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:56,734 INFO ]: Computing forward predicates... [2018-06-25 09:03:56,928 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:56,953 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:56,953 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:03:56,954 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:03:56,954 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:03:56,954 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:03:56,954 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-06-25 09:03:57,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:57,048 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-25 09:03:57,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:03:57,048 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-25 09:03:57,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:57,048 INFO ]: With dead ends: 15 [2018-06-25 09:03:57,048 INFO ]: Without dead ends: 15 [2018-06-25 09:03:57,048 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:03:57,048 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:03:57,050 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:03:57,050 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:03:57,050 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-25 09:03:57,051 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-25 09:03:57,051 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:57,051 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-25 09:03:57,051 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:03:57,051 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-25 09:03:57,051 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:03:57,051 INFO ]: Found error trace [2018-06-25 09:03:57,051 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:57,051 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:57,051 INFO ]: Analyzing trace with hash 977295826, now seen corresponding path program 7 times [2018-06-25 09:03:57,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:57,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:57,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:57,052 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:57,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:57,080 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:57,392 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:57,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:57,393 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:57,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:57,458 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:57,464 INFO ]: Computing forward predicates... [2018-06-25 09:03:57,681 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:57,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:57,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-25 09:03:57,701 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:03:57,701 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:03:57,701 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:03:57,701 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-25 09:03:57,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:57,815 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-25 09:03:57,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:03:57,815 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 09:03:57,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:57,815 INFO ]: With dead ends: 16 [2018-06-25 09:03:57,815 INFO ]: Without dead ends: 16 [2018-06-25 09:03:57,816 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:03:57,816 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:03:57,817 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:03:57,817 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:03:57,817 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-25 09:03:57,817 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-25 09:03:57,818 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:57,818 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-25 09:03:57,818 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:03:57,818 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-25 09:03:57,818 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:03:57,818 INFO ]: Found error trace [2018-06-25 09:03:57,818 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:57,818 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:57,818 INFO ]: Analyzing trace with hash 227491290, now seen corresponding path program 8 times [2018-06-25 09:03:57,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:57,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:57,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:57,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:57,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:57,859 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,094 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:58,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:58,095 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-25 09:03:58,101 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:03:58,164 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:03:58,164 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,170 INFO ]: Computing forward predicates... [2018-06-25 09:03:58,285 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:58,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:58,305 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-25 09:03:58,305 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:03:58,305 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:03:58,305 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:03:58,305 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2018-06-25 09:03:58,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:58,434 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-25 09:03:58,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:03:58,434 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 09:03:58,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:58,435 INFO ]: With dead ends: 17 [2018-06-25 09:03:58,435 INFO ]: Without dead ends: 17 [2018-06-25 09:03:58,436 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:03:58,436 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:03:58,437 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:03:58,437 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:03:58,438 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-25 09:03:58,438 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-25 09:03:58,438 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:58,438 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-25 09:03:58,438 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:03:58,438 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-25 09:03:58,438 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:03:58,438 INFO ]: Found error trace [2018-06-25 09:03:58,439 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:58,439 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:58,439 INFO ]: Analyzing trace with hash -1541612846, now seen corresponding path program 9 times [2018-06-25 09:03:58,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:58,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:58,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:58,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:58,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:58,486 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,730 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:58,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:58,730 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:58,737 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:03:58,844 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:03:58,844 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:58,851 INFO ]: Computing forward predicates... [2018-06-25 09:03:58,982 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:59,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:59,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-25 09:03:59,001 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:03:59,002 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:03:59,002 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:03:59,002 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-25 09:03:59,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:59,098 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-25 09:03:59,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:03:59,098 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-25 09:03:59,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:59,098 INFO ]: With dead ends: 18 [2018-06-25 09:03:59,098 INFO ]: Without dead ends: 18 [2018-06-25 09:03:59,099 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:03:59,099 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:03:59,100 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:03:59,100 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:03:59,101 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-25 09:03:59,101 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-25 09:03:59,101 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:59,101 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-25 09:03:59,101 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:03:59,101 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-25 09:03:59,101 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:03:59,101 INFO ]: Found error trace [2018-06-25 09:03:59,101 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:59,101 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:59,103 INFO ]: Analyzing trace with hash -549266214, now seen corresponding path program 10 times [2018-06-25 09:03:59,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:59,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:59,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:59,104 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:59,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:59,141 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:59,429 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:59,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:59,429 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) [2018-06-25 09:03:59,446 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:59,515 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:03:59,515 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:59,521 INFO ]: Computing forward predicates... [2018-06-25 09:03:59,677 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:59,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:03:59,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-25 09:03:59,696 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:03:59,696 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:03:59,696 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:03:59,696 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-25 09:03:59,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:59,795 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-25 09:03:59,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:03:59,796 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-25 09:03:59,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:59,797 INFO ]: With dead ends: 19 [2018-06-25 09:03:59,797 INFO ]: Without dead ends: 19 [2018-06-25 09:03:59,797 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:03:59,797 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:03:59,799 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:03:59,799 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:03:59,799 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-25 09:03:59,799 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-25 09:03:59,799 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:59,799 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-25 09:03:59,799 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:03:59,799 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-25 09:03:59,800 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:03:59,800 INFO ]: Found error trace [2018-06-25 09:03:59,800 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:59,800 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:59,800 INFO ]: Analyzing trace with hash 148708306, now seen corresponding path program 11 times [2018-06-25 09:03:59,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:59,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:59,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:59,800 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:03:59,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:59,828 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:00,690 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:00,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:00,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:00,696 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:00,768 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:04:00,768 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:00,773 INFO ]: Computing forward predicates... [2018-06-25 09:04:00,812 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:00,832 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:00,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-25 09:04:00,833 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:04:00,833 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:04:00,833 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:04:00,833 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 15 states. [2018-06-25 09:04:01,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:01,095 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-25 09:04:01,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:04:01,113 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-25 09:04:01,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:01,113 INFO ]: With dead ends: 20 [2018-06-25 09:04:01,113 INFO ]: Without dead ends: 20 [2018-06-25 09:04:01,113 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:04:01,113 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:04:01,115 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:04:01,115 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:04:01,115 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-25 09:04:01,115 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-25 09:04:01,115 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:01,115 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-25 09:04:01,115 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:04:01,115 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-25 09:04:01,116 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:04:01,119 INFO ]: Found error trace [2018-06-25 09:04:01,119 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:01,119 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:01,119 INFO ]: Analyzing trace with hash 311081946, now seen corresponding path program 12 times [2018-06-25 09:04:01,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:01,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:01,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:01,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:01,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:01,163 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:01,509 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:01,509 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:01,509 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:01,515 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:01,586 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:04:01,586 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:01,593 INFO ]: Computing forward predicates... [2018-06-25 09:04:01,750 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:01,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:01,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-25 09:04:01,770 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:04:01,770 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:04:01,770 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:04:01,770 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-25 09:04:01,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:01,960 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-25 09:04:01,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:04:01,961 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-25 09:04:01,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:01,961 INFO ]: With dead ends: 21 [2018-06-25 09:04:01,961 INFO ]: Without dead ends: 21 [2018-06-25 09:04:01,961 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:04:01,961 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:04:01,963 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:04:01,963 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:04:01,963 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-25 09:04:01,963 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-25 09:04:01,963 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:01,963 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-25 09:04:01,963 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:04:01,963 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-25 09:04:01,964 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:04:01,964 INFO ]: Found error trace [2018-06-25 09:04:01,964 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:01,964 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:01,964 INFO ]: Analyzing trace with hash 1049697490, now seen corresponding path program 13 times [2018-06-25 09:04:01,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:01,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:01,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:01,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:01,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:02,021 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:03,872 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:03,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:03,872 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:03,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:03,989 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:03,998 INFO ]: Computing forward predicates... [2018-06-25 09:04:04,280 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:04,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:04,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-06-25 09:04:04,304 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:04:04,304 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:04:04,305 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:04:04,305 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-25 09:04:04,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:04,658 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-25 09:04:04,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:04:04,658 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-25 09:04:04,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:04,658 INFO ]: With dead ends: 22 [2018-06-25 09:04:04,658 INFO ]: Without dead ends: 22 [2018-06-25 09:04:04,659 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:04:04,659 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:04:04,660 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:04:04,660 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:04:04,661 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-25 09:04:04,661 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-25 09:04:04,661 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:04,661 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-25 09:04:04,661 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:04:04,661 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-25 09:04:04,661 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:04:04,661 INFO ]: Found error trace [2018-06-25 09:04:04,661 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:04,662 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:04,662 INFO ]: Analyzing trace with hash -1823024422, now seen corresponding path program 14 times [2018-06-25 09:04:04,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:04,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:04,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:04,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:04,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:04,775 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:05,505 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:05,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:05,506 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:05,512 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:05,603 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:05,603 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:05,613 INFO ]: Computing forward predicates... [2018-06-25 09:04:06,043 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:06,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:06,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-06-25 09:04:06,073 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:04:06,073 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:04:06,073 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:04:06,074 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-25 09:04:06,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:06,294 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-25 09:04:06,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:04:06,294 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-25 09:04:06,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:06,295 INFO ]: With dead ends: 23 [2018-06-25 09:04:06,295 INFO ]: Without dead ends: 23 [2018-06-25 09:04:06,295 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:04:06,295 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:04:06,297 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:04:06,297 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:04:06,297 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-25 09:04:06,297 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-25 09:04:06,298 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:06,298 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-25 09:04:06,298 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:04:06,298 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-25 09:04:06,298 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:04:06,298 INFO ]: Found error trace [2018-06-25 09:04:06,298 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:06,298 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:06,298 INFO ]: Analyzing trace with hash -683090478, now seen corresponding path program 15 times [2018-06-25 09:04:06,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:06,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:06,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:06,299 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:06,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:06,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:06,736 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:06,736 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:06,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:06,744 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:06,843 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:04:06,843 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:06,851 INFO ]: Computing forward predicates... [2018-06-25 09:04:07,385 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:07,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:07,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-06-25 09:04:07,407 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:04:07,407 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:04:07,407 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:04:07,408 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-25 09:04:07,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:07,598 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-25 09:04:07,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:04:07,598 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-25 09:04:07,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:07,599 INFO ]: With dead ends: 24 [2018-06-25 09:04:07,599 INFO ]: Without dead ends: 24 [2018-06-25 09:04:07,599 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:04:07,599 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:04:07,601 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:04:07,601 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:04:07,601 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-25 09:04:07,601 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-25 09:04:07,601 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:07,601 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-25 09:04:07,601 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:04:07,601 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-25 09:04:07,603 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:04:07,603 INFO ]: Found error trace [2018-06-25 09:04:07,603 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:07,603 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:07,603 INFO ]: Analyzing trace with hash 295123418, now seen corresponding path program 16 times [2018-06-25 09:04:07,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:07,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:07,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:07,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:07,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:07,733 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:08,186 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:08,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:08,186 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:08,191 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:08,287 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:08,287 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:08,295 INFO ]: Computing forward predicates... [2018-06-25 09:04:08,470 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:08,490 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:08,490 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-25 09:04:08,490 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:04:08,490 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:04:08,490 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:04:08,491 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-25 09:04:08,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:08,754 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-25 09:04:08,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:04:08,754 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-25 09:04:08,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:08,755 INFO ]: With dead ends: 25 [2018-06-25 09:04:08,755 INFO ]: Without dead ends: 25 [2018-06-25 09:04:08,755 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:04:08,755 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:04:08,756 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:04:08,756 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:04:08,757 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-25 09:04:08,757 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-25 09:04:08,757 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:08,757 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-25 09:04:08,757 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:04:08,757 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-25 09:04:08,758 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:04:08,758 INFO ]: Found error trace [2018-06-25 09:04:08,758 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:08,758 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:08,758 INFO ]: Analyzing trace with hash 554983122, now seen corresponding path program 17 times [2018-06-25 09:04:08,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:08,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:08,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:08,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:08,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:08,877 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:09,612 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:09,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:09,612 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:09,617 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:09,722 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-25 09:04:09,722 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:09,733 INFO ]: Computing forward predicates... [2018-06-25 09:04:09,953 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:09,973 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:09,973 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-06-25 09:04:09,973 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:04:09,973 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:04:09,973 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:04:09,973 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-25 09:04:10,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:10,219 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-25 09:04:10,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:04:10,219 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-25 09:04:10,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:10,219 INFO ]: With dead ends: 26 [2018-06-25 09:04:10,219 INFO ]: Without dead ends: 26 [2018-06-25 09:04:10,219 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:04:10,220 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:04:10,221 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 09:04:10,221 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:04:10,222 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-25 09:04:10,222 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-25 09:04:10,222 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:10,222 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-25 09:04:10,222 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:04:10,222 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-25 09:04:10,222 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:04:10,222 INFO ]: Found error trace [2018-06-25 09:04:10,222 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:10,222 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:10,222 INFO ]: Analyzing trace with hash 20699354, now seen corresponding path program 18 times [2018-06-25 09:04:10,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:10,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:10,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:10,223 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:10,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:10,362 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:11,086 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:11,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:11,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:11,092 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:11,262 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 09:04:11,262 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:11,270 INFO ]: Computing forward predicates... [2018-06-25 09:04:11,451 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:11,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:11,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-25 09:04:11,471 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:04:11,472 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:04:11,472 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:04:11,472 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-25 09:04:11,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:11,750 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-25 09:04:11,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:04:11,756 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-25 09:04:11,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:11,756 INFO ]: With dead ends: 27 [2018-06-25 09:04:11,756 INFO ]: Without dead ends: 27 [2018-06-25 09:04:11,757 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:04:11,757 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:04:11,758 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 09:04:11,758 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:04:11,759 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-25 09:04:11,759 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-25 09:04:11,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:11,759 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-25 09:04:11,759 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:04:11,759 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-25 09:04:11,759 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:04:11,759 INFO ]: Found error trace [2018-06-25 09:04:11,759 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:11,759 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:11,760 INFO ]: Analyzing trace with hash 637771730, now seen corresponding path program 19 times [2018-06-25 09:04:11,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:11,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:11,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:11,760 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:11,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:11,925 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:12,465 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:12,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:12,465 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:12,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:12,590 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:12,598 INFO ]: Computing forward predicates... [2018-06-25 09:04:12,850 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:12,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:12,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-06-25 09:04:12,871 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:04:12,871 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:04:12,871 INFO ]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:04:12,871 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-25 09:04:13,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:13,213 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-25 09:04:13,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:04:13,215 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-25 09:04:13,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:13,216 INFO ]: With dead ends: 28 [2018-06-25 09:04:13,216 INFO ]: Without dead ends: 28 [2018-06-25 09:04:13,216 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:04:13,216 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:04:13,218 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 09:04:13,218 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:04:13,218 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-25 09:04:13,218 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-25 09:04:13,218 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:13,218 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-25 09:04:13,218 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:04:13,218 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-25 09:04:13,219 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:04:13,219 INFO ]: Found error trace [2018-06-25 09:04:13,219 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:13,219 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:13,219 INFO ]: Analyzing trace with hash -1707821094, now seen corresponding path program 20 times [2018-06-25 09:04:13,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:13,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:13,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:13,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:13,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:13,403 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:14,118 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:14,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:14,118 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:14,124 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:14,258 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:14,258 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:14,269 INFO ]: Computing forward predicates... [2018-06-25 09:04:14,560 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:14,579 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:14,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-25 09:04:14,580 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:04:14,580 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:04:14,580 INFO ]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:04:14,580 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-25 09:04:15,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:15,263 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-25 09:04:15,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:04:15,265 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-25 09:04:15,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:15,265 INFO ]: With dead ends: 29 [2018-06-25 09:04:15,265 INFO ]: Without dead ends: 29 [2018-06-25 09:04:15,266 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:04:15,266 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:04:15,269 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:04:15,269 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:04:15,270 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-25 09:04:15,270 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-25 09:04:15,270 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:15,270 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-25 09:04:15,270 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:04:15,270 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-25 09:04:15,270 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:04:15,270 INFO ]: Found error trace [2018-06-25 09:04:15,270 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:15,270 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:15,270 INFO ]: Analyzing trace with hash -1406754606, now seen corresponding path program 21 times [2018-06-25 09:04:15,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:15,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:15,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:15,271 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:15,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:15,548 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:16,887 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:16,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:16,887 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:16,895 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:17,025 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-25 09:04:17,025 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:17,034 INFO ]: Computing forward predicates... [2018-06-25 09:04:17,298 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:17,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:17,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-25 09:04:17,319 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:04:17,319 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:04:17,319 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:04:17,319 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-25 09:04:17,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:17,635 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-25 09:04:17,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:04:17,636 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-25 09:04:17,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:17,637 INFO ]: With dead ends: 30 [2018-06-25 09:04:17,637 INFO ]: Without dead ends: 30 [2018-06-25 09:04:17,637 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:04:17,637 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:04:17,639 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 09:04:17,639 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:04:17,639 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-25 09:04:17,640 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-25 09:04:17,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:17,640 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-25 09:04:17,640 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:04:17,640 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-25 09:04:17,640 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:04:17,640 INFO ]: Found error trace [2018-06-25 09:04:17,640 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:17,640 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:17,640 INFO ]: Analyzing trace with hash -663628070, now seen corresponding path program 22 times [2018-06-25 09:04:17,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:17,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:17,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:17,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:17,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:17,898 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:18,481 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:18,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:18,481 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:18,490 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:18,640 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:18,640 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:18,649 INFO ]: Computing forward predicates... [2018-06-25 09:04:19,181 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:19,201 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:19,201 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-06-25 09:04:19,201 INFO ]: Interpolant automaton has 27 states [2018-06-25 09:04:19,201 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-25 09:04:19,201 INFO ]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:04:19,201 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-25 09:04:19,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:19,751 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-25 09:04:19,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:04:19,751 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-25 09:04:19,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:19,752 INFO ]: With dead ends: 31 [2018-06-25 09:04:19,752 INFO ]: Without dead ends: 31 [2018-06-25 09:04:19,752 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:04:19,752 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:04:19,754 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 09:04:19,754 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:04:19,754 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-25 09:04:19,754 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-25 09:04:19,754 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:19,754 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-25 09:04:19,754 INFO ]: Interpolant automaton has 27 states. [2018-06-25 09:04:19,754 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-25 09:04:19,755 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:04:19,755 INFO ]: Found error trace [2018-06-25 09:04:19,755 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:19,755 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:19,755 INFO ]: Analyzing trace with hash 898458066, now seen corresponding path program 23 times [2018-06-25 09:04:19,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:19,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:19,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:19,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:19,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:19,989 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:21,058 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:21,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:21,058 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:21,064 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:21,240 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-25 09:04:21,240 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:21,254 INFO ]: Computing forward predicates... [2018-06-25 09:04:21,581 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:21,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:21,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-06-25 09:04:21,601 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:04:21,602 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:04:21,602 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:04:21,602 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-25 09:04:21,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:21,980 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-25 09:04:21,980 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:04:21,980 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-25 09:04:21,980 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:21,981 INFO ]: With dead ends: 32 [2018-06-25 09:04:21,981 INFO ]: Without dead ends: 32 [2018-06-25 09:04:21,981 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:04:21,981 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:04:21,983 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-25 09:04:21,983 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:04:21,983 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-25 09:04:21,983 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-25 09:04:21,983 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:21,983 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-25 09:04:21,983 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:04:21,983 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-25 09:04:21,984 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:04:21,984 INFO ]: Found error trace [2018-06-25 09:04:21,984 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:21,984 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:21,984 INFO ]: Analyzing trace with hash 2078488026, now seen corresponding path program 24 times [2018-06-25 09:04:21,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:21,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:21,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:21,985 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:21,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:22,254 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:22,853 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:22,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:22,853 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:22,864 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:23,012 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-25 09:04:23,012 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:23,024 INFO ]: Computing forward predicates... [2018-06-25 09:04:23,315 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:23,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:23,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-25 09:04:23,335 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:04:23,335 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:04:23,335 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:04:23,335 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-25 09:04:23,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:23,748 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-25 09:04:23,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:04:23,749 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-25 09:04:23,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:23,749 INFO ]: With dead ends: 33 [2018-06-25 09:04:23,749 INFO ]: Without dead ends: 33 [2018-06-25 09:04:23,749 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:04:23,749 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:04:23,751 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 09:04:23,751 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:04:23,751 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-25 09:04:23,752 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-25 09:04:23,752 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:23,752 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-25 09:04:23,752 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:04:23,752 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-25 09:04:23,753 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:04:23,753 INFO ]: Found error trace [2018-06-25 09:04:23,753 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:23,753 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:23,753 INFO ]: Analyzing trace with hash 4711122, now seen corresponding path program 25 times [2018-06-25 09:04:23,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:23,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:23,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:23,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:23,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:23,996 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:25,689 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:25,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:25,689 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-25 09:04:25,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:25,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:25,891 INFO ]: Computing forward predicates... [2018-06-25 09:04:26,298 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:26,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:26,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2018-06-25 09:04:26,319 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:04:26,319 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:04:26,319 INFO ]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:04:26,319 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-25 09:04:26,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:26,753 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-25 09:04:26,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:04:26,754 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-25 09:04:26,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:26,754 INFO ]: With dead ends: 34 [2018-06-25 09:04:26,754 INFO ]: Without dead ends: 34 [2018-06-25 09:04:26,754 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:04:26,754 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:04:26,755 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 09:04:26,755 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:04:26,756 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-25 09:04:26,756 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-25 09:04:26,756 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:26,756 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-25 09:04:26,756 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:04:26,756 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-25 09:04:26,756 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:04:26,756 INFO ]: Found error trace [2018-06-25 09:04:26,756 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:26,756 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:26,756 INFO ]: Analyzing trace with hash 142136538, now seen corresponding path program 26 times [2018-06-25 09:04:26,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:26,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:26,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:26,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:26,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:26,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:27,766 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:27,766 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:27,766 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:27,772 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:27,959 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:27,959 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:27,976 INFO ]: Computing forward predicates... [2018-06-25 09:04:28,266 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:28,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:28,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-06-25 09:04:28,286 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:04:28,286 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:04:28,286 INFO ]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:04:28,286 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-25 09:04:28,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:28,757 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-25 09:04:28,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:04:28,758 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-25 09:04:28,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:28,758 INFO ]: With dead ends: 35 [2018-06-25 09:04:28,758 INFO ]: Without dead ends: 35 [2018-06-25 09:04:28,759 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:04:28,759 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:04:28,760 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-25 09:04:28,760 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:04:28,761 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-25 09:04:28,761 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-25 09:04:28,761 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:28,761 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-25 09:04:28,761 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:04:28,761 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-25 09:04:28,761 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:04:28,761 INFO ]: Found error trace [2018-06-25 09:04:28,761 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:28,761 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:28,761 INFO ]: Analyzing trace with hash 107357138, now seen corresponding path program 27 times [2018-06-25 09:04:28,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:28,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:28,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:28,764 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:28,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:28,884 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:29,732 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:29,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:29,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:29,741 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:29,918 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-25 09:04:29,919 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:29,930 INFO ]: Computing forward predicates... [2018-06-25 09:04:30,253 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:30,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:30,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-25 09:04:30,273 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:04:30,273 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:04:30,273 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:04:30,274 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 31 states. [2018-06-25 09:04:30,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:30,820 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-25 09:04:30,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:04:30,820 INFO ]: Start accepts. Automaton has 31 states. Word has length 34 [2018-06-25 09:04:30,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:30,820 INFO ]: With dead ends: 36 [2018-06-25 09:04:30,820 INFO ]: Without dead ends: 36 [2018-06-25 09:04:30,821 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:04:30,821 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:04:30,822 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:04:30,822 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:04:30,823 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-25 09:04:30,823 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-25 09:04:30,823 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:30,823 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-25 09:04:30,823 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:04:30,823 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-25 09:04:30,823 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:04:30,823 INFO ]: Found error trace [2018-06-25 09:04:30,823 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:30,823 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:30,823 INFO ]: Analyzing trace with hash -970804262, now seen corresponding path program 28 times [2018-06-25 09:04:30,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:30,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:30,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:30,824 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:30,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:31,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:32,457 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:32,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:32,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:32,463 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:32,697 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:32,697 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:32,711 INFO ]: Computing forward predicates... [2018-06-25 09:04:33,103 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:33,124 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:33,124 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-25 09:04:33,124 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:04:33,124 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:04:33,124 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:04:33,124 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 32 states. [2018-06-25 09:04:33,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:33,687 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-25 09:04:33,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:04:33,687 INFO ]: Start accepts. Automaton has 32 states. Word has length 35 [2018-06-25 09:04:33,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:33,688 INFO ]: With dead ends: 37 [2018-06-25 09:04:33,688 INFO ]: Without dead ends: 37 [2018-06-25 09:04:33,688 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 19 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:04:33,688 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:04:33,690 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:04:33,690 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:04:33,691 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-25 09:04:33,691 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-25 09:04:33,691 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:33,691 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-25 09:04:33,691 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:04:33,691 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-25 09:04:33,691 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:04:33,691 INFO ]: Found error trace [2018-06-25 09:04:33,691 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:33,691 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:33,691 INFO ]: Analyzing trace with hash -34069294, now seen corresponding path program 29 times [2018-06-25 09:04:33,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:33,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:33,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:33,692 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:33,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:34,010 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:35,344 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:35,344 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:35,344 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:35,351 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:04:35,547 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-25 09:04:35,547 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:35,562 INFO ]: Computing forward predicates... [2018-06-25 09:04:36,027 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:36,048 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:36,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2018-06-25 09:04:36,048 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:04:36,048 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:04:36,048 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:04:36,048 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-25 09:04:36,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:36,659 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-25 09:04:36,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:04:36,659 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-25 09:04:36,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:36,660 INFO ]: With dead ends: 38 [2018-06-25 09:04:36,660 INFO ]: Without dead ends: 38 [2018-06-25 09:04:36,660 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 17 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:04:36,660 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:04:36,661 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 09:04:36,661 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:04:36,662 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-25 09:04:36,662 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-25 09:04:36,662 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:36,662 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-25 09:04:36,662 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:04:36,662 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-25 09:04:36,662 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:04:36,662 INFO ]: Found error trace [2018-06-25 09:04:36,662 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:36,662 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:36,663 INFO ]: Analyzing trace with hash -1060056358, now seen corresponding path program 30 times [2018-06-25 09:04:36,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:36,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:36,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:36,663 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:36,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:37,077 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:39,231 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:39,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:39,231 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:39,236 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:39,436 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-25 09:04:39,436 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:39,450 INFO ]: Computing forward predicates... [2018-06-25 09:04:40,120 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:40,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:40,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2018-06-25 09:04:40,141 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:04:40,141 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:04:40,141 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:04:40,141 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-25 09:04:40,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:40,822 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-25 09:04:40,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:04:40,822 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-25 09:04:40,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:40,822 INFO ]: With dead ends: 39 [2018-06-25 09:04:40,822 INFO ]: Without dead ends: 39 [2018-06-25 09:04:40,823 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:04:40,823 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:04:40,824 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:04:40,824 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:04:40,824 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-25 09:04:40,824 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-25 09:04:40,824 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:40,824 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-25 09:04:40,824 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:04:40,824 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-25 09:04:40,825 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:04:40,825 INFO ]: Found error trace [2018-06-25 09:04:40,825 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:40,825 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:40,825 INFO ]: Analyzing trace with hash 1494083026, now seen corresponding path program 31 times [2018-06-25 09:04:40,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:40,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:40,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:40,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:40,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:41,034 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:42,394 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:42,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:42,394 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:42,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:42,667 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:42,710 INFO ]: Computing forward predicates... [2018-06-25 09:04:43,111 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:43,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:43,132 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-25 09:04:43,132 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:04:43,132 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:04:43,132 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:04:43,132 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 35 states. [2018-06-25 09:04:43,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:43,846 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-25 09:04:43,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:04:43,846 INFO ]: Start accepts. Automaton has 35 states. Word has length 38 [2018-06-25 09:04:43,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:43,847 INFO ]: With dead ends: 40 [2018-06-25 09:04:43,847 INFO ]: Without dead ends: 40 [2018-06-25 09:04:43,847 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:04:43,847 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:04:43,848 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 09:04:43,848 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:04:43,849 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-25 09:04:43,849 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-25 09:04:43,849 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:43,849 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-25 09:04:43,849 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:04:43,849 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-25 09:04:43,849 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:04:43,849 INFO ]: Found error trace [2018-06-25 09:04:43,849 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:43,849 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:43,849 INFO ]: Analyzing trace with hash -931974694, now seen corresponding path program 32 times [2018-06-25 09:04:43,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:43,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:43,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:43,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:43,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:44,160 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:45,164 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:45,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:45,164 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:45,169 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:45,477 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:45,477 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:45,494 INFO ]: Computing forward predicates... [2018-06-25 09:04:46,174 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:04:46,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:46,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-25 09:04:46,195 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:04:46,195 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:04:46,195 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:04:46,195 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 36 states. Received shutdown request... [2018-06-25 09:04:46,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:04:46,753 WARN ]: Verification canceled [2018-06-25 09:04:46,758 WARN ]: Timeout [2018-06-25 09:04:46,758 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:04:46 BoogieIcfgContainer [2018-06-25 09:04:46,758 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:04:46,758 INFO ]: Toolchain (without parser) took 55541.73 ms. Allocated memory was 309.3 MB in the beginning and 882.9 MB in the end (delta: 573.6 MB). Free memory was 264.7 MB in the beginning and 311.7 MB in the end (delta: -47.0 MB). Peak memory consumption was 526.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,760 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:04:46,760 INFO ]: ChcToBoogie took 66.66 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,760 INFO ]: Boogie Preprocessor took 36.99 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,761 INFO ]: RCFGBuilder took 296.39 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 250.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,761 INFO ]: TraceAbstraction took 55125.86 ms. Allocated memory was 309.3 MB in the beginning and 882.9 MB in the end (delta: 573.6 MB). Free memory was 249.5 MB in the beginning and 311.7 MB in the end (delta: -62.2 MB). Peak memory consumption was 511.4 MB. Max. memory is 3.6 GB. [2018-06-25 09:04:46,763 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.66 ms. Allocated memory is still 309.3 MB. Free memory was 264.7 MB in the beginning and 262.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.99 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 296.39 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 250.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55125.86 ms. Allocated memory was 309.3 MB in the beginning and 882.9 MB in the end (delta: 573.6 MB). Free memory was 249.5 MB in the beginning and 311.7 MB in the end (delta: -62.2 MB). Peak memory consumption was 511.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 28 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 55.0s OverallTime, 35 OverallIterations, 32 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 246 SDtfs, 0 SDslu, 2831 SDs, 0 SdLazy, 13783 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1353 GetRequests, 445 SyntacticMatches, 292 SemanticMatches, 616 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 8.0s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 203 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 909623 SizeOfPredicates, 192 NumberOfNonLiveVariables, 27424 ConjunctsInSsa, 9856 ConjunctsInUnsatCore, 67 InterpolantComputations, 3 PerfectInterpolantSequences, 2/11970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-04-46-772.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-04-46-772.csv Completed graceful shutdown