java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcmp.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:44:33,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:44:33,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:44:33,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:44:33,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:44:33,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:44:33,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:44:33,441 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:44:33,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:44:33,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:44:33,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:44:33,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:44:33,445 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:44:33,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:44:33,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:44:33,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:44:33,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:44:33,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:44:33,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:44:33,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:44:33,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:44:33,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:44:33,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:44:33,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:44:33,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:44:33,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:44:33,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:44:33,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:44:33,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:44:33,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:44:33,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:44:33,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:44:33,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:44:33,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:44:33,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:44:33,490 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:44:33,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:44:33,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:44:33,510 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:44:33,510 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:44:33,512 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:44:33,512 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:44:33,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:44:33,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:44:33,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:44:33,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:44:33,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:33,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:44:33,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:44:33,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:44:33,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:44:33,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:44:33,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:44:33,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:44:33,514 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:44:33,516 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:44:33,516 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:44:33,570 INFO ]: Repository-Root is: /tmp [2018-06-22 11:44:33,585 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:44:33,591 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:44:33,592 INFO ]: Initializing SmtParser... [2018-06-22 11:44:33,593 INFO ]: SmtParser initialized [2018-06-22 11:44:33,593 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcmp.array.smt2 [2018-06-22 11:44:33,595 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:44:33,683 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcmp.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@39d89e75 [2018-06-22 11:44:33,948 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcmp.array.smt2 [2018-06-22 11:44:33,959 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:44:33,966 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:44:33,967 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:44:33,967 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:44:33,967 INFO ]: ChcToBoogie initialized [2018-06-22 11:44:33,970 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:33" (1/1) ... [2018-06-22 11:44:34,022 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34 Unit [2018-06-22 11:44:34,022 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:44:34,023 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:44:34,023 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:44:34,023 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:44:34,050 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,050 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,060 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,061 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,073 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,084 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,086 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... [2018-06-22 11:44:34,088 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:44:34,088 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:44:34,088 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:44:34,088 INFO ]: RCFGBuilder initialized [2018-06-22 11:44:34,089 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:44:34,110 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:44:34,110 INFO ]: Found specification of procedure False [2018-06-22 11:44:34,110 INFO ]: Found implementation of procedure False [2018-06-22 11:44:34,110 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:44:34,110 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:44:34,110 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:44:34,110 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:44:34,110 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:44:34,110 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:34,541 INFO ]: Using library mode [2018-06-22 11:44:34,542 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:34 BoogieIcfgContainer [2018-06-22 11:44:34,542 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:44:34,543 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:44:34,544 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:44:34,547 INFO ]: TraceAbstraction initialized [2018-06-22 11:44:34,547 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:33" (1/3) ... [2018-06-22 11:44:34,548 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760643d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:44:34, skipping insertion in model container [2018-06-22 11:44:34,548 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:34" (2/3) ... [2018-06-22 11:44:34,548 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760643d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:44:34, skipping insertion in model container [2018-06-22 11:44:34,549 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:34" (3/3) ... [2018-06-22 11:44:34,555 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:44:34,566 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:44:34,574 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:44:34,625 INFO ]: Using default assertion order modulation [2018-06-22 11:44:34,625 INFO ]: Interprodecural is true [2018-06-22 11:44:34,625 INFO ]: Hoare is false [2018-06-22 11:44:34,626 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:44:34,626 INFO ]: Backedges is TWOTRACK [2018-06-22 11:44:34,626 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:44:34,626 INFO ]: Difference is false [2018-06-22 11:44:34,626 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:44:34,626 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:44:34,650 INFO ]: Start isEmpty. Operand 20 states. [2018-06-22 11:44:34,669 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:44:34,669 INFO ]: Found error trace [2018-06-22 11:44:34,670 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:44:34,670 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:34,675 INFO ]: Analyzing trace with hash 106328606, now seen corresponding path program 1 times [2018-06-22 11:44:34,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:34,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:34,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:34,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:34,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:34,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:34,758 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:34,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:34,761 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:44:34,762 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:44:34,774 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:44:34,775 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:44:34,777 INFO ]: Start difference. First operand 20 states. Second operand 2 states. [2018-06-22 11:44:34,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:34,804 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-22 11:44:34,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:44:34,814 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:44:34,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:34,827 INFO ]: With dead ends: 16 [2018-06-22 11:44:34,827 INFO ]: Without dead ends: 16 [2018-06-22 11:44:34,829 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:44:34,842 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:44:34,862 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:44:34,863 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:44:34,864 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-22 11:44:34,865 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 5 [2018-06-22 11:44:34,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:34,866 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-22 11:44:34,866 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:44:34,866 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-22 11:44:34,868 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:34,868 INFO ]: Found error trace [2018-06-22 11:44:34,868 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:34,868 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:34,868 INFO ]: Analyzing trace with hash -505763536, now seen corresponding path program 1 times [2018-06-22 11:44:34,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:34,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:34,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:34,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:34,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:34,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:35,009 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:35,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:35,010 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:35,011 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:35,011 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:35,011 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,011 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-22 11:44:35,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:35,230 INFO ]: Finished difference Result 20 states and 36 transitions. [2018-06-22 11:44:35,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:35,231 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:35,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:35,232 INFO ]: With dead ends: 20 [2018-06-22 11:44:35,232 INFO ]: Without dead ends: 20 [2018-06-22 11:44:35,233 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,233 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:44:35,244 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:44:35,244 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:35,245 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-06-22 11:44:35,245 INFO ]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 9 [2018-06-22 11:44:35,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:35,245 INFO ]: Abstraction has 18 states and 34 transitions. [2018-06-22 11:44:35,245 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:35,245 INFO ]: Start isEmpty. Operand 18 states and 34 transitions. [2018-06-22 11:44:35,247 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:35,247 INFO ]: Found error trace [2018-06-22 11:44:35,247 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:35,247 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:35,247 INFO ]: Analyzing trace with hash -570145844, now seen corresponding path program 1 times [2018-06-22 11:44:35,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:35,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:35,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:35,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:35,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:35,263 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:35,559 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-06-22 11:44:35,672 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:35,672 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:35,672 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:35,672 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:35,672 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:35,673 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,673 INFO ]: Start difference. First operand 18 states and 34 transitions. Second operand 4 states. [2018-06-22 11:44:36,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:36,007 INFO ]: Finished difference Result 20 states and 35 transitions. [2018-06-22 11:44:36,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:36,008 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:36,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:36,009 INFO ]: With dead ends: 20 [2018-06-22 11:44:36,009 INFO ]: Without dead ends: 20 [2018-06-22 11:44:36,009 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,009 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:44:36,015 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:44:36,015 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:36,016 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-06-22 11:44:36,016 INFO ]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 9 [2018-06-22 11:44:36,016 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:36,016 INFO ]: Abstraction has 18 states and 33 transitions. [2018-06-22 11:44:36,016 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:36,016 INFO ]: Start isEmpty. Operand 18 states and 33 transitions. [2018-06-22 11:44:36,017 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:36,018 INFO ]: Found error trace [2018-06-22 11:44:36,018 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:36,018 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:36,018 INFO ]: Analyzing trace with hash -9164294, now seen corresponding path program 1 times [2018-06-22 11:44:36,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:36,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:36,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,125 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:36,125 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:36,125 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:36,126 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:36,126 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:36,126 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,126 INFO ]: Start difference. First operand 18 states and 33 transitions. Second operand 4 states. [2018-06-22 11:44:36,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:36,299 INFO ]: Finished difference Result 20 states and 34 transitions. [2018-06-22 11:44:36,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:36,299 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:36,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:36,300 INFO ]: With dead ends: 20 [2018-06-22 11:44:36,300 INFO ]: Without dead ends: 20 [2018-06-22 11:44:36,301 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,301 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:44:36,306 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:44:36,306 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:36,307 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-06-22 11:44:36,307 INFO ]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 9 [2018-06-22 11:44:36,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:36,307 INFO ]: Abstraction has 18 states and 32 transitions. [2018-06-22 11:44:36,307 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:36,307 INFO ]: Start isEmpty. Operand 18 states and 32 transitions. [2018-06-22 11:44:36,308 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:36,308 INFO ]: Found error trace [2018-06-22 11:44:36,308 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:36,309 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:36,309 INFO ]: Analyzing trace with hash 1329038183, now seen corresponding path program 1 times [2018-06-22 11:44:36,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:36,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:36,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,553 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 11:44:36,626 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:36,626 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:36,626 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:36,626 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:36,626 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:36,626 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,626 INFO ]: Start difference. First operand 18 states and 32 transitions. Second operand 4 states. [2018-06-22 11:44:36,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:36,699 INFO ]: Finished difference Result 20 states and 33 transitions. [2018-06-22 11:44:36,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:36,700 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:36,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:36,700 INFO ]: With dead ends: 20 [2018-06-22 11:44:36,700 INFO ]: Without dead ends: 20 [2018-06-22 11:44:36,701 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,701 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:44:36,704 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:44:36,704 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:36,705 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-06-22 11:44:36,705 INFO ]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 9 [2018-06-22 11:44:36,705 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:36,705 INFO ]: Abstraction has 18 states and 31 transitions. [2018-06-22 11:44:36,705 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:36,705 INFO ]: Start isEmpty. Operand 18 states and 31 transitions. [2018-06-22 11:44:36,706 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:36,706 INFO ]: Found error trace [2018-06-22 11:44:36,706 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:36,706 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:36,706 INFO ]: Analyzing trace with hash -892232363, now seen corresponding path program 1 times [2018-06-22 11:44:36,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:36,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:36,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,794 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:36,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:36,794 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:36,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,834 INFO ]: Computing forward predicates... [2018-06-22 11:44:37,220 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:37,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:37,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:37,241 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:37,241 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:37,241 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:37,241 INFO ]: Start difference. First operand 18 states and 31 transitions. Second operand 6 states. [2018-06-22 11:44:37,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:37,683 INFO ]: Finished difference Result 24 states and 48 transitions. [2018-06-22 11:44:37,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:37,685 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:37,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:37,686 INFO ]: With dead ends: 24 [2018-06-22 11:44:37,686 INFO ]: Without dead ends: 24 [2018-06-22 11:44:37,687 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:37,687 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:44:37,694 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-22 11:44:37,694 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:44:37,695 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2018-06-22 11:44:37,695 INFO ]: Start accepts. Automaton has 20 states and 38 transitions. Word has length 13 [2018-06-22 11:44:37,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:37,695 INFO ]: Abstraction has 20 states and 38 transitions. [2018-06-22 11:44:37,695 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:37,695 INFO ]: Start isEmpty. Operand 20 states and 38 transitions. [2018-06-22 11:44:37,696 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:37,696 INFO ]: Found error trace [2018-06-22 11:44:37,696 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:37,697 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:37,700 INFO ]: Analyzing trace with hash -114924642, now seen corresponding path program 1 times [2018-06-22 11:44:37,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:37,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:37,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:37,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:37,891 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:37,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:37,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:37,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:37,921 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:37,924 INFO ]: Computing forward predicates... [2018-06-22 11:44:37,958 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:37,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:37,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:44:37,979 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:44:37,979 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:44:37,979 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:37,979 INFO ]: Start difference. First operand 20 states and 38 transitions. Second operand 9 states. [2018-06-22 11:44:38,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:38,302 INFO ]: Finished difference Result 30 states and 59 transitions. [2018-06-22 11:44:38,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:44:38,304 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:44:38,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:38,305 INFO ]: With dead ends: 30 [2018-06-22 11:44:38,305 INFO ]: Without dead ends: 30 [2018-06-22 11:44:38,305 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:38,305 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:44:38,312 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-06-22 11:44:38,312 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:44:38,313 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-06-22 11:44:38,313 INFO ]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 13 [2018-06-22 11:44:38,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:38,314 INFO ]: Abstraction has 20 states and 37 transitions. [2018-06-22 11:44:38,314 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:44:38,314 INFO ]: Start isEmpty. Operand 20 states and 37 transitions. [2018-06-22 11:44:38,315 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:38,315 INFO ]: Found error trace [2018-06-22 11:44:38,315 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:38,315 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:38,315 INFO ]: Analyzing trace with hash 2056197178, now seen corresponding path program 1 times [2018-06-22 11:44:38,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:38,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:38,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:38,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:38,379 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:38,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:38,379 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:38,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:38,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:38,401 INFO ]: Computing forward predicates... [2018-06-22 11:44:38,418 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:38,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:38,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:38,438 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:38,438 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:38,438 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:38,439 INFO ]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2018-06-22 11:44:38,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:38,601 INFO ]: Finished difference Result 24 states and 46 transitions. [2018-06-22 11:44:38,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:38,601 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:38,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:38,602 INFO ]: With dead ends: 24 [2018-06-22 11:44:38,602 INFO ]: Without dead ends: 24 [2018-06-22 11:44:38,603 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:38,603 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:44:38,606 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-22 11:44:38,606 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:44:38,607 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2018-06-22 11:44:38,607 INFO ]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 13 [2018-06-22 11:44:38,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:38,607 INFO ]: Abstraction has 20 states and 36 transitions. [2018-06-22 11:44:38,607 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:38,607 INFO ]: Start isEmpty. Operand 20 states and 36 transitions. [2018-06-22 11:44:38,608 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:38,608 INFO ]: Found error trace [2018-06-22 11:44:38,608 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:38,608 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:38,608 INFO ]: Analyzing trace with hash 1486967144, now seen corresponding path program 1 times [2018-06-22 11:44:38,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:38,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:38,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:38,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:38,663 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:38,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:38,663 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) [2018-06-22 11:44:38,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:38,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:38,695 INFO ]: Computing forward predicates... [2018-06-22 11:44:38,702 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:38,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:38,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:38,722 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:38,722 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:38,722 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:38,722 INFO ]: Start difference. First operand 20 states and 36 transitions. Second operand 6 states. [2018-06-22 11:44:38,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:38,978 INFO ]: Finished difference Result 24 states and 45 transitions. [2018-06-22 11:44:38,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:38,978 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:38,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:38,979 INFO ]: With dead ends: 24 [2018-06-22 11:44:38,979 INFO ]: Without dead ends: 24 [2018-06-22 11:44:38,979 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:38,979 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:44:38,982 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-06-22 11:44:38,982 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:38,983 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-06-22 11:44:38,983 INFO ]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 13 [2018-06-22 11:44:38,983 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:38,983 INFO ]: Abstraction has 18 states and 31 transitions. [2018-06-22 11:44:38,983 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:38,983 INFO ]: Start isEmpty. Operand 18 states and 31 transitions. [2018-06-22 11:44:38,984 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:38,984 INFO ]: Found error trace [2018-06-22 11:44:38,984 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:38,984 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:38,984 INFO ]: Analyzing trace with hash -360175495, now seen corresponding path program 1 times [2018-06-22 11:44:38,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:38,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:38,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:38,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:39,070 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:39,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:39,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:39,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:39,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:39,088 INFO ]: Computing forward predicates... [2018-06-22 11:44:39,121 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:39,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:39,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:44:39,141 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:44:39,141 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:44:39,141 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:39,141 INFO ]: Start difference. First operand 18 states and 31 transitions. Second operand 10 states. [2018-06-22 11:44:39,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:39,661 INFO ]: Finished difference Result 30 states and 61 transitions. [2018-06-22 11:44:39,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:39,661 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:44:39,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:39,662 INFO ]: With dead ends: 30 [2018-06-22 11:44:39,662 INFO ]: Without dead ends: 30 [2018-06-22 11:44:39,663 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:44:39,663 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:44:39,669 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-06-22 11:44:39,670 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:44:39,670 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-06-22 11:44:39,670 INFO ]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 13 [2018-06-22 11:44:39,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:39,670 INFO ]: Abstraction has 22 states and 41 transitions. [2018-06-22 11:44:39,670 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:44:39,670 INFO ]: Start isEmpty. Operand 22 states and 41 transitions. [2018-06-22 11:44:39,672 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:39,672 INFO ]: Found error trace [2018-06-22 11:44:39,672 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:39,672 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:39,672 INFO ]: Analyzing trace with hash 1241716291, now seen corresponding path program 1 times [2018-06-22 11:44:39,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:39,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:39,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:39,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:39,872 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:39,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:39,872 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:39,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:39,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:39,910 INFO ]: Computing forward predicates... [2018-06-22 11:44:39,960 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:39,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:39,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:39,980 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:39,980 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:39,980 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:39,980 INFO ]: Start difference. First operand 22 states and 41 transitions. Second operand 6 states. [2018-06-22 11:44:40,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,070 INFO ]: Finished difference Result 26 states and 50 transitions. [2018-06-22 11:44:40,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:40,071 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:40,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,072 INFO ]: With dead ends: 26 [2018-06-22 11:44:40,072 INFO ]: Without dead ends: 26 [2018-06-22 11:44:40,072 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:40,072 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:44:40,076 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-22 11:44:40,076 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:44:40,077 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2018-06-22 11:44:40,077 INFO ]: Start accepts. Automaton has 22 states and 40 transitions. Word has length 13 [2018-06-22 11:44:40,077 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,077 INFO ]: Abstraction has 22 states and 40 transitions. [2018-06-22 11:44:40,077 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:40,077 INFO ]: Start isEmpty. Operand 22 states and 40 transitions. [2018-06-22 11:44:40,078 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,078 INFO ]: Found error trace [2018-06-22 11:44:40,078 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,078 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,078 INFO ]: Analyzing trace with hash -1137483216, now seen corresponding path program 1 times [2018-06-22 11:44:40,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,133 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:40,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:40,133 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:40,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,151 INFO ]: Computing forward predicates... [2018-06-22 11:44:40,190 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:40,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:40,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:40,209 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:40,210 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:40,210 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:40,210 INFO ]: Start difference. First operand 22 states and 40 transitions. Second operand 6 states. [2018-06-22 11:44:40,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,429 INFO ]: Finished difference Result 26 states and 49 transitions. [2018-06-22 11:44:40,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:40,429 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:40,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,430 INFO ]: With dead ends: 26 [2018-06-22 11:44:40,430 INFO ]: Without dead ends: 26 [2018-06-22 11:44:40,430 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:40,430 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:44:40,434 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-22 11:44:40,434 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:44:40,434 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2018-06-22 11:44:40,434 INFO ]: Start accepts. Automaton has 22 states and 39 transitions. Word has length 13 [2018-06-22 11:44:40,434 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,434 INFO ]: Abstraction has 22 states and 39 transitions. [2018-06-22 11:44:40,434 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:40,435 INFO ]: Start isEmpty. Operand 22 states and 39 transitions. [2018-06-22 11:44:40,435 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,435 INFO ]: Found error trace [2018-06-22 11:44:40,435 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,435 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,435 INFO ]: Analyzing trace with hash -998453358, now seen corresponding path program 1 times [2018-06-22 11:44:40,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,447 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,492 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:40,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:40,492 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:40,492 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:40,493 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:40,493 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,493 INFO ]: Start difference. First operand 22 states and 39 transitions. Second operand 5 states. [2018-06-22 11:44:40,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,527 INFO ]: Finished difference Result 28 states and 56 transitions. [2018-06-22 11:44:40,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:40,528 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:40,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,529 INFO ]: With dead ends: 28 [2018-06-22 11:44:40,529 INFO ]: Without dead ends: 28 [2018-06-22 11:44:40,529 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,529 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:44:40,533 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:44:40,533 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:44:40,534 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2018-06-22 11:44:40,534 INFO ]: Start accepts. Automaton has 24 states and 46 transitions. Word has length 13 [2018-06-22 11:44:40,534 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,534 INFO ]: Abstraction has 24 states and 46 transitions. [2018-06-22 11:44:40,534 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:40,534 INFO ]: Start isEmpty. Operand 24 states and 46 transitions. [2018-06-22 11:44:40,535 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,535 INFO ]: Found error trace [2018-06-22 11:44:40,535 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,535 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,535 INFO ]: Analyzing trace with hash 1172668462, now seen corresponding path program 1 times [2018-06-22 11:44:40,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,718 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-06-22 11:44:40,739 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:40,739 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:40,739 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:40,739 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:40,739 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:40,739 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,739 INFO ]: Start difference. First operand 24 states and 46 transitions. Second operand 5 states. [2018-06-22 11:44:40,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,778 INFO ]: Finished difference Result 28 states and 55 transitions. [2018-06-22 11:44:40,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:40,778 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:40,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,779 INFO ]: With dead ends: 28 [2018-06-22 11:44:40,779 INFO ]: Without dead ends: 28 [2018-06-22 11:44:40,779 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 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-22 11:44:40,779 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:44:40,783 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:44:40,783 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:44:40,784 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 45 transitions. [2018-06-22 11:44:40,784 INFO ]: Start accepts. Automaton has 24 states and 45 transitions. Word has length 13 [2018-06-22 11:44:40,784 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,784 INFO ]: Abstraction has 24 states and 45 transitions. [2018-06-22 11:44:40,784 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:40,784 INFO ]: Start isEmpty. Operand 24 states and 45 transitions. [2018-06-22 11:44:40,786 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,786 INFO ]: Found error trace [2018-06-22 11:44:40,786 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,786 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,786 INFO ]: Analyzing trace with hash 603438428, now seen corresponding path program 1 times [2018-06-22 11:44:40,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,900 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:40,901 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:40,901 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:40,901 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:40,901 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:40,901 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,901 INFO ]: Start difference. First operand 24 states and 45 transitions. Second operand 5 states. [2018-06-22 11:44:40,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,947 INFO ]: Finished difference Result 28 states and 54 transitions. [2018-06-22 11:44:40,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:40,948 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:40,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,948 INFO ]: With dead ends: 28 [2018-06-22 11:44:40,948 INFO ]: Without dead ends: 28 [2018-06-22 11:44:40,949 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,949 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:44:40,953 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:44:40,953 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:44:40,954 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 44 transitions. [2018-06-22 11:44:40,954 INFO ]: Start accepts. Automaton has 24 states and 44 transitions. Word has length 13 [2018-06-22 11:44:40,954 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,954 INFO ]: Abstraction has 24 states and 44 transitions. [2018-06-22 11:44:40,954 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:40,954 INFO ]: Start isEmpty. Operand 24 states and 44 transitions. [2018-06-22 11:44:40,955 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,955 INFO ]: Found error trace [2018-06-22 11:44:40,955 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,955 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,955 INFO ]: Analyzing trace with hash -1775761079, now seen corresponding path program 1 times [2018-06-22 11:44:40,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,096 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,096 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:41,096 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:41,097 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:41,097 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,097 INFO ]: Start difference. First operand 24 states and 44 transitions. Second operand 5 states. [2018-06-22 11:44:41,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:41,140 INFO ]: Finished difference Result 28 states and 53 transitions. [2018-06-22 11:44:41,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:41,141 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:41,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:41,141 INFO ]: With dead ends: 28 [2018-06-22 11:44:41,141 INFO ]: Without dead ends: 28 [2018-06-22 11:44:41,142 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,142 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:44:41,145 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:44:41,145 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:44:41,146 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-06-22 11:44:41,146 INFO ]: Start accepts. Automaton has 24 states and 43 transitions. Word has length 13 [2018-06-22 11:44:41,146 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:41,146 INFO ]: Abstraction has 24 states and 43 transitions. [2018-06-22 11:44:41,146 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:41,146 INFO ]: Start isEmpty. Operand 24 states and 43 transitions. [2018-06-22 11:44:41,147 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:41,147 INFO ]: Found error trace [2018-06-22 11:44:41,147 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:41,147 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:41,147 INFO ]: Analyzing trace with hash -1029948953, now seen corresponding path program 1 times [2018-06-22 11:44:41,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:41,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:41,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:41,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,374 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,374 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:41,374 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:41,374 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:41,374 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:41,374 INFO ]: Start difference. First operand 24 states and 43 transitions. Second operand 4 states. [2018-06-22 11:44:41,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:41,567 INFO ]: Finished difference Result 39 states and 78 transitions. [2018-06-22 11:44:41,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:41,568 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:44:41,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:41,568 INFO ]: With dead ends: 39 [2018-06-22 11:44:41,568 INFO ]: Without dead ends: 39 [2018-06-22 11:44:41,568 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,569 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:44:41,574 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-06-22 11:44:41,574 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:44:41,575 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2018-06-22 11:44:41,575 INFO ]: Start accepts. Automaton has 33 states and 65 transitions. Word has length 17 [2018-06-22 11:44:41,575 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:41,575 INFO ]: Abstraction has 33 states and 65 transitions. [2018-06-22 11:44:41,575 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:41,575 INFO ]: Start isEmpty. Operand 33 states and 65 transitions. [2018-06-22 11:44:41,576 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:41,576 INFO ]: Found error trace [2018-06-22 11:44:41,576 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:41,576 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:41,576 INFO ]: Analyzing trace with hash 1430864412, now seen corresponding path program 1 times [2018-06-22 11:44:41,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:41,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:41,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:41,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,617 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,617 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,617 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:41,617 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:41,617 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:41,617 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:41,617 INFO ]: Start difference. First operand 33 states and 65 transitions. Second operand 4 states. [2018-06-22 11:44:41,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:41,718 INFO ]: Finished difference Result 39 states and 74 transitions. [2018-06-22 11:44:41,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:41,718 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:44:41,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:41,719 INFO ]: With dead ends: 39 [2018-06-22 11:44:41,719 INFO ]: Without dead ends: 35 [2018-06-22 11:44:41,719 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,719 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:44:41,724 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 11:44:41,724 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:44:41,724 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2018-06-22 11:44:41,724 INFO ]: Start accepts. Automaton has 29 states and 56 transitions. Word has length 17 [2018-06-22 11:44:41,724 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:41,724 INFO ]: Abstraction has 29 states and 56 transitions. [2018-06-22 11:44:41,724 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:41,724 INFO ]: Start isEmpty. Operand 29 states and 56 transitions. [2018-06-22 11:44:41,725 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:41,725 INFO ]: Found error trace [2018-06-22 11:44:41,725 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:41,725 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:41,725 INFO ]: Analyzing trace with hash -1864479022, now seen corresponding path program 1 times [2018-06-22 11:44:41,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:41,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:41,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:41,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,856 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,856 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,856 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:41,856 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:41,856 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:41,856 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:41,856 INFO ]: Start difference. First operand 29 states and 56 transitions. Second operand 4 states. [2018-06-22 11:44:41,924 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:41,924 INFO ]: Finished difference Result 40 states and 68 transitions. [2018-06-22 11:44:41,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:41,924 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:44:41,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:41,924 INFO ]: With dead ends: 40 [2018-06-22 11:44:41,924 INFO ]: Without dead ends: 37 [2018-06-22 11:44:41,925 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,925 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:44:41,929 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-06-22 11:44:41,929 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:44:41,930 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 53 transitions. [2018-06-22 11:44:41,930 INFO ]: Start accepts. Automaton has 31 states and 53 transitions. Word has length 17 [2018-06-22 11:44:41,930 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:41,930 INFO ]: Abstraction has 31 states and 53 transitions. [2018-06-22 11:44:41,930 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:41,930 INFO ]: Start isEmpty. Operand 31 states and 53 transitions. [2018-06-22 11:44:41,931 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:41,931 INFO ]: Found error trace [2018-06-22 11:44:41,931 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:41,931 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:41,931 INFO ]: Analyzing trace with hash 1639538801, now seen corresponding path program 1 times [2018-06-22 11:44:41,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:41,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:41,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:41,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,971 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,971 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,971 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:41,971 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:41,971 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:41,971 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:41,971 INFO ]: Start difference. First operand 31 states and 53 transitions. Second operand 4 states. [2018-06-22 11:44:42,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:42,093 INFO ]: Finished difference Result 37 states and 61 transitions. [2018-06-22 11:44:42,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:42,094 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:44:42,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:42,094 INFO ]: With dead ends: 37 [2018-06-22 11:44:42,094 INFO ]: Without dead ends: 30 [2018-06-22 11:44:42,094 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:42,095 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:44:42,097 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:44:42,097 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:44:42,098 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2018-06-22 11:44:42,098 INFO ]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 17 [2018-06-22 11:44:42,098 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:42,098 INFO ]: Abstraction has 28 states and 45 transitions. [2018-06-22 11:44:42,098 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:42,098 INFO ]: Start isEmpty. Operand 28 states and 45 transitions. [2018-06-22 11:44:42,099 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:42,099 INFO ]: Found error trace [2018-06-22 11:44:42,099 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:42,099 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:42,099 INFO ]: Analyzing trace with hash -935146880, now seen corresponding path program 1 times [2018-06-22 11:44:42,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:42,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:42,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:42,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:42,208 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:42,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:42,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:42,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:42,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:42,237 INFO ]: Computing forward predicates... [2018-06-22 11:44:42,477 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:42,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:42,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:44:42,509 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:44:42,509 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:44:42,509 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:42,510 INFO ]: Start difference. First operand 28 states and 45 transitions. Second operand 10 states. [2018-06-22 11:44:42,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:42,810 INFO ]: Finished difference Result 34 states and 49 transitions. [2018-06-22 11:44:42,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:44:42,810 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:44:42,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:42,810 INFO ]: With dead ends: 34 [2018-06-22 11:44:42,810 INFO ]: Without dead ends: 34 [2018-06-22 11:44:42,811 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:44:42,811 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:44:42,814 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-06-22 11:44:42,814 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:44:42,814 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2018-06-22 11:44:42,814 INFO ]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 17 [2018-06-22 11:44:42,814 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:42,814 INFO ]: Abstraction has 28 states and 43 transitions. [2018-06-22 11:44:42,814 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:44:42,815 INFO ]: Start isEmpty. Operand 28 states and 43 transitions. [2018-06-22 11:44:42,815 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:42,815 INFO ]: Found error trace [2018-06-22 11:44:42,815 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:42,815 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:42,815 INFO ]: Analyzing trace with hash 1299157276, now seen corresponding path program 2 times [2018-06-22 11:44:42,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:42,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:42,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:42,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:43,085 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:43,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:43,085 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:43,090 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:43,104 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:43,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:43,106 INFO ]: Computing forward predicates... [2018-06-22 11:44:43,148 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:43,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:43,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:44:43,167 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:43,167 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:43,168 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:43,168 INFO ]: Start difference. First operand 28 states and 43 transitions. Second operand 8 states. [2018-06-22 11:44:43,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:43,240 INFO ]: Finished difference Result 32 states and 48 transitions. [2018-06-22 11:44:43,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:43,240 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:44:43,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:43,241 INFO ]: With dead ends: 32 [2018-06-22 11:44:43,241 INFO ]: Without dead ends: 32 [2018-06-22 11:44:43,241 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:43,241 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:44:43,245 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:44:43,245 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:44:43,245 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-06-22 11:44:43,245 INFO ]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 17 [2018-06-22 11:44:43,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:43,245 INFO ]: Abstraction has 28 states and 42 transitions. [2018-06-22 11:44:43,245 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:43,246 INFO ]: Start isEmpty. Operand 28 states and 42 transitions. [2018-06-22 11:44:43,246 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:43,246 INFO ]: Found error trace [2018-06-22 11:44:43,246 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:43,246 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:43,246 INFO ]: Analyzing trace with hash -1860131510, now seen corresponding path program 1 times [2018-06-22 11:44:43,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:43,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:43,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:43,247 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:43,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:43,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:43,389 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:43,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:43,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:43,395 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:43,416 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:43,418 INFO ]: Computing forward predicates... [2018-06-22 11:44:43,456 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:43,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:43,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:44:43,488 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:43,488 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:43,488 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:43,488 INFO ]: Start difference. First operand 28 states and 42 transitions. Second operand 7 states. [2018-06-22 11:44:43,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:43,568 INFO ]: Finished difference Result 32 states and 47 transitions. [2018-06-22 11:44:43,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:43,568 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:44:43,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:43,568 INFO ]: With dead ends: 32 [2018-06-22 11:44:43,568 INFO ]: Without dead ends: 25 [2018-06-22 11:44:43,568 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:43,568 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:44:43,570 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:44:43,570 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:44:43,570 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-06-22 11:44:43,570 INFO ]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 17 [2018-06-22 11:44:43,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:43,570 INFO ]: Abstraction has 21 states and 31 transitions. [2018-06-22 11:44:43,570 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:43,571 INFO ]: Start isEmpty. Operand 21 states and 31 transitions. [2018-06-22 11:44:43,571 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:43,571 INFO ]: Found error trace [2018-06-22 11:44:43,571 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:43,571 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:43,571 INFO ]: Analyzing trace with hash 302479579, now seen corresponding path program 1 times [2018-06-22 11:44:43,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:43,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:43,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:43,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:43,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:43,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:44,325 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:44,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:44,325 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:44,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:44,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:44,354 INFO ]: Computing forward predicates... [2018-06-22 11:44:44,446 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:44,466 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:44,467 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:44:44,467 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:44:44,467 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:44:44,467 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:44,467 INFO ]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2018-06-22 11:44:44,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:44,681 INFO ]: Finished difference Result 23 states and 31 transitions. [2018-06-22 11:44:44,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:44,682 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:44:44,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:44,682 INFO ]: With dead ends: 23 [2018-06-22 11:44:44,682 INFO ]: Without dead ends: 21 [2018-06-22 11:44:44,682 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:44:44,683 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:44:44,684 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:44:44,684 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:44:44,684 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-22 11:44:44,684 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 17 [2018-06-22 11:44:44,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:44,685 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-22 11:44:44,685 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:44:44,685 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-22 11:44:44,685 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:44,685 INFO ]: Found error trace [2018-06-22 11:44:44,685 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:44,685 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:44,685 INFO ]: Analyzing trace with hash -622505051, now seen corresponding path program 1 times [2018-06-22 11:44:44,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:44,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:44,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:44,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:44,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:44,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:44,822 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:44,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:44,822 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:44,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:44,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:44,845 INFO ]: Computing forward predicates... [2018-06-22 11:44:44,923 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:44,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:44,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:44:44,943 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:44,943 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:44,943 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:44,943 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 7 states. [2018-06-22 11:44:45,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:45,030 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-22 11:44:45,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:45,031 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:44:45,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:45,031 INFO ]: With dead ends: 19 [2018-06-22 11:44:45,031 INFO ]: Without dead ends: 18 [2018-06-22 11:44:45,031 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:45,031 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 11:44:45,032 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 11:44:45,032 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:45,033 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-22 11:44:45,033 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 17 [2018-06-22 11:44:45,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:45,033 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-22 11:44:45,033 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:45,033 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-22 11:44:45,033 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:45,033 INFO ]: Found error trace [2018-06-22 11:44:45,033 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:45,033 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:45,033 INFO ]: Analyzing trace with hash -1295691246, now seen corresponding path program 2 times [2018-06-22 11:44:45,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:45,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:45,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:45,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:45,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:45,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:45,127 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:45,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:45,127 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:45,133 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:45,146 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:45,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:45,149 INFO ]: Computing forward predicates... [2018-06-22 11:44:45,182 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:45,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:45,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:44:45,202 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:45,202 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:45,202 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:45,202 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 7 states. [2018-06-22 11:44:45,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:45,309 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-22 11:44:45,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:45,309 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:44:45,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:45,310 INFO ]: With dead ends: 14 [2018-06-22 11:44:45,310 INFO ]: Without dead ends: 0 [2018-06-22 11:44:45,310 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:45,310 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:44:45,310 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:44:45,310 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:44:45,310 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:44:45,310 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:44:45,310 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:45,310 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:44:45,310 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:45,310 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:44:45,310 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:44:45,314 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:44:45 BoogieIcfgContainer [2018-06-22 11:44:45,314 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:44:45,315 INFO ]: Toolchain (without parser) took 11354.96 ms. Allocated memory was 306.2 MB in the beginning and 408.9 MB in the end (delta: 102.8 MB). Free memory was 258.6 MB in the beginning and 272.2 MB in the end (delta: -13.6 MB). Peak memory consumption was 89.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:45,316 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:44:45,316 INFO ]: ChcToBoogie took 56.04 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:45,316 INFO ]: Boogie Preprocessor took 64.52 ms. Allocated memory is still 306.2 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:45,317 INFO ]: RCFGBuilder took 453.64 ms. Allocated memory is still 306.2 MB. Free memory was 254.5 MB in the beginning and 242.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:45,317 INFO ]: TraceAbstraction took 10770.56 ms. Allocated memory was 306.2 MB in the beginning and 408.9 MB in the end (delta: 102.8 MB). Free memory was 242.5 MB in the beginning and 272.2 MB in the end (delta: -29.7 MB). Peak memory consumption was 73.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:45,329 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 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.04 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 256.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 64.52 ms. Allocated memory is still 306.2 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 453.64 ms. Allocated memory is still 306.2 MB. Free memory was 254.5 MB in the beginning and 242.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 10770.56 ms. Allocated memory was 306.2 MB in the beginning and 408.9 MB in the end (delta: 102.8 MB). Free memory was 242.5 MB in the beginning and 272.2 MB in the end (delta: -29.7 MB). Peak memory consumption was 73.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. SAFE Result, 10.7s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 602 SDtfs, 98 SDslu, 1201 SDs, 0 SdLazy, 1590 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 191 SyntacticMatches, 38 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 100 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 508 ConstructedInterpolants, 2 QuantifiedInterpolants, 38756 SizeOfPredicates, 115 NumberOfNonLiveVariables, 1285 ConjunctsInSsa, 431 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 122/198 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strcmp.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-44-45-339.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strcmp.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-44-45-339.csv Received shutdown request...