java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:07:20,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:07:20,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:07:20,202 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:07:20,203 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:07:20,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:07:20,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:07:20,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:07:20,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:07:20,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:07:20,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:07:20,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:07:20,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:07:20,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:07:20,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:07:20,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:07:20,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:07:20,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:07:20,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:07:20,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:07:20,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:07:20,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:07:20,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:07:20,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:07:20,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:07:20,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:07:20,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:07:20,245 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:07:20,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:07:20,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:07:20,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:07:20,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:07:20,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:07:20,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:07:20,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:07:20,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:07:20,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:07:20,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:07:20,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:07:20,270 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:07:20,270 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:07:20,270 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:07:20,270 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:07:20,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:07:20,271 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:07:20,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:07:20,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:07:20,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:07:20,272 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:07:20,272 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:07:20,273 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:07:20,273 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:07:20,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:07:20,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:07:20,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:07:20,347 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:07:20,347 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:07:20,348 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl [2018-10-15 15:07:20,348 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl' [2018-10-15 15:07:20,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:07:20,425 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:07:20,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:07:20,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:07:20,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:07:20,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... [2018-10-15 15:07:20,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:07:20,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:07:20,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:07:20,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:07:20,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/1) ... No working directory specified, using /storage/repos/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-10-15 15:07:20,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:07:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:07:21,694 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:07:21,695 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:21 BoogieIcfgContainer [2018-10-15 15:07:21,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:07:21,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:07:21,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:07:21,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:07:21,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:20" (1/2) ... [2018-10-15 15:07:21,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7324c500 and model type pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:21, skipping insertion in model container [2018-10-15 15:07:21,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:21" (2/2) ... [2018-10-15 15:07:21,702 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl [2018-10-15 15:07:21,712 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:07:21,723 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:07:21,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:07:21,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:07:21,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:07:21,765 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:07:21,765 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:07:21,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:07:21,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:07:21,766 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:07:21,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:07:21,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:07:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2018-10-15 15:07:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 15:07:21,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:21,816 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:21,818 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:21,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1850276045, now seen corresponding path program 1 times [2018-10-15 15:07:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:22,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:22,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:07:22,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:07:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:07:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:07:22,560 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 8 states. [2018-10-15 15:07:23,172 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:07:23,532 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 15:07:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:23,897 INFO L93 Difference]: Finished difference Result 301 states and 311 transitions. [2018-10-15 15:07:23,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:07:23,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 190 [2018-10-15 15:07:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:23,927 INFO L225 Difference]: With dead ends: 301 [2018-10-15 15:07:23,928 INFO L226 Difference]: Without dead ends: 301 [2018-10-15 15:07:23,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:07:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-15 15:07:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 220. [2018-10-15 15:07:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 15:07:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 225 transitions. [2018-10-15 15:07:23,991 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 225 transitions. Word has length 190 [2018-10-15 15:07:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:23,993 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 225 transitions. [2018-10-15 15:07:23,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:07:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 225 transitions. [2018-10-15 15:07:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 15:07:23,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:23,998 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:23,998 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:23,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 9864849, now seen corresponding path program 1 times [2018-10-15 15:07:24,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:24,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:24,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:24,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:24,287 INFO L87 Difference]: Start difference. First operand 220 states and 225 transitions. Second operand 3 states. [2018-10-15 15:07:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:24,361 INFO L93 Difference]: Finished difference Result 290 states and 299 transitions. [2018-10-15 15:07:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:24,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-10-15 15:07:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:24,365 INFO L225 Difference]: With dead ends: 290 [2018-10-15 15:07:24,365 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 15:07:24,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 15:07:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-15 15:07:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-15 15:07:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 297 transitions. [2018-10-15 15:07:24,386 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 297 transitions. Word has length 191 [2018-10-15 15:07:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:24,387 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 297 transitions. [2018-10-15 15:07:24,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 297 transitions. [2018-10-15 15:07:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 15:07:24,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:24,392 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:24,392 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:24,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:24,392 INFO L82 PathProgramCache]: Analyzing trace with hash -489147239, now seen corresponding path program 1 times [2018-10-15 15:07:24,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:24,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:24,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:24,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:24,528 INFO L87 Difference]: Start difference. First operand 288 states and 297 transitions. Second operand 3 states. [2018-10-15 15:07:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:24,604 INFO L93 Difference]: Finished difference Result 370 states and 383 transitions. [2018-10-15 15:07:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:24,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-10-15 15:07:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:24,608 INFO L225 Difference]: With dead ends: 370 [2018-10-15 15:07:24,608 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 15:07:24,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 15:07:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2018-10-15 15:07:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-15 15:07:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 381 transitions. [2018-10-15 15:07:24,630 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 381 transitions. Word has length 191 [2018-10-15 15:07:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:24,631 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 381 transitions. [2018-10-15 15:07:24,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 381 transitions. [2018-10-15 15:07:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 15:07:24,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:24,641 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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-10-15 15:07:24,641 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:24,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1708318192, now seen corresponding path program 1 times [2018-10-15 15:07:24,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:24,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:24,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:24,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:24,896 INFO L87 Difference]: Start difference. First operand 367 states and 381 transitions. Second operand 3 states. [2018-10-15 15:07:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:24,933 INFO L93 Difference]: Finished difference Result 587 states and 612 transitions. [2018-10-15 15:07:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:24,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-10-15 15:07:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:24,938 INFO L225 Difference]: With dead ends: 587 [2018-10-15 15:07:24,939 INFO L226 Difference]: Without dead ends: 587 [2018-10-15 15:07:24,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-15 15:07:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 572. [2018-10-15 15:07:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-15 15:07:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 598 transitions. [2018-10-15 15:07:24,963 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 598 transitions. Word has length 247 [2018-10-15 15:07:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:24,964 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 598 transitions. [2018-10-15 15:07:24,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 598 transitions. [2018-10-15 15:07:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 15:07:24,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:24,969 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1] [2018-10-15 15:07:24,969 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:24,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 795339711, now seen corresponding path program 1 times [2018-10-15 15:07:24,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-15 15:07:25,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:25,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,109 INFO L87 Difference]: Start difference. First operand 572 states and 598 transitions. Second operand 3 states. [2018-10-15 15:07:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:25,161 INFO L93 Difference]: Finished difference Result 575 states and 597 transitions. [2018-10-15 15:07:25,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:25,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-15 15:07:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:25,165 INFO L225 Difference]: With dead ends: 575 [2018-10-15 15:07:25,165 INFO L226 Difference]: Without dead ends: 575 [2018-10-15 15:07:25,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-10-15 15:07:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 572. [2018-10-15 15:07:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-15 15:07:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 595 transitions. [2018-10-15 15:07:25,182 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 595 transitions. Word has length 248 [2018-10-15 15:07:25,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:25,183 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 595 transitions. [2018-10-15 15:07:25,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 595 transitions. [2018-10-15 15:07:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 15:07:25,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:25,187 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1] [2018-10-15 15:07:25,187 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:25,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:25,188 INFO L82 PathProgramCache]: Analyzing trace with hash -405741087, now seen corresponding path program 2 times [2018-10-15 15:07:25,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:25,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:25,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:25,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,384 INFO L87 Difference]: Start difference. First operand 572 states and 595 transitions. Second operand 3 states. [2018-10-15 15:07:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:25,419 INFO L93 Difference]: Finished difference Result 988 states and 1028 transitions. [2018-10-15 15:07:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:25,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-15 15:07:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:25,426 INFO L225 Difference]: With dead ends: 988 [2018-10-15 15:07:25,426 INFO L226 Difference]: Without dead ends: 988 [2018-10-15 15:07:25,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-15 15:07:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 961. [2018-10-15 15:07:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-10-15 15:07:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1002 transitions. [2018-10-15 15:07:25,447 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1002 transitions. Word has length 248 [2018-10-15 15:07:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:25,448 INFO L481 AbstractCegarLoop]: Abstraction has 961 states and 1002 transitions. [2018-10-15 15:07:25,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1002 transitions. [2018-10-15 15:07:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 15:07:25,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:25,452 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:25,452 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:25,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash -487733265, now seen corresponding path program 1 times [2018-10-15 15:07:25,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-15 15:07:25,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:25,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:25,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,623 INFO L87 Difference]: Start difference. First operand 961 states and 1002 transitions. Second operand 3 states. [2018-10-15 15:07:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:25,692 INFO L93 Difference]: Finished difference Result 554 states and 570 transitions. [2018-10-15 15:07:25,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:25,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-10-15 15:07:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:25,698 INFO L225 Difference]: With dead ends: 554 [2018-10-15 15:07:25,698 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 15:07:25,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 15:07:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2018-10-15 15:07:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-10-15 15:07:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 568 transitions. [2018-10-15 15:07:25,709 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 568 transitions. Word has length 249 [2018-10-15 15:07:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:25,710 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 568 transitions. [2018-10-15 15:07:25,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 568 transitions. [2018-10-15 15:07:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 15:07:25,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:25,712 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:25,712 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:25,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash 87487347, now seen corresponding path program 2 times [2018-10-15 15:07:25,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:25,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:25,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:25,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:25,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,872 INFO L87 Difference]: Start difference. First operand 551 states and 568 transitions. Second operand 3 states. [2018-10-15 15:07:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:25,976 INFO L93 Difference]: Finished difference Result 946 states and 974 transitions. [2018-10-15 15:07:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:25,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-10-15 15:07:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:25,980 INFO L225 Difference]: With dead ends: 946 [2018-10-15 15:07:25,981 INFO L226 Difference]: Without dead ends: 946 [2018-10-15 15:07:25,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-10-15 15:07:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 919. [2018-10-15 15:07:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-10-15 15:07:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 948 transitions. [2018-10-15 15:07:25,998 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 948 transitions. Word has length 249 [2018-10-15 15:07:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:25,998 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 948 transitions. [2018-10-15 15:07:25,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 948 transitions. [2018-10-15 15:07:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 15:07:26,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:26,001 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:26,001 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:26,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1996851938, now seen corresponding path program 1 times [2018-10-15 15:07:26,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-15 15:07:26,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:26,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:26,147 INFO L87 Difference]: Start difference. First operand 919 states and 948 transitions. Second operand 3 states. [2018-10-15 15:07:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:26,228 INFO L93 Difference]: Finished difference Result 533 states and 543 transitions. [2018-10-15 15:07:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:26,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-10-15 15:07:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:26,231 INFO L225 Difference]: With dead ends: 533 [2018-10-15 15:07:26,231 INFO L226 Difference]: Without dead ends: 533 [2018-10-15 15:07:26,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-15 15:07:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2018-10-15 15:07:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-15 15:07:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 541 transitions. [2018-10-15 15:07:26,252 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 541 transitions. Word has length 250 [2018-10-15 15:07:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:26,252 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 541 transitions. [2018-10-15 15:07:26,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 541 transitions. [2018-10-15 15:07:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 15:07:26,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:26,254 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:26,254 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:26,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash -705579490, now seen corresponding path program 2 times [2018-10-15 15:07:26,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:26,647 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:07:26,885 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 15:07:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:27,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:27,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:07:27,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:07:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:07:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:07:27,353 INFO L87 Difference]: Start difference. First operand 530 states and 541 transitions. Second operand 10 states. [2018-10-15 15:07:28,465 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-15 15:07:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:28,735 INFO L93 Difference]: Finished difference Result 220 states and 219 transitions. [2018-10-15 15:07:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:07:28,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2018-10-15 15:07:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:28,736 INFO L225 Difference]: With dead ends: 220 [2018-10-15 15:07:28,736 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:07:28,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:07:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:07:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:07:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:07:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:07:28,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 250 [2018-10-15 15:07:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:28,739 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:07:28,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:07:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:07:28,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:07:28,745 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:07:28 BoogieIcfgContainer [2018-10-15 15:07:28,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:07:28,746 INFO L168 Benchmark]: Toolchain (without parser) took 8321.73 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 149.9 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -103.3 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:28,747 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:07:28,748 INFO L168 Benchmark]: Boogie Preprocessor took 80.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:07:28,748 INFO L168 Benchmark]: RCFGBuilder took 1188.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:28,749 INFO L168 Benchmark]: TraceAbstraction took 7049.20 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 149.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -145.6 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:28,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1188.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7049.20 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 149.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -145.6 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 386]: 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 1 procedures, 213 locations, 1 error locations. SAFE Result, 6.9s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2449 SDtfs, 1215 SDslu, 3587 SDs, 0 SdLazy, 306 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=961occurred in iteration=6, 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, 10 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2313 NumberOfCodeBlocks, 2313 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2303 ConstructedInterpolants, 0 QuantifiedInterpolants, 1869066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 297/307 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/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-07-28-764.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c_10.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-07-28-764.csv Received shutdown request...