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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:33:32,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:33:32,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:33:32,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:33:32,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:33:32,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:33:32,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:33:32,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:33:32,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:33:32,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:33:32,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:33:32,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:33:32,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:33:32,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:33:32,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:33:32,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:33:32,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:33:32,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:33:32,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:33:32,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:33:32,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:33:32,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:33:32,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:33:32,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:33:32,339 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:33:32,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:33:32,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:33:32,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:33:32,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:33:32,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:33:32,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:33:32,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:33:32,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:33:32,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:33:32,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:33:32,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:33:32,346 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:33:32,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:33:32,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:33:32,356 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:33:32,356 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:33:32,357 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:33:32,357 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:33:32,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:33:32,358 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:33:32,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:33:32,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:33:32,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:33:32,358 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:33:32,359 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:33:32,359 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:33:32,360 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:33:32,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:33:32,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:33:32,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:33:32,442 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:33:32,443 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:33:32,444 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-15 15:33:32,444 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-15 15:33:32,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:33:32,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:33:32,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:33:32,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:33:32,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:33:32,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:33:32,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:33:32,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:33:32,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:33:32,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (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:33:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:33:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:33:33,794 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:33:33,795 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:33 BoogieIcfgContainer [2018-10-15 15:33:33,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:33:33,796 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:33:33,796 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:33:33,798 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:33:33,802 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:33" (1/1) ... [2018-10-15 15:33:33,807 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:33:33,835 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:33 BasicIcfg [2018-10-15 15:33:33,836 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:33:33,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:33:33,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:33:33,841 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:33:33,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/3) ... [2018-10-15 15:33:33,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b856a9 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:33:33, skipping insertion in model container [2018-10-15 15:33:33,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:33" (2/3) ... [2018-10-15 15:33:33,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b856a9 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:33, skipping insertion in model container [2018-10-15 15:33:33,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:33" (3/3) ... [2018-10-15 15:33:33,845 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bplleft_unchanged_by_heapseparator [2018-10-15 15:33:33,855 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:33:33,864 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:33:33,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:33:33,913 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:33:33,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:33:33,914 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:33:33,914 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:33:33,914 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:33:33,914 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:33:33,915 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:33:33,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:33:33,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:33:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-10-15 15:33:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 15:33:33,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:33,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,968 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:33,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1073337821, now seen corresponding path program 1 times [2018-10-15 15:33:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:34,566 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:33:34,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:34,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:34,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:34,594 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-10-15 15:33:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:34,751 INFO L93 Difference]: Finished difference Result 334 states and 345 transitions. [2018-10-15 15:33:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:34,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-10-15 15:33:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:34,773 INFO L225 Difference]: With dead ends: 334 [2018-10-15 15:33:34,773 INFO L226 Difference]: Without dead ends: 334 [2018-10-15 15:33:34,775 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:33:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-15 15:33:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-10-15 15:33:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 15:33:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 343 transitions. [2018-10-15 15:33:34,843 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 343 transitions. Word has length 226 [2018-10-15 15:33:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:34,845 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 343 transitions. [2018-10-15 15:33:34,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 343 transitions. [2018-10-15 15:33:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 15:33:34,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:34,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,851 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:34,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash -83736410, now seen corresponding path program 1 times [2018-10-15 15:33:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:35,147 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:33:35,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:35,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:33:35,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:33:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:33:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:33:35,152 INFO L87 Difference]: Start difference. First operand 331 states and 343 transitions. Second operand 8 states. [2018-10-15 15:33:35,825 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:33:36,178 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:33:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:36,684 INFO L93 Difference]: Finished difference Result 525 states and 548 transitions. [2018-10-15 15:33:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:33:36,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 228 [2018-10-15 15:33:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:36,690 INFO L225 Difference]: With dead ends: 525 [2018-10-15 15:33:36,691 INFO L226 Difference]: Without dead ends: 525 [2018-10-15 15:33:36,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:33:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-15 15:33:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 349. [2018-10-15 15:33:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 15:33:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 361 transitions. [2018-10-15 15:33:36,718 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 361 transitions. Word has length 228 [2018-10-15 15:33:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:36,719 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 361 transitions. [2018-10-15 15:33:36,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:33:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 361 transitions. [2018-10-15 15:33:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:33:36,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:36,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,725 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:36,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash -327734814, now seen corresponding path program 1 times [2018-10-15 15:33:36,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:37,022 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:33:37,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:37,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:37,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:37,024 INFO L87 Difference]: Start difference. First operand 349 states and 361 transitions. Second operand 3 states. [2018-10-15 15:33:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:37,104 INFO L93 Difference]: Finished difference Result 503 states and 524 transitions. [2018-10-15 15:33:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:37,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-10-15 15:33:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:37,109 INFO L225 Difference]: With dead ends: 503 [2018-10-15 15:33:37,109 INFO L226 Difference]: Without dead ends: 503 [2018-10-15 15:33:37,110 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:33:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-15 15:33:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2018-10-15 15:33:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-15 15:33:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 520 transitions. [2018-10-15 15:33:37,147 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 520 transitions. Word has length 229 [2018-10-15 15:33:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:37,150 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 520 transitions. [2018-10-15 15:33:37,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 520 transitions. [2018-10-15 15:33:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 15:33:37,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:37,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:37,164 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:37,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash -144526881, now seen corresponding path program 1 times [2018-10-15 15:33:37,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:37,351 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:33:37,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:37,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:37,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:37,353 INFO L87 Difference]: Start difference. First operand 499 states and 520 transitions. Second operand 3 states. [2018-10-15 15:33:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:37,382 INFO L93 Difference]: Finished difference Result 676 states and 707 transitions. [2018-10-15 15:33:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:37,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-15 15:33:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:37,391 INFO L225 Difference]: With dead ends: 676 [2018-10-15 15:33:37,391 INFO L226 Difference]: Without dead ends: 676 [2018-10-15 15:33:37,392 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:33:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-15 15:33:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 673. [2018-10-15 15:33:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-10-15 15:33:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 705 transitions. [2018-10-15 15:33:37,408 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 705 transitions. Word has length 233 [2018-10-15 15:33:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:37,409 INFO L481 AbstractCegarLoop]: Abstraction has 673 states and 705 transitions. [2018-10-15 15:33:37,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 705 transitions. [2018-10-15 15:33:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 15:33:37,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:37,415 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:37,415 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:37,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash -557221298, now seen corresponding path program 1 times [2018-10-15 15:33:37,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:37,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:37,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:37,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:37,770 INFO L87 Difference]: Start difference. First operand 673 states and 705 transitions. Second operand 3 states. [2018-10-15 15:33:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:37,798 INFO L93 Difference]: Finished difference Result 1160 states and 1218 transitions. [2018-10-15 15:33:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:37,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2018-10-15 15:33:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:37,807 INFO L225 Difference]: With dead ends: 1160 [2018-10-15 15:33:37,807 INFO L226 Difference]: Without dead ends: 1160 [2018-10-15 15:33:37,808 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:33:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-10-15 15:33:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1133. [2018-10-15 15:33:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-15 15:33:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1192 transitions. [2018-10-15 15:33:37,835 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1192 transitions. Word has length 295 [2018-10-15 15:33:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:37,836 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1192 transitions. [2018-10-15 15:33:37,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1192 transitions. [2018-10-15 15:33:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:33:37,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:37,843 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:37,844 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:37,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -952573458, now seen corresponding path program 1 times [2018-10-15 15:33:37,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-15 15:33:38,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:38,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,039 INFO L87 Difference]: Start difference. First operand 1133 states and 1192 transitions. Second operand 3 states. [2018-10-15 15:33:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:38,130 INFO L93 Difference]: Finished difference Result 1136 states and 1188 transitions. [2018-10-15 15:33:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:38,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-15 15:33:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:38,136 INFO L225 Difference]: With dead ends: 1136 [2018-10-15 15:33:38,136 INFO L226 Difference]: Without dead ends: 1136 [2018-10-15 15:33:38,137 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:33:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2018-10-15 15:33:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1133. [2018-10-15 15:33:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-15 15:33:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1186 transitions. [2018-10-15 15:33:38,159 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1186 transitions. Word has length 296 [2018-10-15 15:33:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:38,160 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1186 transitions. [2018-10-15 15:33:38,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1186 transitions. [2018-10-15 15:33:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:33:38,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:38,166 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:38,166 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:38,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash -786385258, now seen corresponding path program 2 times [2018-10-15 15:33:38,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:38,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:38,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:38,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,410 INFO L87 Difference]: Start difference. First operand 1133 states and 1186 transitions. Second operand 3 states. [2018-10-15 15:33:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:38,529 INFO L93 Difference]: Finished difference Result 2062 states and 2156 transitions. [2018-10-15 15:33:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:38,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-15 15:33:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:38,540 INFO L225 Difference]: With dead ends: 2062 [2018-10-15 15:33:38,540 INFO L226 Difference]: Without dead ends: 2062 [2018-10-15 15:33:38,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2018-10-15 15:33:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2011. [2018-10-15 15:33:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-10-15 15:33:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2106 transitions. [2018-10-15 15:33:38,581 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2106 transitions. Word has length 296 [2018-10-15 15:33:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:38,581 INFO L481 AbstractCegarLoop]: Abstraction has 2011 states and 2106 transitions. [2018-10-15 15:33:38,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2106 transitions. [2018-10-15 15:33:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 15:33:38,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:38,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,587 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:38,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash -194874643, now seen corresponding path program 1 times [2018-10-15 15:33:38,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:38,764 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:33:38,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:38,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,766 INFO L87 Difference]: Start difference. First operand 2011 states and 2106 transitions. Second operand 3 states. [2018-10-15 15:33:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:38,886 INFO L93 Difference]: Finished difference Result 3782 states and 3948 transitions. [2018-10-15 15:33:38,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:38,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-15 15:33:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:38,904 INFO L225 Difference]: With dead ends: 3782 [2018-10-15 15:33:38,905 INFO L226 Difference]: Without dead ends: 3782 [2018-10-15 15:33:38,905 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:33:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2018-10-15 15:33:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3683. [2018-10-15 15:33:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2018-10-15 15:33:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 3850 transitions. [2018-10-15 15:33:38,992 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 3850 transitions. Word has length 297 [2018-10-15 15:33:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:38,993 INFO L481 AbstractCegarLoop]: Abstraction has 3683 states and 3850 transitions. [2018-10-15 15:33:38,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 3850 transitions. [2018-10-15 15:33:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:33:39,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,002 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1772906385, now seen corresponding path program 1 times [2018-10-15 15:33:39,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-15 15:33:39,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:39,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:39,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:39,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:39,264 INFO L87 Difference]: Start difference. First operand 3683 states and 3850 transitions. Second operand 3 states. [2018-10-15 15:33:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,352 INFO L93 Difference]: Finished difference Result 1930 states and 2000 transitions. [2018-10-15 15:33:39,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:39,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-15 15:33:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,360 INFO L225 Difference]: With dead ends: 1930 [2018-10-15 15:33:39,361 INFO L226 Difference]: Without dead ends: 1930 [2018-10-15 15:33:39,361 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:33:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-10-15 15:33:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1927. [2018-10-15 15:33:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-15 15:33:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 1998 transitions. [2018-10-15 15:33:39,398 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 1998 transitions. Word has length 298 [2018-10-15 15:33:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,398 INFO L481 AbstractCegarLoop]: Abstraction has 1927 states and 1998 transitions. [2018-10-15 15:33:39,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 1998 transitions. [2018-10-15 15:33:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:33:39,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,404 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2143176889, now seen corresponding path program 2 times [2018-10-15 15:33:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:40,269 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-15 15:33:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:40,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:40,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:33:40,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:33:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:33:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:33:40,606 INFO L87 Difference]: Start difference. First operand 1927 states and 1998 transitions. Second operand 10 states. [2018-10-15 15:33:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:42,084 INFO L93 Difference]: Finished difference Result 402 states and 401 transitions. [2018-10-15 15:33:42,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:33:42,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 298 [2018-10-15 15:33:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:42,085 INFO L225 Difference]: With dead ends: 402 [2018-10-15 15:33:42,085 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:33:42,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:33:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:33:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:33:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:33:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:33:42,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2018-10-15 15:33:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:42,087 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:33:42,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:33:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:33:42,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:33:42,092 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:42 BasicIcfg [2018-10-15 15:33:42,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:33:42,093 INFO L168 Benchmark]: Toolchain (without parser) took 9558.84 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 273.7 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 132.0 MB). Peak memory consumption was 405.7 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:42,095 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:33:42,095 INFO L168 Benchmark]: Boogie Preprocessor took 95.51 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:33:42,096 INFO L168 Benchmark]: RCFGBuilder took 1163.21 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:42,097 INFO L168 Benchmark]: IcfgTransformer took 39.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:33:42,097 INFO L168 Benchmark]: TraceAbstraction took 8255.57 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 273.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 79.1 MB). Peak memory consumption was 352.8 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:42,101 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 95.51 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 1163.21 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * IcfgTransformer took 39.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 8255.57 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 273.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 79.1 MB). Peak memory consumption was 352.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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, 255 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2977 SDtfs, 1560 SDslu, 4364 SDs, 0 SdLazy, 369 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3683occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 369 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2696 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2686 ConstructedInterpolants, 0 QuantifiedInterpolants, 2249507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 286/300 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-33-42-113.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-33-42-113.csv Received shutdown request...