java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:05:33,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:05:33,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:05:33,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:05:33,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:05:33,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:05:33,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:05:33,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:05:33,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:05:33,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:05:33,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:05:33,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:05:33,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:05:33,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:05:33,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:05:33,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:05:33,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:05:33,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:05:33,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:05:33,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:05:33,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:05:33,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:05:33,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:05:33,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:05:33,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:05:33,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:05:33,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:05:33,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:05:33,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:05:33,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:05:33,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:05:33,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:05:33,147 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:05:33,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:05:33,149 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:05:33,149 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:05:33,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:05:33,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:05:33,163 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:05:33,163 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:05:33,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:05:33,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:05:33,165 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:05:33,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:05:33,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:05:33,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:05:33,165 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:05:33,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:05:33,166 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:05:33,166 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:05:33,166 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:05:33,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:05:33,166 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:05:33,168 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:05:33,168 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:05:33,211 INFO ]: Repository-Root is: /tmp [2018-06-22 01:05:33,226 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:05:33,232 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:05:33,233 INFO ]: Initializing SmtParser... [2018-06-22 01:05:33,234 INFO ]: SmtParser initialized [2018-06-22 01:05:33,234 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 [2018-06-22 01:05:33,236 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:05:33,327 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 unknown [2018-06-22 01:05:33,741 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 [2018-06-22 01:05:33,746 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:05:33,756 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:05:33,756 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:05:33,756 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:05:33,757 INFO ]: ChcToBoogie initialized [2018-06-22 01:05:33,765 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,839 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33 Unit [2018-06-22 01:05:33,839 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:05:33,844 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:05:33,844 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:05:33,844 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:05:33,862 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,863 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,868 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,869 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,873 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,874 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,875 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (1/1) ... [2018-06-22 01:05:33,882 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:05:33,882 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:05:33,882 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:05:33,882 INFO ]: RCFGBuilder initialized [2018-06-22 01:05:33,883 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:05:33,893 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:05:33,893 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:05:33,893 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:05:33,893 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:05:33,893 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:05:33,893 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:05:34,363 INFO ]: Using library mode [2018-06-22 01:05:34,363 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:05:34 BoogieIcfgContainer [2018-06-22 01:05:34,363 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:05:34,370 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:05:34,370 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:05:34,375 INFO ]: TraceAbstraction initialized [2018-06-22 01:05:34,375 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:05:33" (1/3) ... [2018-06-22 01:05:34,376 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540896f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:05:34, skipping insertion in model container [2018-06-22 01:05:34,376 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:33" (2/3) ... [2018-06-22 01:05:34,376 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540896f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:05:34, skipping insertion in model container [2018-06-22 01:05:34,376 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:05:34" (3/3) ... [2018-06-22 01:05:34,378 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:05:34,384 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:05:34,391 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:05:34,428 INFO ]: Using default assertion order modulation [2018-06-22 01:05:34,428 INFO ]: Interprodecural is true [2018-06-22 01:05:34,428 INFO ]: Hoare is false [2018-06-22 01:05:34,428 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:05:34,428 INFO ]: Backedges is TWOTRACK [2018-06-22 01:05:34,428 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:05:34,428 INFO ]: Difference is false [2018-06-22 01:05:34,429 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:05:34,429 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:05:34,444 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 01:05:34,460 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:05:34,460 INFO ]: Found error trace [2018-06-22 01:05:34,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:05:34,461 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:34,465 INFO ]: Analyzing trace with hash -1536979424, now seen corresponding path program 1 times [2018-06-22 01:05:34,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:34,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:34,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:34,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:34,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:34,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:35,372 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:05:35,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:35,376 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:05:35,379 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:05:35,395 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:05:35,396 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:05:35,399 INFO ]: Start difference. First operand 30 states. Second operand 13 states. [2018-06-22 01:05:36,109 WARN ]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-22 01:05:36,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:36,740 INFO ]: Finished difference Result 41 states and 46 transitions. [2018-06-22 01:05:36,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:05:36,742 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:05:36,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:36,750 INFO ]: With dead ends: 41 [2018-06-22 01:05:36,751 INFO ]: Without dead ends: 38 [2018-06-22 01:05:36,753 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:05:36,769 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:05:36,788 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-06-22 01:05:36,789 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:05:36,790 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-22 01:05:36,791 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2018-06-22 01:05:36,792 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:36,792 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-22 01:05:36,792 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:05:36,792 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-22 01:05:36,792 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:05:36,793 INFO ]: Found error trace [2018-06-22 01:05:36,793 INFO ]: trace histogram [2, 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:05:36,793 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:36,793 INFO ]: Analyzing trace with hash 273050465, now seen corresponding path program 1 times [2018-06-22 01:05:36,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:36,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:36,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:36,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:36,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:36,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:37,260 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:37,260 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:37,260 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 01:05:37,262 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:05:37,262 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:05:37,262 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:05:37,263 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 9 states. [2018-06-22 01:05:37,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:37,465 INFO ]: Finished difference Result 38 states and 42 transitions. [2018-06-22 01:05:37,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:05:37,466 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 01:05:37,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:37,467 INFO ]: With dead ends: 38 [2018-06-22 01:05:37,467 INFO ]: Without dead ends: 37 [2018-06-22 01:05:37,468 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:05:37,468 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:05:37,472 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-06-22 01:05:37,472 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:05:37,473 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-22 01:05:37,473 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2018-06-22 01:05:37,473 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:37,473 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-22 01:05:37,473 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:05:37,473 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-22 01:05:37,474 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:05:37,474 INFO ]: Found error trace [2018-06-22 01:05:37,474 INFO ]: trace histogram [2, 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:05:37,474 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:37,474 INFO ]: Analyzing trace with hash -1981608040, now seen corresponding path program 1 times [2018-06-22 01:05:37,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:37,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:37,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:37,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:37,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:37,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:37,670 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:37,670 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:37,670 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 01:05:37,670 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:05:37,671 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:05:37,671 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:05:37,671 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 9 states. [2018-06-22 01:05:37,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:37,932 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-22 01:05:37,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:05:37,935 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 01:05:37,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:37,936 INFO ]: With dead ends: 37 [2018-06-22 01:05:37,936 INFO ]: Without dead ends: 36 [2018-06-22 01:05:37,936 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:05:37,937 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:05:37,940 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-06-22 01:05:37,940 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:05:37,941 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 01:05:37,941 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2018-06-22 01:05:37,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:37,941 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 01:05:37,941 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:05:37,941 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 01:05:37,942 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:05:37,942 INFO ]: Found error trace [2018-06-22 01:05:37,942 INFO ]: trace histogram [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] [2018-06-22 01:05:37,942 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:37,942 INFO ]: Analyzing trace with hash -2089197198, now seen corresponding path program 1 times [2018-06-22 01:05:37,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:37,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:37,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:37,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:37,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:37,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:38,360 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:38,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:38,360 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:05:38,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:38,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:38,475 INFO ]: Computing forward predicates... [2018-06-22 01:05:39,379 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:39,402 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:05:39,444 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [20] total 30 [2018-06-22 01:05:39,444 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:05:39,444 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:05:39,445 INFO ]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:05:39,445 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 30 states. [2018-06-22 01:05:41,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:41,133 INFO ]: Finished difference Result 89 states and 100 transitions. [2018-06-22 01:05:41,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:05:41,138 INFO ]: Start accepts. Automaton has 30 states. Word has length 26 [2018-06-22 01:05:41,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:41,142 INFO ]: With dead ends: 89 [2018-06-22 01:05:41,142 INFO ]: Without dead ends: 86 [2018-06-22 01:05:41,143 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=652, Invalid=2104, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:05:41,143 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 01:05:41,150 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 45. [2018-06-22 01:05:41,150 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:05:41,151 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-06-22 01:05:41,151 INFO ]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 26 [2018-06-22 01:05:41,151 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:41,151 INFO ]: Abstraction has 45 states and 50 transitions. [2018-06-22 01:05:41,151 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:05:41,151 INFO ]: Start isEmpty. Operand 45 states and 50 transitions. [2018-06-22 01:05:41,152 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:05:41,152 INFO ]: Found error trace [2018-06-22 01:05:41,152 INFO ]: trace histogram [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] [2018-06-22 01:05:41,152 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:41,152 INFO ]: Analyzing trace with hash 1130235683, now seen corresponding path program 1 times [2018-06-22 01:05:41,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:41,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:41,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:41,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:41,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:41,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:41,422 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:41,422 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:41,422 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:05:41,422 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:05:41,422 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:05:41,422 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:05:41,422 INFO ]: Start difference. First operand 45 states and 50 transitions. Second operand 10 states. [2018-06-22 01:05:41,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:41,791 INFO ]: Finished difference Result 71 states and 78 transitions. [2018-06-22 01:05:41,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:05:41,792 INFO ]: Start accepts. Automaton has 10 states. Word has length 26 [2018-06-22 01:05:41,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:41,793 INFO ]: With dead ends: 71 [2018-06-22 01:05:41,793 INFO ]: Without dead ends: 68 [2018-06-22 01:05:41,793 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:05:41,794 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:05:41,796 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 35. [2018-06-22 01:05:41,796 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:05:41,797 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-22 01:05:41,797 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 26 [2018-06-22 01:05:41,797 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:41,797 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-22 01:05:41,797 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:05:41,798 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-22 01:05:41,798 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:05:41,798 INFO ]: Found error trace [2018-06-22 01:05:41,798 INFO ]: trace histogram [3, 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] [2018-06-22 01:05:41,798 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:41,799 INFO ]: Analyzing trace with hash 1076951347, now seen corresponding path program 1 times [2018-06-22 01:05:41,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:41,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:41,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:41,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:41,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:41,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:42,730 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:42,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:42,730 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:05:42,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:42,809 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:42,816 INFO ]: Computing forward predicates... [2018-06-22 01:05:43,581 INFO ]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:05:43,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:05:43,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 40 [2018-06-22 01:05:43,601 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:05:43,602 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:05:43,602 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:05:43,602 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 40 states. [2018-06-22 01:05:47,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:47,486 INFO ]: Finished difference Result 164 states and 191 transitions. [2018-06-22 01:05:47,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:05:47,487 INFO ]: Start accepts. Automaton has 40 states. Word has length 32 [2018-06-22 01:05:47,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:47,490 INFO ]: With dead ends: 164 [2018-06-22 01:05:47,490 INFO ]: Without dead ends: 161 [2018-06-22 01:05:47,492 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1857, Invalid=5799, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 01:05:47,492 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 01:05:47,500 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 56. [2018-06-22 01:05:47,500 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:05:47,501 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-06-22 01:05:47,501 INFO ]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 32 [2018-06-22 01:05:47,501 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:47,501 INFO ]: Abstraction has 56 states and 65 transitions. [2018-06-22 01:05:47,501 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:05:47,501 INFO ]: Start isEmpty. Operand 56 states and 65 transitions. [2018-06-22 01:05:47,503 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:05:47,503 INFO ]: Found error trace [2018-06-22 01:05:47,503 INFO ]: trace histogram [3, 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] [2018-06-22 01:05:47,503 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:47,503 INFO ]: Analyzing trace with hash -1177707158, now seen corresponding path program 1 times [2018-06-22 01:05:47,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:47,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:47,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:47,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:47,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:47,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:47,916 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:47,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:47,916 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:05:47,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:47,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:47,994 INFO ]: Computing forward predicates... [2018-06-22 01:05:48,734 INFO ]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:05:48,754 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:05:48,754 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 40 [2018-06-22 01:05:48,754 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:05:48,754 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:05:48,755 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:05:48,755 INFO ]: Start difference. First operand 56 states and 65 transitions. Second operand 40 states. [2018-06-22 01:05:51,836 WARN ]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-06-22 01:05:52,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:52,682 INFO ]: Finished difference Result 179 states and 212 transitions. [2018-06-22 01:05:52,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:05:52,682 INFO ]: Start accepts. Automaton has 40 states. Word has length 32 [2018-06-22 01:05:52,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:52,684 INFO ]: With dead ends: 179 [2018-06-22 01:05:52,684 INFO ]: Without dead ends: 176 [2018-06-22 01:05:52,686 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1857, Invalid=5799, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 01:05:52,687 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-22 01:05:52,693 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 76. [2018-06-22 01:05:52,694 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:05:52,695 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-06-22 01:05:52,695 INFO ]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 32 [2018-06-22 01:05:52,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:52,695 INFO ]: Abstraction has 76 states and 91 transitions. [2018-06-22 01:05:52,695 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:05:52,695 INFO ]: Start isEmpty. Operand 76 states and 91 transitions. [2018-06-22 01:05:52,696 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:05:52,696 INFO ]: Found error trace [2018-06-22 01:05:52,696 INFO ]: trace histogram [3, 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] [2018-06-22 01:05:52,696 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:52,696 INFO ]: Analyzing trace with hash 2088031780, now seen corresponding path program 1 times [2018-06-22 01:05:52,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:52,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:52,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:52,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:52,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:52,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:53,200 INFO ]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:53,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:53,200 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:05:53,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:53,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:53,262 INFO ]: Computing forward predicates... [2018-06-22 01:05:54,331 INFO ]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:05:54,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:05:54,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 40 [2018-06-22 01:05:54,352 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:05:54,352 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:05:54,352 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:05:54,352 INFO ]: Start difference. First operand 76 states and 91 transitions. Second operand 40 states. [2018-06-22 01:05:56,430 WARN ]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-06-22 01:05:57,151 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-06-22 01:05:58,168 WARN ]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-22 01:05:59,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:59,196 INFO ]: Finished difference Result 197 states and 234 transitions. [2018-06-22 01:05:59,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:05:59,196 INFO ]: Start accepts. Automaton has 40 states. Word has length 32 [2018-06-22 01:05:59,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:59,197 INFO ]: With dead ends: 197 [2018-06-22 01:05:59,197 INFO ]: Without dead ends: 194 [2018-06-22 01:05:59,199 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2272, Invalid=6848, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 01:05:59,199 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-22 01:05:59,207 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 89. [2018-06-22 01:05:59,207 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 01:05:59,208 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-06-22 01:05:59,208 INFO ]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 32 [2018-06-22 01:05:59,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:59,208 INFO ]: Abstraction has 89 states and 108 transitions. [2018-06-22 01:05:59,208 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:05:59,208 INFO ]: Start isEmpty. Operand 89 states and 108 transitions. [2018-06-22 01:05:59,210 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:05:59,210 INFO ]: Found error trace [2018-06-22 01:05:59,210 INFO ]: trace histogram [3, 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] [2018-06-22 01:05:59,210 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:59,210 INFO ]: Analyzing trace with hash -166626725, now seen corresponding path program 1 times [2018-06-22 01:05:59,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:59,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:59,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:59,211 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:59,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:59,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:59,610 INFO ]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:59,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:59,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:05:59,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:59,664 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:59,669 INFO ]: Computing forward predicates... [2018-06-22 01:06:00,322 INFO ]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:06:00,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:06:00,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 40 [2018-06-22 01:06:00,342 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:06:00,342 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:06:00,343 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:06:00,343 INFO ]: Start difference. First operand 89 states and 108 transitions. Second operand 40 states. [2018-06-22 01:06:03,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:03,740 INFO ]: Finished difference Result 217 states and 260 transitions. [2018-06-22 01:06:03,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:06:03,740 INFO ]: Start accepts. Automaton has 40 states. Word has length 32 [2018-06-22 01:06:03,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:03,742 INFO ]: With dead ends: 217 [2018-06-22 01:06:03,742 INFO ]: Without dead ends: 214 [2018-06-22 01:06:03,744 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2245 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2272, Invalid=6848, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 01:06:03,744 INFO ]: Start minimizeSevpa. Operand 214 states. [2018-06-22 01:06:03,754 INFO ]: Finished minimizeSevpa. Reduced states from 214 to 109. [2018-06-22 01:06:03,754 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 01:06:03,756 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2018-06-22 01:06:03,756 INFO ]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 32 [2018-06-22 01:06:03,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:03,756 INFO ]: Abstraction has 109 states and 134 transitions. [2018-06-22 01:06:03,756 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:06:03,756 INFO ]: Start isEmpty. Operand 109 states and 134 transitions. [2018-06-22 01:06:03,758 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:06:03,758 INFO ]: Found error trace [2018-06-22 01:06:03,758 INFO ]: trace histogram [4, 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] [2018-06-22 01:06:03,758 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:03,758 INFO ]: Analyzing trace with hash 103676980, now seen corresponding path program 2 times [2018-06-22 01:06:03,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:03,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:03,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:03,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:03,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:03,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:04,465 INFO ]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:06:04,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:04,465 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:06:04,465 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:06:04,465 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:06:04,465 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:06:04,465 INFO ]: Start difference. First operand 109 states and 134 transitions. Second operand 8 states. [2018-06-22 01:06:04,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:04,739 INFO ]: Finished difference Result 139 states and 162 transitions. [2018-06-22 01:06:04,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:06:04,740 INFO ]: Start accepts. Automaton has 8 states. Word has length 38 [2018-06-22 01:06:04,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:04,740 INFO ]: With dead ends: 139 [2018-06-22 01:06:04,740 INFO ]: Without dead ends: 137 [2018-06-22 01:06:04,740 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:06:04,741 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 01:06:04,746 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 109. [2018-06-22 01:06:04,746 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 01:06:04,747 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2018-06-22 01:06:04,747 INFO ]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 38 [2018-06-22 01:06:04,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:04,748 INFO ]: Abstraction has 109 states and 129 transitions. [2018-06-22 01:06:04,748 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:06:04,749 INFO ]: Start isEmpty. Operand 109 states and 129 transitions. [2018-06-22 01:06:04,750 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:06:04,750 INFO ]: Found error trace [2018-06-22 01:06:04,750 INFO ]: trace histogram [4, 3, 3, 3, 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:06:04,751 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:04,751 INFO ]: Analyzing trace with hash 2143985771, now seen corresponding path program 1 times [2018-06-22 01:06:04,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:04,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:04,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:04,751 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:06:04,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:04,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:04,910 INFO ]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:06:04,910 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:04,911 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:06:04,911 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:06:04,911 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:06:04,911 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:06:04,911 INFO ]: Start difference. First operand 109 states and 129 transitions. Second operand 8 states. [2018-06-22 01:06:05,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:05,052 INFO ]: Finished difference Result 129 states and 147 transitions. [2018-06-22 01:06:05,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:06:05,052 INFO ]: Start accepts. Automaton has 8 states. Word has length 38 [2018-06-22 01:06:05,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:05,054 INFO ]: With dead ends: 129 [2018-06-22 01:06:05,054 INFO ]: Without dead ends: 127 [2018-06-22 01:06:05,054 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:06:05,054 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 01:06:05,058 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-06-22 01:06:05,058 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 01:06:05,063 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-06-22 01:06:05,063 INFO ]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 38 [2018-06-22 01:06:05,063 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:05,063 INFO ]: Abstraction has 109 states and 124 transitions. [2018-06-22 01:06:05,063 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:06:05,063 INFO ]: Start isEmpty. Operand 109 states and 124 transitions. [2018-06-22 01:06:05,064 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:06:05,064 INFO ]: Found error trace [2018-06-22 01:06:05,064 INFO ]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:05,065 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:05,065 INFO ]: Analyzing trace with hash -1050903280, now seen corresponding path program 2 times [2018-06-22 01:06:05,065 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:05,065 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:05,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:05,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:05,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:05,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:05,697 INFO ]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:05,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:06:05,697 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:06:05,706 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:06:05,771 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:06:05,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:05,776 INFO ]: Computing forward predicates... [2018-06-22 01:06:06,505 INFO ]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:06:06,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:06:06,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24] total 53 [2018-06-22 01:06:06,525 INFO ]: Interpolant automaton has 53 states [2018-06-22 01:06:06,525 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-22 01:06:06,526 INFO ]: CoverageRelationStatistics Valid=132, Invalid=2624, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:06:06,526 INFO ]: Start difference. First operand 109 states and 124 transitions. Second operand 53 states. [2018-06-22 01:06:07,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:07,723 INFO ]: Finished difference Result 117 states and 128 transitions. [2018-06-22 01:06:07,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:06:07,725 INFO ]: Start accepts. Automaton has 53 states. Word has length 39 [2018-06-22 01:06:07,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:07,726 INFO ]: With dead ends: 117 [2018-06-22 01:06:07,726 INFO ]: Without dead ends: 109 [2018-06-22 01:06:07,727 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=699, Invalid=4703, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:06:07,727 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 01:06:07,729 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 68. [2018-06-22 01:06:07,730 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 01:06:07,730 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-06-22 01:06:07,730 INFO ]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 39 [2018-06-22 01:06:07,730 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:07,730 INFO ]: Abstraction has 68 states and 73 transitions. [2018-06-22 01:06:07,730 INFO ]: Interpolant automaton has 53 states. [2018-06-22 01:06:07,730 INFO ]: Start isEmpty. Operand 68 states and 73 transitions. [2018-06-22 01:06:07,731 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:06:07,731 INFO ]: Found error trace [2018-06-22 01:06:07,731 INFO ]: trace histogram [5, 4, 4, 4, 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] [2018-06-22 01:06:07,731 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:07,731 INFO ]: Analyzing trace with hash -371455689, now seen corresponding path program 2 times [2018-06-22 01:06:07,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:07,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:07,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:07,732 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:06:07,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:07,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:08,619 INFO ]: Checked inductivity of 40 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:06:08,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:06:08,619 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:06:08,626 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:06:08,698 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:06:08,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:08,705 INFO ]: Computing forward predicates... [2018-06-22 01:06:09,429 INFO ]: Checked inductivity of 40 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:06:09,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:06:09,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 25] total 41 [2018-06-22 01:06:09,449 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:06:09,449 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:06:09,449 INFO ]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:06:09,449 INFO ]: Start difference. First operand 68 states and 73 transitions. Second operand 41 states. [2018-06-22 01:06:12,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:12,579 INFO ]: Finished difference Result 126 states and 135 transitions. [2018-06-22 01:06:12,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:06:12,579 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-22 01:06:12,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:12,579 INFO ]: With dead ends: 126 [2018-06-22 01:06:12,579 INFO ]: Without dead ends: 67 [2018-06-22 01:06:12,581 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 11 SyntacticMatches, 33 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1893, Invalid=5763, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 01:06:12,581 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:06:12,588 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-22 01:06:12,588 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:06:12,588 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-06-22 01:06:12,588 INFO ]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 45 [2018-06-22 01:06:12,588 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:12,588 INFO ]: Abstraction has 67 states and 71 transitions. [2018-06-22 01:06:12,589 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:06:12,589 INFO ]: Start isEmpty. Operand 67 states and 71 transitions. [2018-06-22 01:06:12,589 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:06:12,589 INFO ]: Found error trace [2018-06-22 01:06:12,589 INFO ]: trace histogram [5, 4, 4, 4, 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] [2018-06-22 01:06:12,589 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:12,589 INFO ]: Analyzing trace with hash 763919334, now seen corresponding path program 1 times [2018-06-22 01:06:12,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:12,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:12,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:12,590 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:06:12,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:12,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:13,223 INFO ]: Checked inductivity of 40 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:06:13,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:06:13,223 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:06:13,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:13,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:13,344 INFO ]: Computing forward predicates... [2018-06-22 01:06:14,282 INFO ]: Checked inductivity of 40 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:06:14,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:06:14,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 25] total 41 [2018-06-22 01:06:14,303 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:06:14,303 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:06:14,303 INFO ]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:06:14,303 INFO ]: Start difference. First operand 67 states and 71 transitions. Second operand 41 states. [2018-06-22 01:06:16,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:16,988 INFO ]: Finished difference Result 62 states and 66 transitions. [2018-06-22 01:06:16,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:06:16,989 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-22 01:06:16,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:16,989 INFO ]: With dead ends: 62 [2018-06-22 01:06:16,989 INFO ]: Without dead ends: 0 [2018-06-22 01:06:16,989 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 11 SyntacticMatches, 33 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1972, Invalid=5684, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 01:06:16,989 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:06:16,989 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:06:16,989 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:06:16,989 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:06:16,989 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-06-22 01:06:16,989 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:16,989 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:06:16,989 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:06:16,989 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:06:16,989 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:06:16,994 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:06:16 BoogieIcfgContainer [2018-06-22 01:06:16,994 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:06:16,998 INFO ]: Toolchain (without parser) took 43248.05 ms. Allocated memory was 310.4 MB in the beginning and 621.3 MB in the end (delta: 310.9 MB). Free memory was 255.9 MB in the beginning and 302.0 MB in the end (delta: -46.1 MB). Peak memory consumption was 264.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:16,999 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 310.4 MB. Free memory is still 276.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:06:16,999 INFO ]: ChcToBoogie took 83.19 ms. Allocated memory is still 310.4 MB. Free memory was 255.9 MB in the beginning and 252.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:16,999 INFO ]: Boogie Preprocessor took 37.51 ms. Allocated memory is still 310.4 MB. Free memory was 252.9 MB in the beginning and 251.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:06:16,999 INFO ]: RCFGBuilder took 480.95 ms. Allocated memory is still 310.4 MB. Free memory was 251.9 MB in the beginning and 229.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:17,000 INFO ]: TraceAbstraction took 42624.34 ms. Allocated memory was 310.4 MB in the beginning and 621.3 MB in the end (delta: 310.9 MB). Free memory was 228.7 MB in the beginning and 302.0 MB in the end (delta: -73.2 MB). Peak memory consumption was 237.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:17,002 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 310.4 MB. Free memory is still 276.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 83.19 ms. Allocated memory is still 310.4 MB. Free memory was 255.9 MB in the beginning and 252.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.51 ms. Allocated memory is still 310.4 MB. Free memory was 252.9 MB in the beginning and 251.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 480.95 ms. Allocated memory is still 310.4 MB. Free memory was 251.9 MB in the beginning and 229.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 42624.34 ms. Allocated memory was 310.4 MB in the beginning and 621.3 MB in the end (delta: 310.9 MB). Free memory was 228.7 MB in the beginning and 302.0 MB in the end (delta: -73.2 MB). Peak memory consumption was 237.7 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, 30 locations, 1 error locations. SAFE Result, 42.5s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 27.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 345 SDtfs, 4095 SDslu, 7556 SDs, 0 SdLazy, 6009 SolverSat, 1151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 974 GetRequests, 108 SyntacticMatches, 115 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11157 ImplicationChecksByTransitivity, 32.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=9, 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, 14 MinimizatonAttempts, 597 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 715 ConstructedInterpolants, 74 QuantifiedInterpolants, 144451 SizeOfPredicates, 420 NumberOfNonLiveVariables, 4273 ConjunctsInSsa, 490 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 162/331 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/38.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-06-17-013.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/38.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-06-17-013.csv Received shutdown request...