java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:39:44,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:39:44,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:39:44,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:39:44,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:39:44,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:39:44,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:39:44,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:39:44,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:39:44,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:39:44,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:39:44,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:39:44,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:39:44,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:39:44,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:39:44,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:39:44,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:39:44,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:39:44,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:39:44,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:39:44,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:39:44,869 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:39:44,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:39:44,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:39:44,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:39:44,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:39:44,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:39:44,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:39:44,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:39:44,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:39:44,879 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:39:44,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:39:44,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:39:44,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:39:44,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:39:44,882 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:39:44,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:39:44,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:39:44,906 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:39:44,906 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:39:44,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:39:44,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:39:44,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:39:44,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:39:44,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:39:44,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:39:44,909 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:39:44,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:39:44,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:39:44,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:39:44,909 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:39:44,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:39:44,910 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:39:44,911 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:39:44,912 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:39:44,962 INFO ]: Repository-Root is: /tmp [2018-06-22 01:39:44,979 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:39:44,985 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:39:44,987 INFO ]: Initializing SmtParser... [2018-06-22 01:39:44,987 INFO ]: SmtParser initialized [2018-06-22 01:39:44,988 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 [2018-06-22 01:39:44,989 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:39:45,088 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 unknown [2018-06-22 01:39:45,453 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 [2018-06-22 01:39:45,458 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:39:45,475 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:39:45,475 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:39:45,475 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:39:45,476 INFO ]: ChcToBoogie initialized [2018-06-22 01:39:45,479 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,546 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45 Unit [2018-06-22 01:39:45,546 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:39:45,547 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:39:45,547 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:39:45,547 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:39:45,562 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,562 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,568 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,568 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,573 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,577 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,579 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... [2018-06-22 01:39:45,582 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:39:45,582 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:39:45,583 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:39:45,583 INFO ]: RCFGBuilder initialized [2018-06-22 01:39:45,584 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:39:45,596 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:39:45,596 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:39:45,596 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:39:45,596 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:39:45,596 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:39:45,596 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:39:46,151 INFO ]: Using library mode [2018-06-22 01:39:46,151 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:39:46 BoogieIcfgContainer [2018-06-22 01:39:46,151 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:39:46,153 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:39:46,153 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:39:46,156 INFO ]: TraceAbstraction initialized [2018-06-22 01:39:46,156 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:39:45" (1/3) ... [2018-06-22 01:39:46,157 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101dcda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:39:46, skipping insertion in model container [2018-06-22 01:39:46,157 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:45" (2/3) ... [2018-06-22 01:39:46,157 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101dcda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:39:46, skipping insertion in model container [2018-06-22 01:39:46,157 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:39:46" (3/3) ... [2018-06-22 01:39:46,159 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:39:46,169 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:39:46,179 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:39:46,225 INFO ]: Using default assertion order modulation [2018-06-22 01:39:46,225 INFO ]: Interprodecural is true [2018-06-22 01:39:46,225 INFO ]: Hoare is false [2018-06-22 01:39:46,225 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:39:46,225 INFO ]: Backedges is TWOTRACK [2018-06-22 01:39:46,225 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:39:46,225 INFO ]: Difference is false [2018-06-22 01:39:46,225 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:39:46,225 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:39:46,241 INFO ]: Start isEmpty. Operand 44 states. [2018-06-22 01:39:46,256 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:39:46,256 INFO ]: Found error trace [2018-06-22 01:39:46,257 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:46,257 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:46,261 INFO ]: Analyzing trace with hash 150014137, now seen corresponding path program 1 times [2018-06-22 01:39:46,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:46,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:46,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:46,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:46,373 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:46,379 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:46,379 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:39:46,381 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:39:46,395 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:39:46,395 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:39:46,397 INFO ]: Start difference. First operand 44 states. Second operand 2 states. [2018-06-22 01:39:46,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:46,429 INFO ]: Finished difference Result 42 states and 60 transitions. [2018-06-22 01:39:46,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:39:46,431 INFO ]: Start accepts. Automaton has 2 states. Word has length 12 [2018-06-22 01:39:46,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:46,448 INFO ]: With dead ends: 42 [2018-06-22 01:39:46,448 INFO ]: Without dead ends: 42 [2018-06-22 01:39:46,451 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 01:39:46,469 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:39:46,495 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:39:46,496 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:39:46,500 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-06-22 01:39:46,503 INFO ]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2018-06-22 01:39:46,503 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:46,503 INFO ]: Abstraction has 42 states and 60 transitions. [2018-06-22 01:39:46,503 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:39:46,503 INFO ]: Start isEmpty. Operand 42 states and 60 transitions. [2018-06-22 01:39:46,506 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:39:46,506 INFO ]: Found error trace [2018-06-22 01:39:46,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:46,506 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:46,507 INFO ]: Analyzing trace with hash 501086248, now seen corresponding path program 1 times [2018-06-22 01:39:46,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:46,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:46,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:46,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:46,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:46,663 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:46,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:46,664 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:46,665 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:46,666 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:46,666 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:46,666 INFO ]: Start difference. First operand 42 states and 60 transitions. Second operand 4 states. [2018-06-22 01:39:47,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:47,700 INFO ]: Finished difference Result 65 states and 95 transitions. [2018-06-22 01:39:47,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:47,701 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-22 01:39:47,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:47,704 INFO ]: With dead ends: 65 [2018-06-22 01:39:47,704 INFO ]: Without dead ends: 65 [2018-06-22 01:39:47,705 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:47,705 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:39:47,722 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-06-22 01:39:47,722 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:39:47,725 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2018-06-22 01:39:47,725 INFO ]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 14 [2018-06-22 01:39:47,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:47,725 INFO ]: Abstraction has 65 states and 95 transitions. [2018-06-22 01:39:47,725 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:47,725 INFO ]: Start isEmpty. Operand 65 states and 95 transitions. [2018-06-22 01:39:47,729 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:39:47,729 INFO ]: Found error trace [2018-06-22 01:39:47,729 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:47,729 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:47,729 INFO ]: Analyzing trace with hash 1982285772, now seen corresponding path program 1 times [2018-06-22 01:39:47,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:47,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:47,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:47,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:47,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:47,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,056 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:48,057 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:48,057 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:39:48,057 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:39:48,057 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:39:48,057 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:48,057 INFO ]: Start difference. First operand 65 states and 95 transitions. Second operand 5 states. [2018-06-22 01:39:48,394 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:39:48,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:48,521 INFO ]: Finished difference Result 104 states and 211 transitions. [2018-06-22 01:39:48,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:48,522 INFO ]: Start accepts. Automaton has 5 states. Word has length 15 [2018-06-22 01:39:48,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:48,530 INFO ]: With dead ends: 104 [2018-06-22 01:39:48,530 INFO ]: Without dead ends: 104 [2018-06-22 01:39:48,531 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:39:48,531 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 01:39:48,561 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 70. [2018-06-22 01:39:48,561 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:39:48,563 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2018-06-22 01:39:48,563 INFO ]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 15 [2018-06-22 01:39:48,563 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:48,563 INFO ]: Abstraction has 70 states and 101 transitions. [2018-06-22 01:39:48,563 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:39:48,563 INFO ]: Start isEmpty. Operand 70 states and 101 transitions. [2018-06-22 01:39:48,567 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:39:48,567 INFO ]: Found error trace [2018-06-22 01:39:48,567 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:48,567 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:48,568 INFO ]: Analyzing trace with hash -685787532, now seen corresponding path program 1 times [2018-06-22 01:39:48,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:48,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:48,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:48,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:48,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:48,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,628 INFO ]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:48,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:48,628 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:48,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:48,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:48,693 INFO ]: Computing forward predicates... [2018-06-22 01:39:48,725 INFO ]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:48,761 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:48,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:48,762 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:48,762 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:48,762 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:48,762 INFO ]: Start difference. First operand 70 states and 101 transitions. Second operand 4 states. [2018-06-22 01:39:49,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:49,674 INFO ]: Finished difference Result 91 states and 133 transitions. [2018-06-22 01:39:49,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:49,675 INFO ]: Start accepts. Automaton has 4 states. Word has length 28 [2018-06-22 01:39:49,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:49,677 INFO ]: With dead ends: 91 [2018-06-22 01:39:49,677 INFO ]: Without dead ends: 91 [2018-06-22 01:39:49,677 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 30 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 01:39:49,677 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:39:49,687 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-06-22 01:39:49,687 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 01:39:49,689 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2018-06-22 01:39:49,689 INFO ]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 28 [2018-06-22 01:39:49,690 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:49,690 INFO ]: Abstraction has 91 states and 133 transitions. [2018-06-22 01:39:49,690 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:49,690 INFO ]: Start isEmpty. Operand 91 states and 133 transitions. [2018-06-22 01:39:49,695 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:39:49,695 INFO ]: Found error trace [2018-06-22 01:39:49,695 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:49,695 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:49,696 INFO ]: Analyzing trace with hash 970444691, now seen corresponding path program 1 times [2018-06-22 01:39:49,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:49,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:49,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:49,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:49,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:49,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:49,815 INFO ]: Checked inductivity of 62 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:39:49,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:49,815 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:49,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:49,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:49,890 INFO ]: Computing forward predicates... [2018-06-22 01:39:49,900 INFO ]: Checked inductivity of 62 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 01:39:49,933 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:39:49,933 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:39:49,934 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:49,934 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:49,934 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:49,934 INFO ]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2018-06-22 01:39:50,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:50,395 INFO ]: Finished difference Result 127 states and 186 transitions. [2018-06-22 01:39:50,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:50,395 INFO ]: Start accepts. Automaton has 4 states. Word has length 56 [2018-06-22 01:39:50,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:50,398 INFO ]: With dead ends: 127 [2018-06-22 01:39:50,398 INFO ]: Without dead ends: 127 [2018-06-22 01:39:50,399 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:50,399 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 01:39:50,420 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-06-22 01:39:50,420 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 01:39:50,423 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 186 transitions. [2018-06-22 01:39:50,424 INFO ]: Start accepts. Automaton has 127 states and 186 transitions. Word has length 56 [2018-06-22 01:39:50,424 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:50,424 INFO ]: Abstraction has 127 states and 186 transitions. [2018-06-22 01:39:50,424 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:50,424 INFO ]: Start isEmpty. Operand 127 states and 186 transitions. [2018-06-22 01:39:50,432 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-22 01:39:50,432 INFO ]: Found error trace [2018-06-22 01:39:50,433 INFO ]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:50,433 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:50,433 INFO ]: Analyzing trace with hash -397950165, now seen corresponding path program 1 times [2018-06-22 01:39:50,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:50,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:50,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:50,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:50,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:50,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:50,936 INFO ]: Checked inductivity of 136 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 01:39:50,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:50,936 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) [2018-06-22 01:39:50,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:51,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:51,026 INFO ]: Computing forward predicates... [2018-06-22 01:39:51,487 INFO ]: Checked inductivity of 136 backedges. 81 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 01:39:51,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:51,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-06-22 01:39:51,523 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:39:51,523 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:39:51,523 INFO ]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:39:51,523 INFO ]: Start difference. First operand 127 states and 186 transitions. Second operand 22 states. [2018-06-22 01:39:58,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:58,942 INFO ]: Finished difference Result 514 states and 1493 transitions. [2018-06-22 01:39:58,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:39:58,943 INFO ]: Start accepts. Automaton has 22 states. Word has length 80 [2018-06-22 01:39:58,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:58,965 INFO ]: With dead ends: 514 [2018-06-22 01:39:58,965 INFO ]: Without dead ends: 308 [2018-06-22 01:39:58,967 INFO ]: 0 DeclaredPredicates, 171 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=660, Invalid=4742, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:39:58,968 INFO ]: Start minimizeSevpa. Operand 308 states. [2018-06-22 01:39:59,062 INFO ]: Finished minimizeSevpa. Reduced states from 308 to 162. [2018-06-22 01:39:59,062 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-22 01:39:59,071 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 265 transitions. [2018-06-22 01:39:59,071 INFO ]: Start accepts. Automaton has 162 states and 265 transitions. Word has length 80 [2018-06-22 01:39:59,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:59,071 INFO ]: Abstraction has 162 states and 265 transitions. [2018-06-22 01:39:59,072 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:39:59,072 INFO ]: Start isEmpty. Operand 162 states and 265 transitions. [2018-06-22 01:39:59,079 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 01:39:59,079 INFO ]: Found error trace [2018-06-22 01:39:59,079 INFO ]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:59,079 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:59,079 INFO ]: Analyzing trace with hash 808524527, now seen corresponding path program 1 times [2018-06-22 01:39:59,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:59,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:59,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:59,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:59,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:59,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:59,190 INFO ]: Checked inductivity of 146 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-22 01:39:59,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:59,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:59,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:59,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:59,289 INFO ]: Computing forward predicates... [2018-06-22 01:39:59,305 INFO ]: Checked inductivity of 146 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 01:39:59,340 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:59,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:59,341 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:59,341 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:59,341 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:59,341 INFO ]: Start difference. First operand 162 states and 265 transitions. Second operand 4 states. [2018-06-22 01:39:59,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:59,647 INFO ]: Finished difference Result 224 states and 358 transitions. [2018-06-22 01:39:59,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:59,647 INFO ]: Start accepts. Automaton has 4 states. Word has length 81 [2018-06-22 01:39:59,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:59,664 INFO ]: With dead ends: 224 [2018-06-22 01:39:59,664 INFO ]: Without dead ends: 188 [2018-06-22 01:39:59,665 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:59,665 INFO ]: Start minimizeSevpa. Operand 188 states. [2018-06-22 01:39:59,683 INFO ]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-06-22 01:39:59,683 INFO ]: Start removeUnreachable. Operand 188 states. [2018-06-22 01:39:59,686 INFO ]: Finished removeUnreachable. Reduced from 188 states to 188 states and 294 transitions. [2018-06-22 01:39:59,686 INFO ]: Start accepts. Automaton has 188 states and 294 transitions. Word has length 81 [2018-06-22 01:39:59,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:59,686 INFO ]: Abstraction has 188 states and 294 transitions. [2018-06-22 01:39:59,686 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:59,686 INFO ]: Start isEmpty. Operand 188 states and 294 transitions. [2018-06-22 01:39:59,697 INFO ]: Finished isEmpty. Found accepting run of length 131 [2018-06-22 01:39:59,697 INFO ]: Found error trace [2018-06-22 01:39:59,697 INFO ]: trace histogram [10, 10, 10, 9, 8, 8, 8, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:59,697 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:59,697 INFO ]: Analyzing trace with hash -611513714, now seen corresponding path program 1 times [2018-06-22 01:39:59,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:59,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:59,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:59,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:59,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:59,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:59,823 INFO ]: Checked inductivity of 401 backedges. 50 proven. 14 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-06-22 01:39:59,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:59,823 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:39:59,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:59,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:59,942 INFO ]: Computing forward predicates... [2018-06-22 01:39:59,963 INFO ]: Checked inductivity of 401 backedges. 194 proven. 6 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-06-22 01:39:59,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:59,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:59,996 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:59,996 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:59,996 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:59,997 INFO ]: Start difference. First operand 188 states and 294 transitions. Second operand 4 states. [2018-06-22 01:40:00,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:00,304 INFO ]: Finished difference Result 230 states and 361 transitions. [2018-06-22 01:40:00,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:40:00,304 INFO ]: Start accepts. Automaton has 4 states. Word has length 130 [2018-06-22 01:40:00,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:00,308 INFO ]: With dead ends: 230 [2018-06-22 01:40:00,308 INFO ]: Without dead ends: 230 [2018-06-22 01:40:00,308 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:40:00,309 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 01:40:00,322 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-06-22 01:40:00,322 INFO ]: Start removeUnreachable. Operand 221 states. [2018-06-22 01:40:00,325 INFO ]: Finished removeUnreachable. Reduced from 221 states to 221 states and 343 transitions. [2018-06-22 01:40:00,325 INFO ]: Start accepts. Automaton has 221 states and 343 transitions. Word has length 130 [2018-06-22 01:40:00,326 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:00,326 INFO ]: Abstraction has 221 states and 343 transitions. [2018-06-22 01:40:00,326 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:40:00,326 INFO ]: Start isEmpty. Operand 221 states and 343 transitions. [2018-06-22 01:40:00,338 INFO ]: Finished isEmpty. Found accepting run of length 353 [2018-06-22 01:40:00,338 INFO ]: Found error trace [2018-06-22 01:40:00,338 INFO ]: trace histogram [28, 28, 28, 26, 22, 20, 20, 19, 10, 10, 10, 10, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:00,339 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:00,339 INFO ]: Analyzing trace with hash 687389575, now seen corresponding path program 1 times [2018-06-22 01:40:00,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:00,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:00,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:00,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:00,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:00,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:00,652 INFO ]: Checked inductivity of 3294 backedges. 123 proven. 118 refuted. 0 times theorem prover too weak. 3053 trivial. 0 not checked. [2018-06-22 01:40:00,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:00,652 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:40:00,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:00,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:00,960 INFO ]: Computing forward predicates... [2018-06-22 01:40:01,052 INFO ]: Checked inductivity of 3294 backedges. 1768 proven. 32 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2018-06-22 01:40:01,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:01,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:40:01,075 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:40:01,075 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:40:01,075 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:40:01,075 INFO ]: Start difference. First operand 221 states and 343 transitions. Second operand 4 states. [2018-06-22 01:40:01,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:01,204 INFO ]: Finished difference Result 254 states and 395 transitions. [2018-06-22 01:40:01,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:40:01,204 INFO ]: Start accepts. Automaton has 4 states. Word has length 352 [2018-06-22 01:40:01,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:01,208 INFO ]: With dead ends: 254 [2018-06-22 01:40:01,208 INFO ]: Without dead ends: 203 [2018-06-22 01:40:01,208 INFO ]: 0 DeclaredPredicates, 357 GetRequests, 354 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 01:40:01,208 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-22 01:40:01,219 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-06-22 01:40:01,219 INFO ]: Start removeUnreachable. Operand 203 states. [2018-06-22 01:40:01,221 INFO ]: Finished removeUnreachable. Reduced from 203 states to 203 states and 305 transitions. [2018-06-22 01:40:01,222 INFO ]: Start accepts. Automaton has 203 states and 305 transitions. Word has length 352 [2018-06-22 01:40:01,222 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:01,222 INFO ]: Abstraction has 203 states and 305 transitions. [2018-06-22 01:40:01,222 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:40:01,222 INFO ]: Start isEmpty. Operand 203 states and 305 transitions. [2018-06-22 01:40:01,228 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 01:40:01,228 INFO ]: Found error trace [2018-06-22 01:40:01,228 INFO ]: trace histogram [16, 16, 16, 15, 13, 12, 12, 12, 7, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:01,228 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:01,228 INFO ]: Analyzing trace with hash 1070076497, now seen corresponding path program 1 times [2018-06-22 01:40:01,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:01,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:01,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:01,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:01,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:01,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:01,464 INFO ]: Checked inductivity of 1082 backedges. 86 proven. 44 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-06-22 01:40:01,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:01,465 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) [2018-06-22 01:40:01,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:40:01,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:01,624 INFO ]: Computing forward predicates... [2018-06-22 01:40:01,662 INFO ]: Checked inductivity of 1082 backedges. 352 proven. 32 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2018-06-22 01:40:01,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:01,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:40:01,689 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:40:01,689 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:40:01,689 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:40:01,690 INFO ]: Start difference. First operand 203 states and 305 transitions. Second operand 4 states. [2018-06-22 01:40:01,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:01,820 INFO ]: Finished difference Result 255 states and 385 transitions. [2018-06-22 01:40:01,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:40:01,821 INFO ]: Start accepts. Automaton has 4 states. Word has length 205 [2018-06-22 01:40:01,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:01,824 INFO ]: With dead ends: 255 [2018-06-22 01:40:01,824 INFO ]: Without dead ends: 225 [2018-06-22 01:40:01,824 INFO ]: 0 DeclaredPredicates, 210 GetRequests, 207 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 01:40:01,824 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-22 01:40:01,836 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-06-22 01:40:01,836 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-22 01:40:01,839 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2018-06-22 01:40:01,839 INFO ]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 205 [2018-06-22 01:40:01,839 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:01,839 INFO ]: Abstraction has 225 states and 332 transitions. [2018-06-22 01:40:01,839 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:40:01,839 INFO ]: Start isEmpty. Operand 225 states and 332 transitions. [2018-06-22 01:40:01,845 INFO ]: Finished isEmpty. Found accepting run of length 246 [2018-06-22 01:40:01,845 INFO ]: Found error trace [2018-06-22 01:40:01,846 INFO ]: trace histogram [19, 19, 19, 18, 16, 15, 14, 14, 8, 7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:01,846 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:01,846 INFO ]: Analyzing trace with hash 525163664, now seen corresponding path program 1 times [2018-06-22 01:40:01,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:01,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:01,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:01,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:01,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:01,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:02,111 INFO ]: Checked inductivity of 1559 backedges. 55 proven. 38 refuted. 0 times theorem prover too weak. 1466 trivial. 0 not checked. [2018-06-22 01:40:02,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:02,111 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:40:02,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:02,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:02,319 INFO ]: Computing forward predicates... [2018-06-22 01:40:02,921 INFO ]: Checked inductivity of 1559 backedges. 455 proven. 163 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-06-22 01:40:02,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:02,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2018-06-22 01:40:02,944 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:40:02,945 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:40:02,945 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:40:02,945 INFO ]: Start difference. First operand 225 states and 332 transitions. Second operand 13 states. [2018-06-22 01:40:04,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:04,572 INFO ]: Finished difference Result 416 states and 854 transitions. [2018-06-22 01:40:04,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:40:04,572 INFO ]: Start accepts. Automaton has 13 states. Word has length 245 [2018-06-22 01:40:04,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:04,577 INFO ]: With dead ends: 416 [2018-06-22 01:40:04,577 INFO ]: Without dead ends: 313 [2018-06-22 01:40:04,578 INFO ]: 0 DeclaredPredicates, 286 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:40:04,578 INFO ]: Start minimizeSevpa. Operand 313 states. [2018-06-22 01:40:04,601 INFO ]: Finished minimizeSevpa. Reduced states from 313 to 211. [2018-06-22 01:40:04,601 INFO ]: Start removeUnreachable. Operand 211 states. [2018-06-22 01:40:04,603 INFO ]: Finished removeUnreachable. Reduced from 211 states to 211 states and 309 transitions. [2018-06-22 01:40:04,603 INFO ]: Start accepts. Automaton has 211 states and 309 transitions. Word has length 245 [2018-06-22 01:40:04,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:04,603 INFO ]: Abstraction has 211 states and 309 transitions. [2018-06-22 01:40:04,603 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:40:04,603 INFO ]: Start isEmpty. Operand 211 states and 309 transitions. [2018-06-22 01:40:04,638 INFO ]: Finished isEmpty. Found accepting run of length 875 [2018-06-22 01:40:04,638 INFO ]: Found error trace [2018-06-22 01:40:04,638 INFO ]: trace histogram [69, 69, 69, 65, 56, 52, 48, 47, 24, 24, 24, 24, 23, 23, 23, 23, 23, 13, 13, 13, 13, 9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:04,638 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:04,639 INFO ]: Analyzing trace with hash 2018032110, now seen corresponding path program 1 times [2018-06-22 01:40:04,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:04,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:04,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:04,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:04,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:04,678 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:05,468 INFO ]: Checked inductivity of 20941 backedges. 603 proven. 622 refuted. 0 times theorem prover too weak. 19716 trivial. 0 not checked. [2018-06-22 01:40:05,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:05,468 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) [2018-06-22 01:40:05,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:40:06,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:06,085 INFO ]: Computing forward predicates... [2018-06-22 01:40:06,544 INFO ]: Checked inductivity of 20941 backedges. 8187 proven. 52 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2018-06-22 01:40:06,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:06,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:40:06,569 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:40:06,570 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:40:06,570 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:40:06,570 INFO ]: Start difference. First operand 211 states and 309 transitions. Second operand 4 states. [2018-06-22 01:40:06,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:06,648 INFO ]: Finished difference Result 172 states and 219 transitions. [2018-06-22 01:40:06,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:40:06,649 INFO ]: Start accepts. Automaton has 4 states. Word has length 874 [2018-06-22 01:40:06,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:06,649 INFO ]: With dead ends: 172 [2018-06-22 01:40:06,649 INFO ]: Without dead ends: 0 [2018-06-22 01:40:06,649 INFO ]: 0 DeclaredPredicates, 879 GetRequests, 876 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 01:40:06,649 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:40:06,649 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:40:06,649 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:40:06,649 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:40:06,649 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 874 [2018-06-22 01:40:06,650 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:06,650 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:40:06,650 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:40:06,650 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:40:06,650 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:40:06,654 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:40:06 BoogieIcfgContainer [2018-06-22 01:40:06,654 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:40:06,654 INFO ]: Toolchain (without parser) took 21195.99 ms. Allocated memory was 306.7 MB in the beginning and 906.0 MB in the end (delta: 599.3 MB). Free memory was 258.3 MB in the beginning and 759.0 MB in the end (delta: -500.7 MB). Peak memory consumption was 98.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:40:06,655 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:40:06,655 INFO ]: ChcToBoogie took 71.38 ms. Allocated memory is still 306.7 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:40:06,656 INFO ]: Boogie Preprocessor took 34.96 ms. Allocated memory is still 306.7 MB. Free memory was 255.3 MB in the beginning and 253.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:40:06,656 INFO ]: RCFGBuilder took 568.82 ms. Allocated memory is still 306.7 MB. Free memory was 253.3 MB in the beginning and 236.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:40:06,657 INFO ]: TraceAbstraction took 20501.11 ms. Allocated memory was 306.7 MB in the beginning and 906.0 MB in the end (delta: 599.3 MB). Free memory was 236.2 MB in the beginning and 759.0 MB in the end (delta: -522.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:40:06,659 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 71.38 ms. Allocated memory is still 306.7 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.96 ms. Allocated memory is still 306.7 MB. Free memory was 255.3 MB in the beginning and 253.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 568.82 ms. Allocated memory is still 306.7 MB. Free memory was 253.3 MB in the beginning and 236.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20501.11 ms. Allocated memory was 306.7 MB in the beginning and 906.0 MB in the end (delta: 599.3 MB). Free memory was 236.2 MB in the beginning and 759.0 MB in the end (delta: -522.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. SAFE Result, 20.4s OverallTime, 12 OverallIterations, 69 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 905 SDtfs, 1187 SDslu, 3320 SDs, 0 SdLazy, 6699 SolverSat, 1917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2232 GetRequests, 2093 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=10, 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 291 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4143 NumberOfCodeBlocks, 4143 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4122 ConstructedInterpolants, 0 QuantifiedInterpolants, 2162605 SizeOfPredicates, 28 NumberOfNonLiveVariables, 8774 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 54049/55262 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/bcopy2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-40-06-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-40-06-670.csv Received shutdown request...