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/003-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:04:48,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:04:48,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:04:48,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:04:48,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:04:48,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:04:48,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:04:48,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:04:48,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:04:48,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:04:48,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:04:48,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:04:48,698 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:04:48,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:04:48,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:04:48,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:04:48,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:04:48,714 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:04:48,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:04:48,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:04:48,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:04:48,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:04:48,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:04:48,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:04:48,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:04:48,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:04:48,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:04:48,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:04:48,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:04:48,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:04:48,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:04:48,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:04:48,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:04:48,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:04:48,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:04:48,734 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:04:48,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:04:48,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:04:48,756 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:04:48,756 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:04:48,759 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:04:48,759 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:04:48,759 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:04:48,760 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:04:48,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:04:48,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:04:48,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:04:48,760 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:04:48,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:04:48,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:04:48,761 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:04:48,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:04:48,761 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:04:48,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:04:48,762 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:04:48,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:04:48,763 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:04:48,764 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:04:48,765 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:04:48,808 INFO ]: Repository-Root is: /tmp [2018-06-25 09:04:48,820 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:04:48,823 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:04:48,828 INFO ]: Initializing SmtParser... [2018-06-25 09:04:48,829 INFO ]: SmtParser initialized [2018-06-25 09:04:48,829 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-25 09:04:48,830 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:04:48,922 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 unknown [2018-06-25 09:04:49,144 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-25 09:04:49,153 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:04:49,158 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:04:49,159 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:04:49,159 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:04:49,159 INFO ]: ChcToBoogie initialized [2018-06-25 09:04:49,163 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,217 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49 Unit [2018-06-25 09:04:49,218 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:04:49,218 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:04:49,218 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:04:49,218 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:04:49,238 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,238 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,245 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,245 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,247 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,254 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,255 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (1/1) ... [2018-06-25 09:04:49,257 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:04:49,258 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:04:49,258 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:04:49,258 INFO ]: RCFGBuilder initialized [2018-06-25 09:04:49,259 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (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:04:49,272 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:04:49,272 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:04:49,272 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:04:49,272 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:04:49,272 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:04:49,272 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:04:49,547 INFO ]: Using library mode [2018-06-25 09:04:49,548 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:04:49 BoogieIcfgContainer [2018-06-25 09:04:49,548 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:04:49,558 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:04:49,558 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:04:49,561 INFO ]: TraceAbstraction initialized [2018-06-25 09:04:49,561 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:04:49" (1/3) ... [2018-06-25 09:04:49,562 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dd3c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:04:49, skipping insertion in model container [2018-06-25 09:04:49,562 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:04:49" (2/3) ... [2018-06-25 09:04:49,562 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dd3c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:04:49, skipping insertion in model container [2018-06-25 09:04:49,562 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:04:49" (3/3) ... [2018-06-25 09:04:49,563 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:04:49,572 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:04:49,580 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:04:49,627 INFO ]: Using default assertion order modulation [2018-06-25 09:04:49,627 INFO ]: Interprodecural is true [2018-06-25 09:04:49,627 INFO ]: Hoare is false [2018-06-25 09:04:49,627 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:04:49,627 INFO ]: Backedges is TWOTRACK [2018-06-25 09:04:49,627 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:04:49,627 INFO ]: Difference is false [2018-06-25 09:04:49,627 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:04:49,627 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:04:49,640 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:04:49,654 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:04:49,654 INFO ]: Found error trace [2018-06-25 09:04:49,655 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:49,655 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:49,659 INFO ]: Analyzing trace with hash -204902306, now seen corresponding path program 1 times [2018-06-25 09:04:49,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:49,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:49,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:49,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:49,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:49,759 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:49,870 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:04:49,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:49,872 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:04:49,873 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:04:49,884 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:04:49,884 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:49,886 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:04:49,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:49,944 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:04:49,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:04:49,946 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:04:49,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:49,953 INFO ]: With dead ends: 9 [2018-06-25 09:04:49,953 INFO ]: Without dead ends: 9 [2018-06-25 09:04:49,955 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:04:49,974 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:04:49,993 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:04:49,995 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:49,995 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:04:49,997 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:04:49,997 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:49,997 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:04:49,997 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:04:49,997 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:04:49,997 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:49,997 INFO ]: Found error trace [2018-06-25 09:04:49,997 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:49,997 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:49,997 INFO ]: Analyzing trace with hash -2054566951, now seen corresponding path program 1 times [2018-06-25 09:04:49,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:49,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:49,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:49,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:49,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:50,106 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:04:50,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:50,106 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:04:50,107 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:04:50,108 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:04:50,108 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:50,108 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:04:50,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:50,242 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-25 09:04:50,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:04:50,243 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:04:50,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:50,244 INFO ]: With dead ends: 10 [2018-06-25 09:04:50,244 INFO ]: Without dead ends: 9 [2018-06-25 09:04:50,244 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:04:50,245 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:04:50,246 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:04:50,246 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:04:50,246 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 09:04:50,246 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-25 09:04:50,246 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:50,246 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 09:04:50,246 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:04:50,246 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 09:04:50,246 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:50,246 INFO ]: Found error trace [2018-06-25 09:04:50,247 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:50,247 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:50,248 INFO ]: Analyzing trace with hash -2050872867, now seen corresponding path program 1 times [2018-06-25 09:04:50,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:50,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:50,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:50,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,297 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:50,515 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:04:50,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:50,515 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:04:50,530 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:04:50,589 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:50,600 INFO ]: Computing forward predicates... [2018-06-25 09:04:50,658 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:04:50,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:50,679 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:04:50,679 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:04:50,679 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:04:50,679 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:04:50,680 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-25 09:04:50,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:50,748 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-25 09:04:50,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:04:50,748 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:04:50,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:50,748 INFO ]: With dead ends: 10 [2018-06-25 09:04:50,748 INFO ]: Without dead ends: 10 [2018-06-25 09:04:50,749 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:04:50,749 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:04:50,750 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:04:50,750 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:04:50,751 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:04:50,751 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-25 09:04:50,751 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:50,751 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:04:50,751 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:04:50,751 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:04:50,751 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:04:50,751 INFO ]: Found error trace [2018-06-25 09:04:50,751 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:50,751 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:50,752 INFO ]: Analyzing trace with hash -2049025825, now seen corresponding path program 1 times [2018-06-25 09:04:50,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:50,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:50,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:50,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,764 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:50,798 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:04:50,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:04:50,798 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:04:50,799 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:04:50,799 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:04:50,799 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:04:50,799 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 3 states. [2018-06-25 09:04:50,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:50,827 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 09:04:50,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:04:50,828 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:04:50,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:50,828 INFO ]: With dead ends: 11 [2018-06-25 09:04:50,828 INFO ]: Without dead ends: 10 [2018-06-25 09:04:50,829 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:04:50,829 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:04:50,830 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:04:50,830 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:04:50,830 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-25 09:04:50,830 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-25 09:04:50,830 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:50,830 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-25 09:04:50,831 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:04:50,831 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-25 09:04:50,831 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:04:50,831 INFO ]: Found error trace [2018-06-25 09:04:50,831 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:50,831 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:50,831 INFO ]: Analyzing trace with hash 853581886, now seen corresponding path program 2 times [2018-06-25 09:04:50,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:50,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:50,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:50,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:50,886 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:51,137 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:04:51,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:51,137 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:04:51,146 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:51,211 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:51,211 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:51,214 INFO ]: Computing forward predicates... [2018-06-25 09:04:51,433 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:04:51,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:51,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:04:51,454 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:04:51,455 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:04:51,455 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:51,455 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-25 09:04:51,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:51,637 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-25 09:04:51,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:04:51,639 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:04:51,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:51,639 INFO ]: With dead ends: 12 [2018-06-25 09:04:51,639 INFO ]: Without dead ends: 12 [2018-06-25 09:04:51,639 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:04:51,639 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:04:51,641 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:04:51,641 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:04:51,641 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-25 09:04:51,641 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-06-25 09:04:51,641 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:51,641 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-25 09:04:51,641 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:04:51,641 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-25 09:04:51,641 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:04:51,641 INFO ]: Found error trace [2018-06-25 09:04:51,642 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:51,642 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:51,642 INFO ]: Analyzing trace with hash 149641246, now seen corresponding path program 3 times [2018-06-25 09:04:51,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:51,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:51,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:51,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:51,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:51,706 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:52,032 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:04:52,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:52,033 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:04:52,040 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:52,108 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:04:52,108 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:52,112 INFO ]: Computing forward predicates... [2018-06-25 09:04:52,554 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:04:52,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:52,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 09:04:52,587 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:04:52,587 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:04:52,587 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:52,587 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-06-25 09:04:52,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:52,673 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-25 09:04:52,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:04:52,674 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 09:04:52,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:52,674 INFO ]: With dead ends: 14 [2018-06-25 09:04:52,674 INFO ]: Without dead ends: 14 [2018-06-25 09:04:52,675 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:04:52,675 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:04:52,676 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:04:52,676 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:04:52,677 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-25 09:04:52,677 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-06-25 09:04:52,677 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:52,677 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-25 09:04:52,677 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:04:52,677 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-25 09:04:52,677 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:04:52,677 INFO ]: Found error trace [2018-06-25 09:04:52,677 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:52,677 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:52,677 INFO ]: Analyzing trace with hash -2027448322, now seen corresponding path program 4 times [2018-06-25 09:04:52,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:52,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:52,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:52,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:52,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:52,705 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:53,337 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:04:53,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:53,337 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:04:53,350 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:53,407 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:53,407 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:53,413 INFO ]: Computing forward predicates... [2018-06-25 09:04:53,841 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:04:53,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:53,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 09:04:53,871 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:04:53,871 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:04:53,871 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:53,871 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-25 09:04:53,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:53,970 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-25 09:04:53,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:04:53,971 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-25 09:04:53,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:53,972 INFO ]: With dead ends: 15 [2018-06-25 09:04:53,972 INFO ]: Without dead ends: 15 [2018-06-25 09:04:53,972 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:53,972 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:04:53,974 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:04:53,974 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:04:53,974 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-25 09:04:53,974 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-25 09:04:53,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:53,974 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-25 09:04:53,974 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:04:53,974 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-25 09:04:53,975 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:04:53,975 INFO ]: Found error trace [2018-06-25 09:04:53,975 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:53,975 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:53,975 INFO ]: Analyzing trace with hash 1579742781, now seen corresponding path program 5 times [2018-06-25 09:04:53,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:53,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:53,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:53,977 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:53,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:54,014 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:54,498 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:04:54,499 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:54,499 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) [2018-06-25 09:04:54,511 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:54,558 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:04:54,558 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:54,563 INFO ]: Computing forward predicates... [2018-06-25 09:04:54,649 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:04:54,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:54,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 09:04:54,683 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:04:54,683 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:04:54,683 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:54,683 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 11 states. [2018-06-25 09:04:54,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:54,769 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-25 09:04:54,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:04:54,769 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-25 09:04:54,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:54,770 INFO ]: With dead ends: 17 [2018-06-25 09:04:54,770 INFO ]: Without dead ends: 17 [2018-06-25 09:04:54,770 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:04:54,770 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:04:54,771 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:04:54,771 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:04:54,774 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-25 09:04:54,774 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-06-25 09:04:54,774 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:54,774 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-25 09:04:54,774 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:04:54,774 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-25 09:04:54,774 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:04:54,774 INFO ]: Found error trace [2018-06-25 09:04:54,774 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:54,774 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:54,775 INFO ]: Analyzing trace with hash -2089407907, now seen corresponding path program 6 times [2018-06-25 09:04:54,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:54,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:54,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:54,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:54,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:54,808 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:55,231 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:04:55,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:55,231 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:04:55,241 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:04:55,290 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:04:55,290 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:55,295 INFO ]: Computing forward predicates... [2018-06-25 09:04:55,590 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:04:55,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:55,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 09:04:55,610 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:04:55,610 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:04:55,610 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:04:55,611 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 13 states. [2018-06-25 09:04:55,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:55,713 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-25 09:04:55,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:04:55,713 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:04:55,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:55,713 INFO ]: With dead ends: 18 [2018-06-25 09:04:55,714 INFO ]: Without dead ends: 18 [2018-06-25 09:04:55,714 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:04:55,714 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:04:55,715 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:04:55,715 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:04:55,716 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-25 09:04:55,716 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-25 09:04:55,716 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:55,716 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-25 09:04:55,716 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:04:55,716 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-25 09:04:55,716 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:04:55,716 INFO ]: Found error trace [2018-06-25 09:04:55,716 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:55,716 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:55,716 INFO ]: Analyzing trace with hash -341004354, now seen corresponding path program 7 times [2018-06-25 09:04:55,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:55,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:55,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:55,717 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:55,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:55,749 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,102 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:04:56,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:56,102 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:04:56,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:56,178 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,185 INFO ]: Computing forward predicates... [2018-06-25 09:04:56,364 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:04:56,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:56,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-25 09:04:56,385 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:04:56,385 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:04:56,385 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:04:56,386 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 14 states. [2018-06-25 09:04:56,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:56,597 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-25 09:04:56,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:04:56,600 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-25 09:04:56,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:56,600 INFO ]: With dead ends: 19 [2018-06-25 09:04:56,600 INFO ]: Without dead ends: 19 [2018-06-25 09:04:56,601 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:04:56,601 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:04:56,602 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:04:56,602 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:04:56,603 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-25 09:04:56,603 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-25 09:04:56,603 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:56,603 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-25 09:04:56,603 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:04:56,603 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-25 09:04:56,603 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:04:56,603 INFO ]: Found error trace [2018-06-25 09:04:56,603 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:56,604 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:56,604 INFO ]: Analyzing trace with hash -1975069059, now seen corresponding path program 8 times [2018-06-25 09:04:56,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:56,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:56,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:56,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:04:56,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:56,653 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,880 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:56,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:56,880 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:04:56,886 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:04:56,953 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:04:56,953 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:56,963 INFO ]: Computing forward predicates... [2018-06-25 09:04:57,128 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:57,147 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:57,147 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-25 09:04:57,148 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:04:57,148 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:04:57,148 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:04:57,148 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 15 states. [2018-06-25 09:04:57,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:57,262 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-25 09:04:57,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:04:57,262 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-25 09:04:57,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:57,262 INFO ]: With dead ends: 20 [2018-06-25 09:04:57,262 INFO ]: Without dead ends: 20 [2018-06-25 09:04:57,263 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:04:57,263 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:04:57,264 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:04:57,264 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:04:57,264 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-25 09:04:57,264 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-25 09:04:57,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:57,265 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-25 09:04:57,265 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:04:57,265 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-25 09:04:57,265 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:04:57,265 INFO ]: Found error trace [2018-06-25 09:04:57,265 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:57,265 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:57,265 INFO ]: Analyzing trace with hash -1091467362, now seen corresponding path program 9 times [2018-06-25 09:04:57,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:57,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:57,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:57,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:57,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:57,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:58,360 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:58,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:58,360 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:04:58,368 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:04:58,478 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:04:58,478 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:58,485 INFO ]: Computing forward predicates... [2018-06-25 09:04:58,599 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:58,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:58,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-25 09:04:58,628 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:04:58,628 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:04:58,628 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:04:58,629 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-06-25 09:04:58,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:04:58,903 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-25 09:04:58,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:04:58,904 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-25 09:04:58,904 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:04:58,904 INFO ]: With dead ends: 21 [2018-06-25 09:04:58,904 INFO ]: Without dead ends: 21 [2018-06-25 09:04:58,904 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:04:58,904 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:04:58,906 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:04:58,906 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:04:58,906 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-25 09:04:58,906 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-25 09:04:58,906 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:04:58,906 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-25 09:04:58,906 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:04:58,906 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-25 09:04:58,907 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:04:58,907 INFO ]: Found error trace [2018-06-25 09:04:58,907 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:04:58,907 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:04:58,907 INFO ]: Analyzing trace with hash 530381469, now seen corresponding path program 10 times [2018-06-25 09:04:58,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:04:58,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:04:58,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:58,907 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:04:58,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:04:58,958 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:59,351 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:59,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:04:59,351 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:04:59,358 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:04:59,424 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:04:59,424 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:04:59,435 INFO ]: Computing forward predicates... [2018-06-25 09:04:59,967 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:59,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:04:59,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-25 09:04:59,990 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:04:59,991 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:04:59,991 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:04:59,991 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 17 states. [2018-06-25 09:05:00,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:00,160 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-25 09:05:00,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:05:00,160 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-25 09:05:00,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:00,161 INFO ]: With dead ends: 22 [2018-06-25 09:05:00,161 INFO ]: Without dead ends: 22 [2018-06-25 09:05:00,161 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:05:00,161 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:05:00,162 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:05:00,162 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:05:00,163 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-25 09:05:00,163 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-25 09:05:00,164 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:00,164 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-25 09:05:00,164 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:05:00,164 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-25 09:05:00,164 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:05:00,164 INFO ]: Found error trace [2018-06-25 09:05:00,164 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:00,164 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:00,164 INFO ]: Analyzing trace with hash -731912322, now seen corresponding path program 11 times [2018-06-25 09:05:00,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:00,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:00,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:00,165 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:00,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:00,219 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:00,737 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:05:00,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:00,737 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:05:00,743 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:05:00,896 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-25 09:05:00,896 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:00,905 INFO ]: Computing forward predicates... [2018-06-25 09:05:01,340 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:05:01,361 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:01,361 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-25 09:05:01,362 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:05:01,362 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:05:01,362 INFO ]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:05:01,362 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 18 states. [2018-06-25 09:05:01,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:01,536 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-25 09:05:01,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:05:01,536 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-25 09:05:01,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:01,537 INFO ]: With dead ends: 24 [2018-06-25 09:05:01,537 INFO ]: Without dead ends: 24 [2018-06-25 09:05:01,537 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:05:01,537 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:05:01,539 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:05:01,539 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:05:01,540 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-25 09:05:01,540 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-06-25 09:05:01,540 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:01,540 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-25 09:05:01,540 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:05:01,540 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-25 09:05:01,541 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:05:01,541 INFO ]: Found error trace [2018-06-25 09:05:01,542 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:01,542 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:01,542 INFO ]: Analyzing trace with hash 1203097438, now seen corresponding path program 12 times [2018-06-25 09:05:01,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:01,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:01,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:01,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:01,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:01,648 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:02,037 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:05:02,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:02,037 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:05:02,045 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:05:02,227 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-25 09:05:02,227 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:02,237 INFO ]: Computing forward predicates... [2018-06-25 09:05:02,584 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:05:02,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:02,616 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-25 09:05:02,617 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:05:02,617 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:05:02,617 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:05:02,617 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-25 09:05:02,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:02,824 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-25 09:05:02,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:05:02,827 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-25 09:05:02,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:02,828 INFO ]: With dead ends: 25 [2018-06-25 09:05:02,828 INFO ]: Without dead ends: 25 [2018-06-25 09:05:02,828 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:05:02,828 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:05:02,830 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:05:02,830 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:05:02,831 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-25 09:05:02,831 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-25 09:05:02,831 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:02,831 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-25 09:05:02,831 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:05:02,831 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-25 09:05:02,831 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:05:02,831 INFO ]: Found error trace [2018-06-25 09:05:02,831 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:02,831 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:02,832 INFO ]: Analyzing trace with hash -1352553763, now seen corresponding path program 13 times [2018-06-25 09:05:02,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:02,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:02,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:02,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:02,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:02,899 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:03,460 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:05:03,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:03,474 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:05:03,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:03,575 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:03,587 INFO ]: Computing forward predicates... [2018-06-25 09:05:03,940 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:05:03,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:03,960 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-06-25 09:05:03,961 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:05:03,961 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:05:03,961 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:05:03,961 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-25 09:05:04,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:04,238 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-25 09:05:04,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:05:04,238 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-25 09:05:04,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:04,239 INFO ]: With dead ends: 26 [2018-06-25 09:05:04,239 INFO ]: Without dead ends: 26 [2018-06-25 09:05:04,239 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 8 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:05:04,239 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:05:04,241 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 09:05:04,241 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:05:04,241 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-25 09:05:04,242 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-25 09:05:04,242 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:04,242 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-25 09:05:04,242 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:05:04,242 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-25 09:05:04,242 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:05:04,242 INFO ]: Found error trace [2018-06-25 09:05:04,242 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:04,243 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:04,243 INFO ]: Analyzing trace with hash 1026637630, now seen corresponding path program 14 times [2018-06-25 09:05:04,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:04,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:04,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:04,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:04,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:04,323 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:05,141 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:05:05,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:05,141 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:05:05,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:05:05,259 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:05:05,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:05,276 INFO ]: Computing forward predicates... [2018-06-25 09:05:05,512 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:05:05,532 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:05,532 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-25 09:05:05,532 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:05:05,532 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:05:05,533 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:05:05,533 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-25 09:05:05,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:05,815 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-25 09:05:05,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 09:05:05,815 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-25 09:05:05,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:05,816 INFO ]: With dead ends: 27 [2018-06-25 09:05:05,816 INFO ]: Without dead ends: 27 [2018-06-25 09:05:05,816 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:05:05,816 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:05:05,818 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-25 09:05:05,818 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:05:05,818 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-25 09:05:05,818 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-25 09:05:05,818 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:05,818 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-25 09:05:05,818 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:05:05,818 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-25 09:05:05,819 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:05:05,819 INFO ]: Found error trace [2018-06-25 09:05:05,819 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:05,819 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:05,819 INFO ]: Analyzing trace with hash 1767126781, now seen corresponding path program 15 times [2018-06-25 09:05:05,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:05,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:05,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:05,820 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:05,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:05,914 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:06,587 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:05:06,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:06,587 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:05:06,602 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:05:06,712 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-25 09:05:06,712 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:06,720 INFO ]: Computing forward predicates... [2018-06-25 09:05:06,887 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:05:06,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:06,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-25 09:05:06,908 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:05:06,908 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:05:06,908 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:05:06,909 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 23 states. [2018-06-25 09:05:07,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:07,161 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-25 09:05:07,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:05:07,165 INFO ]: Start accepts. Automaton has 23 states. Word has length 26 [2018-06-25 09:05:07,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:07,166 INFO ]: With dead ends: 28 [2018-06-25 09:05:07,166 INFO ]: Without dead ends: 28 [2018-06-25 09:05:07,166 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:05:07,166 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:05:07,168 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 09:05:07,168 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:05:07,168 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-25 09:05:07,168 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-25 09:05:07,168 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:07,168 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-25 09:05:07,168 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:05:07,168 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-25 09:05:07,169 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:05:07,169 INFO ]: Found error trace [2018-06-25 09:05:07,169 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:07,169 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:07,169 INFO ]: Analyzing trace with hash -1047513314, now seen corresponding path program 16 times [2018-06-25 09:05:07,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:07,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:07,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:07,170 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:07,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:07,286 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:07,726 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:05:07,726 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:07,726 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:05:07,734 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:05:07,876 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:05:07,876 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:07,890 INFO ]: Computing forward predicates... [2018-06-25 09:05:08,140 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:05:08,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:08,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-25 09:05:08,162 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:05:08,163 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:05:08,163 INFO ]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:05:08,163 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-25 09:05:08,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:08,504 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-25 09:05:08,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:05:08,542 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-25 09:05:08,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:08,543 INFO ]: With dead ends: 29 [2018-06-25 09:05:08,543 INFO ]: Without dead ends: 29 [2018-06-25 09:05:08,543 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:05:08,543 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:05:08,545 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:05:08,545 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:05:08,545 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-25 09:05:08,545 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-25 09:05:08,545 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:08,545 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-25 09:05:08,545 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:05:08,545 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-25 09:05:08,546 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:05:08,546 INFO ]: Found error trace [2018-06-25 09:05:08,547 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:08,547 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:08,547 INFO ]: Analyzing trace with hash 1892956957, now seen corresponding path program 17 times [2018-06-25 09:05:08,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:08,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:08,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:08,547 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:08,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:08,638 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:09,252 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:05:09,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:09,252 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:05:09,258 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:05:09,362 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-25 09:05:09,363 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:09,373 INFO ]: Computing forward predicates... [2018-06-25 09:05:09,630 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:05:09,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:09,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-25 09:05:09,650 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:05:09,650 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:05:09,651 INFO ]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:05:09,651 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 25 states. [2018-06-25 09:05:10,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:10,033 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-25 09:05:10,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:05:10,035 INFO ]: Start accepts. Automaton has 25 states. Word has length 28 [2018-06-25 09:05:10,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:10,035 INFO ]: With dead ends: 31 [2018-06-25 09:05:10,035 INFO ]: Without dead ends: 31 [2018-06-25 09:05:10,035 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:05:10,036 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:05:10,038 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 09:05:10,038 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:05:10,038 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-25 09:05:10,038 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-06-25 09:05:10,038 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:10,038 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-25 09:05:10,038 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:05:10,038 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-25 09:05:10,039 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:05:10,039 INFO ]: Found error trace [2018-06-25 09:05:10,039 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:10,039 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:10,039 INFO ]: Analyzing trace with hash -1738295491, now seen corresponding path program 18 times [2018-06-25 09:05:10,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:10,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:10,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:10,040 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:10,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:10,155 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:10,928 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:05:10,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:10,928 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:05:10,934 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:05:11,044 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-25 09:05:11,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:11,055 INFO ]: Computing forward predicates... [2018-06-25 09:05:11,348 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:05:11,367 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:11,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-06-25 09:05:11,368 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:05:11,368 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:05:11,368 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:05:11,368 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-25 09:05:12,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:12,024 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-25 09:05:12,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:05:12,025 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-25 09:05:12,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:12,025 INFO ]: With dead ends: 32 [2018-06-25 09:05:12,025 INFO ]: Without dead ends: 32 [2018-06-25 09:05:12,026 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:05:12,026 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:05:12,027 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-25 09:05:12,027 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:05:12,028 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-25 09:05:12,028 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-25 09:05:12,028 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:12,028 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-25 09:05:12,028 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:05:12,028 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-25 09:05:12,030 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:05:12,030 INFO ]: Found error trace [2018-06-25 09:05:12,031 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:12,031 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:12,031 INFO ]: Analyzing trace with hash 1953545950, now seen corresponding path program 19 times [2018-06-25 09:05:12,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:12,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:12,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:12,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:12,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:12,158 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:12,735 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:05:12,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:12,735 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:05:12,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:12,886 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:12,903 INFO ]: Computing forward predicates... [2018-06-25 09:05:13,229 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:05:13,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:13,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-25 09:05:13,249 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:05:13,249 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:05:13,249 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:05:13,249 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-25 09:05:13,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:13,822 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-25 09:05:13,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:05:13,841 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-25 09:05:13,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:13,841 INFO ]: With dead ends: 33 [2018-06-25 09:05:13,841 INFO ]: Without dead ends: 33 [2018-06-25 09:05:13,842 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 16 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:05:13,842 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:05:13,844 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-25 09:05:13,844 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:05:13,844 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-25 09:05:13,844 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-25 09:05:13,844 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:13,844 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-25 09:05:13,844 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:05:13,844 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-25 09:05:13,845 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:05:13,845 INFO ]: Found error trace [2018-06-25 09:05:13,845 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:13,845 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:13,845 INFO ]: Analyzing trace with hash 436513629, now seen corresponding path program 20 times [2018-06-25 09:05:13,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:13,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:13,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:13,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:13,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:13,992 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:15,088 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:05:15,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:15,088 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:05:15,093 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:05:15,255 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:05:15,255 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:15,270 INFO ]: Computing forward predicates... [2018-06-25 09:05:15,714 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:05:15,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:15,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-25 09:05:15,734 INFO ]: Interpolant automaton has 29 states [2018-06-25 09:05:15,734 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-25 09:05:15,735 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:05:15,735 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 29 states. [2018-06-25 09:05:16,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:16,170 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-25 09:05:16,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:05:16,170 INFO ]: Start accepts. Automaton has 29 states. Word has length 32 [2018-06-25 09:05:16,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:16,170 INFO ]: With dead ends: 34 [2018-06-25 09:05:16,170 INFO ]: Without dead ends: 34 [2018-06-25 09:05:16,171 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 18 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:05:16,171 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:05:16,172 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 09:05:16,172 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:05:16,172 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-25 09:05:16,173 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-25 09:05:16,173 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:16,173 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-25 09:05:16,173 INFO ]: Interpolant automaton has 29 states. [2018-06-25 09:05:16,173 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-25 09:05:16,173 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:05:16,173 INFO ]: Found error trace [2018-06-25 09:05:16,173 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:16,173 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:16,173 INFO ]: Analyzing trace with hash 653151934, now seen corresponding path program 21 times [2018-06-25 09:05:16,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:16,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:16,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:16,174 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:16,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:16,274 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:17,634 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:05:17,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:17,635 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:05:17,646 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:05:17,779 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-06-25 09:05:17,779 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:17,794 INFO ]: Computing forward predicates... [2018-06-25 09:05:18,221 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:05:18,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:18,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-25 09:05:18,244 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:05:18,244 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:05:18,245 INFO ]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:05:18,245 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 30 states. [2018-06-25 09:05:18,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:18,727 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-25 09:05:18,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:05:18,727 INFO ]: Start accepts. Automaton has 30 states. Word has length 33 [2018-06-25 09:05:18,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:18,727 INFO ]: With dead ends: 35 [2018-06-25 09:05:18,727 INFO ]: Without dead ends: 35 [2018-06-25 09:05:18,728 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 15 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:05:18,728 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 09:05:18,731 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-25 09:05:18,731 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:05:18,731 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-25 09:05:18,731 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-25 09:05:18,731 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:18,731 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-25 09:05:18,731 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:05:18,732 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-25 09:05:18,732 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:05:18,732 INFO ]: Found error trace [2018-06-25 09:05:18,732 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:18,732 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:18,732 INFO ]: Analyzing trace with hash -1220995203, now seen corresponding path program 22 times [2018-06-25 09:05:18,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:18,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:18,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:18,733 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:18,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:18,868 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:19,574 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:05:19,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:19,574 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:05:19,580 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:05:19,760 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:05:19,760 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:19,784 INFO ]: Computing forward predicates... [2018-06-25 09:05:20,131 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:05:20,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:20,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-25 09:05:20,151 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:05:20,151 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:05:20,151 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:05:20,151 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 31 states. [2018-06-25 09:05:20,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:20,649 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-25 09:05:20,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:05:20,650 INFO ]: Start accepts. Automaton has 31 states. Word has length 34 [2018-06-25 09:05:20,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:20,650 INFO ]: With dead ends: 36 [2018-06-25 09:05:20,650 INFO ]: Without dead ends: 36 [2018-06-25 09:05:20,651 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:05:20,651 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:05:20,652 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:05:20,652 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:05:20,653 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-25 09:05:20,653 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-25 09:05:20,653 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:20,653 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-25 09:05:20,653 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:05:20,653 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-25 09:05:20,653 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:05:20,653 INFO ]: Found error trace [2018-06-25 09:05:20,653 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:20,653 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:20,654 INFO ]: Analyzing trace with hash 809985694, now seen corresponding path program 23 times [2018-06-25 09:05:20,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:20,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:20,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:20,654 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:20,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:20,748 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:22,284 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:05:22,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:22,284 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:05:22,290 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:05:22,445 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-06-25 09:05:22,445 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:22,463 INFO ]: Computing forward predicates... [2018-06-25 09:05:23,042 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:05:23,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:23,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-25 09:05:23,062 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:05:23,062 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:05:23,062 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:05:23,062 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 32 states. [2018-06-25 09:05:23,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:23,594 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-25 09:05:23,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 09:05:23,596 INFO ]: Start accepts. Automaton has 32 states. Word has length 35 [2018-06-25 09:05:23,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:23,596 INFO ]: With dead ends: 37 [2018-06-25 09:05:23,596 INFO ]: Without dead ends: 37 [2018-06-25 09:05:23,597 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 20 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:05:23,597 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:05:23,598 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:05:23,598 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:05:23,599 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-25 09:05:23,599 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-25 09:05:23,599 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:23,599 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-25 09:05:23,599 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:05:23,599 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-25 09:05:23,599 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:05:23,599 INFO ]: Found error trace [2018-06-25 09:05:23,600 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:23,600 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:23,600 INFO ]: Analyzing trace with hash -654115939, now seen corresponding path program 24 times [2018-06-25 09:05:23,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:23,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:23,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:23,600 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:23,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:23,750 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:25,092 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:05:25,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:25,092 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:05:25,097 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:05:25,245 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-25 09:05:25,245 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:25,256 INFO ]: Computing forward predicates... [2018-06-25 09:05:25,757 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:05:25,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:25,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-25 09:05:25,777 INFO ]: Interpolant automaton has 33 states [2018-06-25 09:05:25,778 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 09:05:25,778 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:05:25,778 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 33 states. [2018-06-25 09:05:26,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:26,325 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-25 09:05:26,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:05:26,326 INFO ]: Start accepts. Automaton has 33 states. Word has length 36 [2018-06-25 09:05:26,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:26,326 INFO ]: With dead ends: 38 [2018-06-25 09:05:26,326 INFO ]: Without dead ends: 38 [2018-06-25 09:05:26,326 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 23 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:05:26,326 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 09:05:26,328 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-25 09:05:26,328 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 09:05:26,329 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-25 09:05:26,329 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-25 09:05:26,330 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:26,330 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-25 09:05:26,330 INFO ]: Interpolant automaton has 33 states. [2018-06-25 09:05:26,330 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-25 09:05:26,330 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:05:26,330 INFO ]: Found error trace [2018-06-25 09:05:26,330 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:26,330 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:26,330 INFO ]: Analyzing trace with hash 1203373694, now seen corresponding path program 25 times [2018-06-25 09:05:26,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:26,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:26,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:26,331 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:26,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:26,483 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:27,751 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:05:27,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:27,751 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:05:27,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:28,014 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:28,037 INFO ]: Computing forward predicates... [2018-06-25 09:05:28,463 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:05:28,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:28,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-25 09:05:28,483 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:05:28,483 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:05:28,483 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:05:28,483 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 34 states. [2018-06-25 09:05:29,064 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:29,064 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-25 09:05:29,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 09:05:29,065 INFO ]: Start accepts. Automaton has 34 states. Word has length 37 [2018-06-25 09:05:29,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:29,065 INFO ]: With dead ends: 39 [2018-06-25 09:05:29,065 INFO ]: Without dead ends: 39 [2018-06-25 09:05:29,065 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:05:29,065 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:05:29,068 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:05:29,068 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:05:29,068 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-25 09:05:29,068 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-25 09:05:29,068 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:29,068 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-25 09:05:29,068 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:05:29,068 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-25 09:05:29,069 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:05:29,069 INFO ]: Found error trace [2018-06-25 09:05:29,069 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:29,069 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:29,069 INFO ]: Analyzing trace with hash -1343989827, now seen corresponding path program 26 times [2018-06-25 09:05:29,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:29,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:29,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:29,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:29,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:29,232 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:30,047 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:05:30,047 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:30,047 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:05:30,053 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:05:30,277 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:05:30,277 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:30,295 INFO ]: Computing forward predicates... [2018-06-25 09:05:30,858 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:05:30,878 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:30,878 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-25 09:05:30,878 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:05:30,878 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:05:30,878 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:05:30,878 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 35 states. [2018-06-25 09:05:31,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:31,546 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-25 09:05:31,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:05:31,546 INFO ]: Start accepts. Automaton has 35 states. Word has length 38 [2018-06-25 09:05:31,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:31,546 INFO ]: With dead ends: 40 [2018-06-25 09:05:31,546 INFO ]: Without dead ends: 40 [2018-06-25 09:05:31,547 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:05:31,547 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:05:31,548 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 09:05:31,548 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:05:31,549 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-25 09:05:31,549 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-25 09:05:31,549 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:31,549 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-25 09:05:31,549 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:05:31,549 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-25 09:05:31,549 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:05:31,549 INFO ]: Found error trace [2018-06-25 09:05:31,549 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:31,549 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:31,549 INFO ]: Analyzing trace with hash 1292119646, now seen corresponding path program 27 times [2018-06-25 09:05:31,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:31,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:31,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:31,550 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:31,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:31,725 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:32,859 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:05:32,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:32,859 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:05:32,868 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:05:33,046 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-06-25 09:05:33,046 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:33,063 INFO ]: Computing forward predicates... [2018-06-25 09:05:33,469 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:05:33,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:33,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-25 09:05:33,491 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:05:33,492 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:05:33,492 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:05:33,492 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 36 states. [2018-06-25 09:05:34,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:34,208 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-25 09:05:34,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:05:34,208 INFO ]: Start accepts. Automaton has 36 states. Word has length 39 [2018-06-25 09:05:34,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:34,208 INFO ]: With dead ends: 41 [2018-06-25 09:05:34,208 INFO ]: Without dead ends: 41 [2018-06-25 09:05:34,209 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:05:34,209 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 09:05:34,210 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-25 09:05:34,210 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 09:05:34,210 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-25 09:05:34,210 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-25 09:05:34,210 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:34,210 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-25 09:05:34,210 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:05:34,210 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-25 09:05:34,211 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:05:34,211 INFO ]: Found error trace [2018-06-25 09:05:34,211 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:34,211 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:34,211 INFO ]: Analyzing trace with hash 1407134685, now seen corresponding path program 28 times [2018-06-25 09:05:34,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:34,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:34,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:34,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:34,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:34,416 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:36,428 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:36,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:36,428 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:05:36,433 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:05:36,684 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:05:36,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:36,712 INFO ]: Computing forward predicates... [2018-06-25 09:05:37,224 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:37,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:37,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-25 09:05:37,245 INFO ]: Interpolant automaton has 37 states [2018-06-25 09:05:37,245 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 09:05:37,245 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:05:37,246 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 37 states. [2018-06-25 09:05:38,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:38,052 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-25 09:05:38,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:05:38,052 INFO ]: Start accepts. Automaton has 37 states. Word has length 40 [2018-06-25 09:05:38,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:38,053 INFO ]: With dead ends: 42 [2018-06-25 09:05:38,053 INFO ]: Without dead ends: 42 [2018-06-25 09:05:38,053 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:05:38,053 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:05:38,055 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 09:05:38,055 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:05:38,055 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-25 09:05:38,055 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-25 09:05:38,055 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:38,055 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-25 09:05:38,055 INFO ]: Interpolant automaton has 37 states. [2018-06-25 09:05:38,055 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-25 09:05:38,056 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:05:38,056 INFO ]: Found error trace [2018-06-25 09:05:38,056 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:38,056 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:38,056 INFO ]: Analyzing trace with hash 677633598, now seen corresponding path program 29 times [2018-06-25 09:05:38,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:38,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:38,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:38,056 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:38,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:38,232 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:39,330 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:39,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:39,330 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:05:39,336 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:05:39,534 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-25 09:05:39,534 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:39,558 INFO ]: Computing forward predicates... [2018-06-25 09:05:40,136 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:40,156 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:40,156 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2018-06-25 09:05:40,156 INFO ]: Interpolant automaton has 39 states [2018-06-25 09:05:40,157 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-25 09:05:40,157 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:05:40,157 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-06-25 09:05:40,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:40,930 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-25 09:05:40,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:05:40,930 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-25 09:05:40,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:40,930 INFO ]: With dead ends: 43 [2018-06-25 09:05:40,930 INFO ]: Without dead ends: 43 [2018-06-25 09:05:40,931 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 15 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:05:40,931 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:05:40,932 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-25 09:05:40,932 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:05:40,933 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-25 09:05:40,933 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-25 09:05:40,933 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:40,933 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-25 09:05:40,933 INFO ]: Interpolant automaton has 39 states. [2018-06-25 09:05:40,933 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-25 09:05:40,933 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:05:40,933 INFO ]: Found error trace [2018-06-25 09:05:40,933 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:40,933 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:40,933 INFO ]: Analyzing trace with hash -462063619, now seen corresponding path program 30 times [2018-06-25 09:05:40,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:40,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:40,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:40,934 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:40,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:41,106 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:42,136 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:42,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:42,152 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:05:42,158 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:05:42,385 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-25 09:05:42,385 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:42,398 INFO ]: Computing forward predicates... [2018-06-25 09:05:42,906 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:42,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:42,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-25 09:05:42,927 INFO ]: Interpolant automaton has 39 states [2018-06-25 09:05:42,927 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-25 09:05:42,927 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:05:42,927 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 39 states. [2018-06-25 09:05:43,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:43,756 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-25 09:05:43,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 09:05:43,756 INFO ]: Start accepts. Automaton has 39 states. Word has length 42 [2018-06-25 09:05:43,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:43,757 INFO ]: With dead ends: 44 [2018-06-25 09:05:43,757 INFO ]: Without dead ends: 44 [2018-06-25 09:05:43,757 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:05:43,757 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:05:43,758 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-25 09:05:43,758 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:05:43,758 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-25 09:05:43,758 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-25 09:05:43,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:43,759 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-25 09:05:43,759 INFO ]: Interpolant automaton has 39 states. [2018-06-25 09:05:43,759 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-25 09:05:43,759 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 09:05:43,759 INFO ]: Found error trace [2018-06-25 09:05:43,759 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:43,759 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:43,759 INFO ]: Analyzing trace with hash -1432938978, now seen corresponding path program 31 times [2018-06-25 09:05:43,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:43,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:43,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:43,759 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:05:43,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:43,877 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:45,042 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:45,042 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:05:45,042 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:05:45,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:45,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:05:45,392 INFO ]: Computing forward predicates... [2018-06-25 09:05:45,908 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:05:45,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:05:45,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-06-25 09:05:45,929 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:05:45,929 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:05:45,929 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:05:45,929 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 40 states. [2018-06-25 09:05:46,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:05:46,796 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-25 09:05:46,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-25 09:05:46,797 INFO ]: Start accepts. Automaton has 40 states. Word has length 43 [2018-06-25 09:05:46,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:05:46,797 INFO ]: With dead ends: 45 [2018-06-25 09:05:46,797 INFO ]: Without dead ends: 45 [2018-06-25 09:05:46,797 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 21 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:05:46,797 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:05:46,798 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:05:46,798 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:05:46,798 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-25 09:05:46,798 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-25 09:05:46,799 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:05:46,799 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-25 09:05:46,799 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:05:46,799 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-25 09:05:46,799 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:05:46,799 INFO ]: Found error trace [2018-06-25 09:05:46,799 INFO ]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:05:46,799 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:05:46,799 INFO ]: Analyzing trace with hash -1465304035, now seen corresponding path program 32 times [2018-06-25 09:05:46,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:05:46,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:05:46,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:46,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:05:46,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:05:47,022 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:05:47,633 WARN ]: Verification canceled [2018-06-25 09:05:47,636 WARN ]: Timeout [2018-06-25 09:05:47,636 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:05:47 BoogieIcfgContainer [2018-06-25 09:05:47,636 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:05:47,637 INFO ]: Toolchain (without parser) took 58483.92 ms. Allocated memory was 308.8 MB in the beginning and 851.4 MB in the end (delta: 542.6 MB). Free memory was 263.2 MB in the beginning and 606.8 MB in the end (delta: -343.6 MB). Peak memory consumption was 199.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:05:47,639 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:05:47,640 INFO ]: ChcToBoogie took 59.02 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 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:05:47,640 INFO ]: Boogie Preprocessor took 39.06 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 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:05:47,641 INFO ]: RCFGBuilder took 290.22 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 249.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:05:47,641 INFO ]: TraceAbstraction took 58078.31 ms. Allocated memory was 308.8 MB in the beginning and 851.4 MB in the end (delta: 542.6 MB). Free memory was 249.2 MB in the beginning and 606.8 MB in the end (delta: -357.6 MB). Peak memory consumption was 185.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:05:47,644 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.02 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.06 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 290.22 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 249.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58078.31 ms. Allocated memory was 308.8 MB in the beginning and 851.4 MB in the end (delta: 542.6 MB). Free memory was 249.2 MB in the beginning and 606.8 MB in the end (delta: -357.6 MB). Peak memory consumption was 185.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 37, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 58.0s OverallTime, 35 OverallIterations, 37 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 0 SDslu, 3255 SDs, 0 SdLazy, 18297 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1514 GetRequests, 466 SyntacticMatches, 361 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 1683 NumberOfCodeBlocks, 1683 NumberOfCodeBlocksAsserted, 228 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180565 SizeOfPredicates, 186 NumberOfNonLiveVariables, 25588 ConjunctsInSsa, 11375 ConjunctsInUnsatCore, 65 InterpolantComputations, 3 PerfectInterpolantSequences, 2/16014 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-05-47-659.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-05-47-659.csv Completed graceful shutdown