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.6.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:33:44,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:33:44,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:33:44,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:33:44,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:33:44,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:33:44,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:33:44,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:33:44,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:33:44,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:33:44,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:33:44,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:33:44,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:33:44,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:33:44,775 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:33:44,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:33:44,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:33:44,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:33:44,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:33:44,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:33:44,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:33:44,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:33:44,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:33:44,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:33:44,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:33:44,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:33:44,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:33:44,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:33:44,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:33:44,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:33:44,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:33:44,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:33:44,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:33:44,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:33:44,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:33:44,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:33:44,812 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:44,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:33:44,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:33:44,830 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:33:44,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:33:44,831 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:33:44,832 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:33:44,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:33:44,833 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:33:44,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:33:44,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:33:44,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:33:44,833 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:33:44,834 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:33:44,835 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:33:44,835 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:33:44,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:33:44,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:33:44,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:33:44,922 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:33:44,922 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:33:44,923 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.6.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-15 15:33:44,923 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl' [2018-10-15 15:33:45,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:33:45,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:33:45,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:33:45,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:33:45,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:33:45,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/1) ... [2018-10-15 15:33:45,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:33:45,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:33:45,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:33:45,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:33:45,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (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:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:33:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:33:46,326 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:33:46,327 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:46 BoogieIcfgContainer [2018-10-15 15:33:46,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:33:46,328 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:33:46,328 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:33:46,329 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:33:46,334 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:46" (1/1) ... [2018-10-15 15:33:46,339 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:33:46,369 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:46 BasicIcfg [2018-10-15 15:33:46,369 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:33:46,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:33:46,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:33:46,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:33:46,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:45" (1/3) ... [2018-10-15 15:33:46,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f3ff3c and model type pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:33:46, skipping insertion in model container [2018-10-15 15:33:46,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:46" (2/3) ... [2018-10-15 15:33:46,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f3ff3c and model type pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:46, skipping insertion in model container [2018-10-15 15:33:46,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:46" (3/3) ... [2018-10-15 15:33:46,378 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bplleft_unchanged_by_heapseparator [2018-10-15 15:33:46,388 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:33:46,398 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:33:46,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:33:46,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:33:46,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:33:46,447 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:33:46,448 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:33:46,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:33:46,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:33:46,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:33:46,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:33:46,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:33:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-15 15:33:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:33:46,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:46,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,500 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:46,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:46,507 INFO L82 PathProgramCache]: Analyzing trace with hash 384669560, now seen corresponding path program 1 times [2018-10-15 15:33:46,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:47,198 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:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:47,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:47,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:47,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:47,228 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-15 15:33:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:47,398 INFO L93 Difference]: Finished difference Result 397 states and 410 transitions. [2018-10-15 15:33:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:47,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-10-15 15:33:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:47,429 INFO L225 Difference]: With dead ends: 397 [2018-10-15 15:33:47,429 INFO L226 Difference]: Without dead ends: 397 [2018-10-15 15:33:47,431 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:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-15 15:33:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2018-10-15 15:33:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 15:33:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 408 transitions. [2018-10-15 15:33:47,526 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 408 transitions. Word has length 269 [2018-10-15 15:33:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:47,530 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 408 transitions. [2018-10-15 15:33:47,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 408 transitions. [2018-10-15 15:33:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 15:33:47,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:47,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,543 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:47,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1974056867, now seen corresponding path program 1 times [2018-10-15 15:33:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:48,043 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:48,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:48,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:33:48,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:33:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:33:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:33:48,047 INFO L87 Difference]: Start difference. First operand 394 states and 408 transitions. Second operand 8 states. [2018-10-15 15:33:48,976 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 15:33:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:49,281 INFO L93 Difference]: Finished difference Result 619 states and 646 transitions. [2018-10-15 15:33:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:33:49,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 270 [2018-10-15 15:33:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:49,289 INFO L225 Difference]: With dead ends: 619 [2018-10-15 15:33:49,290 INFO L226 Difference]: Without dead ends: 619 [2018-10-15 15:33:49,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:33:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-10-15 15:33:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 412. [2018-10-15 15:33:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-15 15:33:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 426 transitions. [2018-10-15 15:33:49,314 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 426 transitions. Word has length 270 [2018-10-15 15:33:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:49,315 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 426 transitions. [2018-10-15 15:33:49,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:33:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 426 transitions. [2018-10-15 15:33:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 15:33:49,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:49,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,322 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:49,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1201873233, now seen corresponding path program 1 times [2018-10-15 15:33:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:49,560 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:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:49,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,563 INFO L87 Difference]: Start difference. First operand 412 states and 426 transitions. Second operand 3 states. [2018-10-15 15:33:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:49,612 INFO L93 Difference]: Finished difference Result 516 states and 536 transitions. [2018-10-15 15:33:49,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:49,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-10-15 15:33:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:49,617 INFO L225 Difference]: With dead ends: 516 [2018-10-15 15:33:49,618 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 15:33:49,618 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:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 15:33:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2018-10-15 15:33:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 15:33:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 535 transitions. [2018-10-15 15:33:49,637 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 535 transitions. Word has length 271 [2018-10-15 15:33:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:49,638 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 535 transitions. [2018-10-15 15:33:49,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 535 transitions. [2018-10-15 15:33:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 15:33:49,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:49,645 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, 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] [2018-10-15 15:33:49,645 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:49,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1331045559, now seen corresponding path program 1 times [2018-10-15 15:33:49,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:49,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,890 INFO L87 Difference]: Start difference. First operand 515 states and 535 transitions. Second operand 3 states. [2018-10-15 15:33:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:49,925 INFO L93 Difference]: Finished difference Result 821 states and 858 transitions. [2018-10-15 15:33:49,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:49,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-15 15:33:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:49,931 INFO L225 Difference]: With dead ends: 821 [2018-10-15 15:33:49,932 INFO L226 Difference]: Without dead ends: 821 [2018-10-15 15:33:49,932 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:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-10-15 15:33:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 806. [2018-10-15 15:33:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-15 15:33:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 844 transitions. [2018-10-15 15:33:49,948 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 844 transitions. Word has length 347 [2018-10-15 15:33:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:49,949 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 844 transitions. [2018-10-15 15:33:49,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 844 transitions. [2018-10-15 15:33:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:33:49,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:49,955 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:49,955 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:49,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash -839490863, now seen corresponding path program 1 times [2018-10-15 15:33:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-15 15:33:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:50,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:50,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,147 INFO L87 Difference]: Start difference. First operand 806 states and 844 transitions. Second operand 3 states. [2018-10-15 15:33:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,203 INFO L93 Difference]: Finished difference Result 809 states and 843 transitions. [2018-10-15 15:33:50,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:50,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:33:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,207 INFO L225 Difference]: With dead ends: 809 [2018-10-15 15:33:50,208 INFO L226 Difference]: Without dead ends: 809 [2018-10-15 15:33:50,208 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:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-15 15:33:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2018-10-15 15:33:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-15 15:33:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 841 transitions. [2018-10-15 15:33:50,223 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 841 transitions. Word has length 348 [2018-10-15 15:33:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,224 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 841 transitions. [2018-10-15 15:33:50,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 841 transitions. [2018-10-15 15:33:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:33:50,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:50,230 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:50,231 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:50,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1011448289, now seen corresponding path program 2 times [2018-10-15 15:33:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:50,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:50,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:50,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,490 INFO L87 Difference]: Start difference. First operand 806 states and 841 transitions. Second operand 3 states. [2018-10-15 15:33:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,540 INFO L93 Difference]: Finished difference Result 1394 states and 1458 transitions. [2018-10-15 15:33:50,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:50,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:33:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,550 INFO L225 Difference]: With dead ends: 1394 [2018-10-15 15:33:50,550 INFO L226 Difference]: Without dead ends: 1394 [2018-10-15 15:33:50,550 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:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-10-15 15:33:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1367. [2018-10-15 15:33:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-10-15 15:33:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1432 transitions. [2018-10-15 15:33:50,576 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1432 transitions. Word has length 348 [2018-10-15 15:33:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,576 INFO L481 AbstractCegarLoop]: Abstraction has 1367 states and 1432 transitions. [2018-10-15 15:33:50,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1432 transitions. [2018-10-15 15:33:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:33:50,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:50,580 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:50,580 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:50,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1659956249, now seen corresponding path program 1 times [2018-10-15 15:33:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-15 15:33:50,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:50,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:50,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,842 INFO L87 Difference]: Start difference. First operand 1367 states and 1432 transitions. Second operand 3 states. [2018-10-15 15:33:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,937 INFO L93 Difference]: Finished difference Result 788 states and 816 transitions. [2018-10-15 15:33:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:50,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:33:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,942 INFO L225 Difference]: With dead ends: 788 [2018-10-15 15:33:50,942 INFO L226 Difference]: Without dead ends: 788 [2018-10-15 15:33:50,943 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:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-10-15 15:33:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 785. [2018-10-15 15:33:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-10-15 15:33:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 814 transitions. [2018-10-15 15:33:50,956 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 814 transitions. Word has length 349 [2018-10-15 15:33:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,956 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 814 transitions. [2018-10-15 15:33:50,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 814 transitions. [2018-10-15 15:33:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:33:50,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:50,959 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:50,960 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:50,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash 802516361, now seen corresponding path program 2 times [2018-10-15 15:33:50,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:51,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,238 INFO L87 Difference]: Start difference. First operand 785 states and 814 transitions. Second operand 3 states. [2018-10-15 15:33:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:51,360 INFO L93 Difference]: Finished difference Result 1352 states and 1404 transitions. [2018-10-15 15:33:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:51,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:33:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:51,369 INFO L225 Difference]: With dead ends: 1352 [2018-10-15 15:33:51,369 INFO L226 Difference]: Without dead ends: 1352 [2018-10-15 15:33:51,370 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:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-10-15 15:33:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1325. [2018-10-15 15:33:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-10-15 15:33:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1378 transitions. [2018-10-15 15:33:51,393 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1378 transitions. Word has length 349 [2018-10-15 15:33:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:51,394 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 1378 transitions. [2018-10-15 15:33:51,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1378 transitions. [2018-10-15 15:33:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 15:33:51,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:51,398 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, 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, 1, 1, 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:51,398 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:51,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1633363183, now seen corresponding path program 1 times [2018-10-15 15:33:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-15 15:33:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:51,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,616 INFO L87 Difference]: Start difference. First operand 1325 states and 1378 transitions. Second operand 3 states. [2018-10-15 15:33:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:51,706 INFO L93 Difference]: Finished difference Result 767 states and 789 transitions. [2018-10-15 15:33:51,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:51,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-10-15 15:33:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:51,715 INFO L225 Difference]: With dead ends: 767 [2018-10-15 15:33:51,717 INFO L226 Difference]: Without dead ends: 767 [2018-10-15 15:33:51,717 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:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-10-15 15:33:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2018-10-15 15:33:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-10-15 15:33:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 787 transitions. [2018-10-15 15:33:51,731 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 787 transitions. Word has length 350 [2018-10-15 15:33:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:51,732 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 787 transitions. [2018-10-15 15:33:51,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 787 transitions. [2018-10-15 15:33:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 15:33:51,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:51,736 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, 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, 1, 1, 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:51,736 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:51,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -442706015, now seen corresponding path program 2 times [2018-10-15 15:33:51,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:51,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:51,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:51,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,996 INFO L87 Difference]: Start difference. First operand 764 states and 787 transitions. Second operand 3 states. [2018-10-15 15:33:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:52,108 INFO L93 Difference]: Finished difference Result 1310 states and 1350 transitions. [2018-10-15 15:33:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:52,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-10-15 15:33:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:52,115 INFO L225 Difference]: With dead ends: 1310 [2018-10-15 15:33:52,115 INFO L226 Difference]: Without dead ends: 1310 [2018-10-15 15:33:52,115 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:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2018-10-15 15:33:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1283. [2018-10-15 15:33:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-10-15 15:33:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1324 transitions. [2018-10-15 15:33:52,141 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1324 transitions. Word has length 350 [2018-10-15 15:33:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:52,141 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1324 transitions. [2018-10-15 15:33:52,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1324 transitions. [2018-10-15 15:33:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-15 15:33:52,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:52,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,145 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:52,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash -858344344, now seen corresponding path program 1 times [2018-10-15 15:33:52,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:52,480 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:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:52,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:52,481 INFO L87 Difference]: Start difference. First operand 1283 states and 1324 transitions. Second operand 3 states. [2018-10-15 15:33:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:52,544 INFO L93 Difference]: Finished difference Result 2330 states and 2400 transitions. [2018-10-15 15:33:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:52,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-10-15 15:33:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:52,554 INFO L225 Difference]: With dead ends: 2330 [2018-10-15 15:33:52,554 INFO L226 Difference]: Without dead ends: 2330 [2018-10-15 15:33:52,554 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:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2018-10-15 15:33:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2279. [2018-10-15 15:33:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2018-10-15 15:33:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2350 transitions. [2018-10-15 15:33:52,596 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2350 transitions. Word has length 351 [2018-10-15 15:33:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:52,596 INFO L481 AbstractCegarLoop]: Abstraction has 2279 states and 2350 transitions. [2018-10-15 15:33:52,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2350 transitions. [2018-10-15 15:33:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 15:33:52,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:52,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,601 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:52,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash 411898450, now seen corresponding path program 1 times [2018-10-15 15:33:52,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-15 15:33:52,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:52,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:52,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:52,826 INFO L87 Difference]: Start difference. First operand 2279 states and 2350 transitions. Second operand 3 states. [2018-10-15 15:33:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:52,911 INFO L93 Difference]: Finished difference Result 1244 states and 1272 transitions. [2018-10-15 15:33:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:52,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2018-10-15 15:33:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:52,918 INFO L225 Difference]: With dead ends: 1244 [2018-10-15 15:33:52,918 INFO L226 Difference]: Without dead ends: 1244 [2018-10-15 15:33:52,918 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:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-10-15 15:33:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1241. [2018-10-15 15:33:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-10-15 15:33:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1270 transitions. [2018-10-15 15:33:52,941 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1270 transitions. Word has length 352 [2018-10-15 15:33:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:52,942 INFO L481 AbstractCegarLoop]: Abstraction has 1241 states and 1270 transitions. [2018-10-15 15:33:52,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1270 transitions. [2018-10-15 15:33:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 15:33:52,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:52,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,945 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:52,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash 299479812, now seen corresponding path program 2 times [2018-10-15 15:33:52,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:53,307 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-15 15:33:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:33:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:53,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:33:53,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:33:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:33:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:33:53,454 INFO L87 Difference]: Start difference. First operand 1241 states and 1270 transitions. Second operand 4 states. [2018-10-15 15:33:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:53,617 INFO L93 Difference]: Finished difference Result 1797 states and 1834 transitions. [2018-10-15 15:33:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:33:53,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-10-15 15:33:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:53,625 INFO L225 Difference]: With dead ends: 1797 [2018-10-15 15:33:53,625 INFO L226 Difference]: Without dead ends: 1797 [2018-10-15 15:33:53,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:33:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2018-10-15 15:33:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1793. [2018-10-15 15:33:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-10-15 15:33:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 1830 transitions. [2018-10-15 15:33:53,653 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 1830 transitions. Word has length 352 [2018-10-15 15:33:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:53,654 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 1830 transitions. [2018-10-15 15:33:53,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:33:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 1830 transitions. [2018-10-15 15:33:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-15 15:33:53,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:53,659 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:33:53,659 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:53,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1662222230, now seen corresponding path program 3 times [2018-10-15 15:33:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:54,429 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 15:33:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-15 15:33:56,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:56,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:33:56,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:33:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:33:56,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:33:56,086 INFO L87 Difference]: Start difference. First operand 1793 states and 1830 transitions. Second operand 11 states. [2018-10-15 15:33:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:57,607 INFO L93 Difference]: Finished difference Result 374 states and 373 transitions. [2018-10-15 15:33:57,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:33:57,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 510 [2018-10-15 15:33:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:57,609 INFO L225 Difference]: With dead ends: 374 [2018-10-15 15:33:57,609 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:33:57,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:33:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:33:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:33:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:33:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:33:57,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 510 [2018-10-15 15:33:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:57,611 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:33:57,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:33:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:33:57,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:33:57,616 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:57 BasicIcfg [2018-10-15 15:33:57,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:33:57,618 INFO L168 Benchmark]: Toolchain (without parser) took 12604.10 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -215.2 MB). Peak memory consumption was 225.8 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:57,619 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:57,619 INFO L168 Benchmark]: Boogie Preprocessor took 88.96 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:57,620 INFO L168 Benchmark]: RCFGBuilder took 1223.26 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:57,621 INFO L168 Benchmark]: IcfgTransformer took 41.13 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:57,621 INFO L168 Benchmark]: TraceAbstraction took 11246.49 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -268.1 MB). Peak memory consumption was 172.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:57,625 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.20 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 88.96 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 1223.26 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 41.13 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 11246.49 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -268.1 MB). Peak memory consumption was 172.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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, 303 locations, 1 error locations. SAFE Result, 11.1s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4884 SDtfs, 2366 SDslu, 6325 SDs, 0 SdLazy, 422 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2279occurred in iteration=11, 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, 14 MinimizatonAttempts, 374 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4816 NumberOfCodeBlocks, 4816 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4802 ConstructedInterpolants, 0 QuantifiedInterpolants, 5719395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 769/962 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.6.ufo.BOUNDED-12.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-33-57-637.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-33-57-637.csv Received shutdown request...