java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:07:33,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:07:33,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:07:33,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:07:33,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:07:33,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:07:33,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:07:33,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:07:33,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:07:33,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:07:33,378 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:07:33,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:07:33,379 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:07:33,380 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:07:33,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:07:33,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:07:33,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:07:33,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:07:33,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:07:33,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:07:33,390 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:07:33,391 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:07:33,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:07:33,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:07:33,394 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:07:33,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:07:33,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:07:33,397 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:07:33,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:07:33,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:07:33,399 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:07:33,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:07:33,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:07:33,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:07:33,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:07:33,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:07:33,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:07:33,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:07:33,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:07:33,413 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:07:33,413 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:07:33,414 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:07:33,414 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:07:33,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:07:33,415 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:07:33,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:07:33,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:07:33,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:07:33,416 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:07:33,416 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:07:33,417 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:07:33,417 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:07:33,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:07:33,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:07:33,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:07:33,486 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:07:33,486 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:07:33,488 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.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-15 15:07:33,488 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl' [2018-10-15 15:07:33,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:07:33,590 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:07:33,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:07:33,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:07:33,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:07:33,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... [2018-10-15 15:07:33,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:07:33,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:07:33,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:07:33,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:07:33,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:07:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:07:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:07:35,021 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:07:35,022 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:35 BoogieIcfgContainer [2018-10-15 15:07:35,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:07:35,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:07:35,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:07:35,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:07:35,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:33" (1/2) ... [2018-10-15 15:07:35,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7b15c7 and model type pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:35, skipping insertion in model container [2018-10-15 15:07:35,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:35" (2/2) ... [2018-10-15 15:07:35,032 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-15 15:07:35,042 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:07:35,052 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:07:35,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:07:35,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:07:35,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:07:35,107 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:07:35,108 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:07:35,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:07:35,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:07:35,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:07:35,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:07:35,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:07:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states. [2018-10-15 15:07:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:07:35,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:35,183 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:07:35,185 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:35,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1575162283, now seen corresponding path program 1 times [2018-10-15 15:07:35,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:35,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:35,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:07:35,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:07:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:07:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:07:35,895 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 8 states. [2018-10-15 15:07:36,632 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:07:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:37,014 INFO L93 Difference]: Finished difference Result 357 states and 369 transitions. [2018-10-15 15:07:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:07:37,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2018-10-15 15:07:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:37,038 INFO L225 Difference]: With dead ends: 357 [2018-10-15 15:07:37,039 INFO L226 Difference]: Without dead ends: 357 [2018-10-15 15:07:37,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:07:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-15 15:07:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 263. [2018-10-15 15:07:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 15:07:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 269 transitions. [2018-10-15 15:07:37,104 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 269 transitions. Word has length 229 [2018-10-15 15:07:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:37,107 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 269 transitions. [2018-10-15 15:07:37,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:07:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 269 transitions. [2018-10-15 15:07:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:07:37,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:37,113 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] [2018-10-15 15:07:37,114 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:37,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2105975101, now seen corresponding path program 1 times [2018-10-15 15:07:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:37,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:37,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:37,503 INFO L87 Difference]: Start difference. First operand 263 states and 269 transitions. Second operand 3 states. [2018-10-15 15:07:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:37,559 INFO L93 Difference]: Finished difference Result 346 states and 357 transitions. [2018-10-15 15:07:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:37,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-15 15:07:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:37,565 INFO L225 Difference]: With dead ends: 346 [2018-10-15 15:07:37,565 INFO L226 Difference]: Without dead ends: 346 [2018-10-15 15:07:37,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-15 15:07:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2018-10-15 15:07:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 15:07:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 355 transitions. [2018-10-15 15:07:37,586 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 355 transitions. Word has length 230 [2018-10-15 15:07:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:37,587 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 355 transitions. [2018-10-15 15:07:37,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 355 transitions. [2018-10-15 15:07:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:07:37,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:37,592 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] [2018-10-15 15:07:37,592 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:37,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash 563362869, now seen corresponding path program 1 times [2018-10-15 15:07:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:37,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:37,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:37,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:37,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:37,769 INFO L87 Difference]: Start difference. First operand 344 states and 355 transitions. Second operand 3 states. [2018-10-15 15:07:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:37,818 INFO L93 Difference]: Finished difference Result 439 states and 455 transitions. [2018-10-15 15:07:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:37,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-15 15:07:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:37,823 INFO L225 Difference]: With dead ends: 439 [2018-10-15 15:07:37,823 INFO L226 Difference]: Without dead ends: 439 [2018-10-15 15:07:37,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-15 15:07:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2018-10-15 15:07:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 15:07:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 453 transitions. [2018-10-15 15:07:37,845 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 453 transitions. Word has length 230 [2018-10-15 15:07:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:37,846 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 453 transitions. [2018-10-15 15:07:37,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 453 transitions. [2018-10-15 15:07:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 15:07:37,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:37,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:37,852 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:37,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2061857449, now seen corresponding path program 1 times [2018-10-15 15:07:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:38,095 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:07:38,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:38,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:38,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:38,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:38,100 INFO L87 Difference]: Start difference. First operand 436 states and 453 transitions. Second operand 3 states. [2018-10-15 15:07:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:38,164 INFO L93 Difference]: Finished difference Result 695 states and 726 transitions. [2018-10-15 15:07:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:38,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2018-10-15 15:07:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:38,170 INFO L225 Difference]: With dead ends: 695 [2018-10-15 15:07:38,170 INFO L226 Difference]: Without dead ends: 695 [2018-10-15 15:07:38,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-15 15:07:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 680. [2018-10-15 15:07:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:07:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 712 transitions. [2018-10-15 15:07:38,195 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 712 transitions. Word has length 295 [2018-10-15 15:07:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:38,196 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 712 transitions. [2018-10-15 15:07:38,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 712 transitions. [2018-10-15 15:07:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:07:38,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:38,200 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, 1] [2018-10-15 15:07:38,201 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:38,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1196572678, now seen corresponding path program 1 times [2018-10-15 15:07:38,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-15 15:07:38,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:38,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:38,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:38,360 INFO L87 Difference]: Start difference. First operand 680 states and 712 transitions. Second operand 3 states. [2018-10-15 15:07:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:38,385 INFO L93 Difference]: Finished difference Result 683 states and 711 transitions. [2018-10-15 15:07:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:38,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-15 15:07:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:38,396 INFO L225 Difference]: With dead ends: 683 [2018-10-15 15:07:38,396 INFO L226 Difference]: Without dead ends: 683 [2018-10-15 15:07:38,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-10-15 15:07:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2018-10-15 15:07:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:07:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 709 transitions. [2018-10-15 15:07:38,411 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 709 transitions. Word has length 296 [2018-10-15 15:07:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:38,413 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 709 transitions. [2018-10-15 15:07:38,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 709 transitions. [2018-10-15 15:07:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:07:38,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:38,418 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, 1] [2018-10-15 15:07:38,418 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:38,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1279523796, now seen corresponding path program 2 times [2018-10-15 15:07:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:38,727 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:07:38,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:38,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:38,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:38,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:38,729 INFO L87 Difference]: Start difference. First operand 680 states and 709 transitions. Second operand 3 states. [2018-10-15 15:07:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:38,841 INFO L93 Difference]: Finished difference Result 1174 states and 1226 transitions. [2018-10-15 15:07:38,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:38,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-15 15:07:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:38,849 INFO L225 Difference]: With dead ends: 1174 [2018-10-15 15:07:38,850 INFO L226 Difference]: Without dead ends: 1174 [2018-10-15 15:07:38,850 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:07:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2018-10-15 15:07:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1147. [2018-10-15 15:07:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-10-15 15:07:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1200 transitions. [2018-10-15 15:07:38,876 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1200 transitions. Word has length 296 [2018-10-15 15:07:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:38,877 INFO L481 AbstractCegarLoop]: Abstraction has 1147 states and 1200 transitions. [2018-10-15 15:07:38,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1200 transitions. [2018-10-15 15:07:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 15:07:38,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:38,880 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, 1] [2018-10-15 15:07:38,880 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:38,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 809055170, now seen corresponding path program 1 times [2018-10-15 15:07:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:39,044 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:07:39,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:39,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:39,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:39,046 INFO L87 Difference]: Start difference. First operand 1147 states and 1200 transitions. Second operand 3 states. [2018-10-15 15:07:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:39,078 INFO L93 Difference]: Finished difference Result 662 states and 684 transitions. [2018-10-15 15:07:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:39,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-15 15:07:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:39,082 INFO L225 Difference]: With dead ends: 662 [2018-10-15 15:07:39,082 INFO L226 Difference]: Without dead ends: 662 [2018-10-15 15:07:39,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-15 15:07:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 659. [2018-10-15 15:07:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-15 15:07:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 682 transitions. [2018-10-15 15:07:39,095 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 682 transitions. Word has length 297 [2018-10-15 15:07:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:39,096 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 682 transitions. [2018-10-15 15:07:39,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 682 transitions. [2018-10-15 15:07:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 15:07:39,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:39,098 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, 1] [2018-10-15 15:07:39,098 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:39,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1138400012, now seen corresponding path program 2 times [2018-10-15 15:07:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:39,250 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:07:39,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:39,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:39,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:39,252 INFO L87 Difference]: Start difference. First operand 659 states and 682 transitions. Second operand 3 states. [2018-10-15 15:07:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:39,347 INFO L93 Difference]: Finished difference Result 1132 states and 1172 transitions. [2018-10-15 15:07:39,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:39,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-15 15:07:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:39,354 INFO L225 Difference]: With dead ends: 1132 [2018-10-15 15:07:39,354 INFO L226 Difference]: Without dead ends: 1132 [2018-10-15 15:07:39,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-15 15:07:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1105. [2018-10-15 15:07:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2018-10-15 15:07:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1146 transitions. [2018-10-15 15:07:39,382 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1146 transitions. Word has length 297 [2018-10-15 15:07:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:39,383 INFO L481 AbstractCegarLoop]: Abstraction has 1105 states and 1146 transitions. [2018-10-15 15:07:39,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1146 transitions. [2018-10-15 15:07:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:07:39,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:39,386 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, 1] [2018-10-15 15:07:39,386 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:39,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash 886526275, now seen corresponding path program 1 times [2018-10-15 15:07:39,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-15 15:07:39,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:39,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:39,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:39,642 INFO L87 Difference]: Start difference. First operand 1105 states and 1146 transitions. Second operand 3 states. [2018-10-15 15:07:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:39,725 INFO L93 Difference]: Finished difference Result 641 states and 657 transitions. [2018-10-15 15:07:39,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:39,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-15 15:07:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:39,731 INFO L225 Difference]: With dead ends: 641 [2018-10-15 15:07:39,731 INFO L226 Difference]: Without dead ends: 641 [2018-10-15 15:07:39,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-10-15 15:07:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 638. [2018-10-15 15:07:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-15 15:07:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 655 transitions. [2018-10-15 15:07:39,747 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 655 transitions. Word has length 298 [2018-10-15 15:07:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:39,748 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 655 transitions. [2018-10-15 15:07:39,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 655 transitions. [2018-10-15 15:07:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:07:39,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:39,759 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, 1] [2018-10-15 15:07:39,759 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:39,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1301047927, now seen corresponding path program 2 times [2018-10-15 15:07:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:40,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:40,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:40,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:40,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:40,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:40,006 INFO L87 Difference]: Start difference. First operand 638 states and 655 transitions. Second operand 3 states. [2018-10-15 15:07:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:40,119 INFO L93 Difference]: Finished difference Result 1090 states and 1118 transitions. [2018-10-15 15:07:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:40,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-15 15:07:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:40,125 INFO L225 Difference]: With dead ends: 1090 [2018-10-15 15:07:40,125 INFO L226 Difference]: Without dead ends: 1090 [2018-10-15 15:07:40,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-10-15 15:07:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1063. [2018-10-15 15:07:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-10-15 15:07:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1092 transitions. [2018-10-15 15:07:40,147 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1092 transitions. Word has length 298 [2018-10-15 15:07:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:40,148 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1092 transitions. [2018-10-15 15:07:40,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1092 transitions. [2018-10-15 15:07:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:07:40,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:40,151 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, 1] [2018-10-15 15:07:40,151 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:40,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1004671045, now seen corresponding path program 1 times [2018-10-15 15:07:40,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:40,345 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:07:40,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:40,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:40,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:40,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:40,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:40,347 INFO L87 Difference]: Start difference. First operand 1063 states and 1092 transitions. Second operand 3 states. [2018-10-15 15:07:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:40,431 INFO L93 Difference]: Finished difference Result 620 states and 630 transitions. [2018-10-15 15:07:40,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:40,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-10-15 15:07:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:40,435 INFO L225 Difference]: With dead ends: 620 [2018-10-15 15:07:40,435 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 15:07:40,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 15:07:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2018-10-15 15:07:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-15 15:07:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 628 transitions. [2018-10-15 15:07:40,449 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 628 transitions. Word has length 299 [2018-10-15 15:07:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:40,449 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 628 transitions. [2018-10-15 15:07:40,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 628 transitions. [2018-10-15 15:07:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:07:40,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:40,452 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:07:40,452 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:40,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:40,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1296313361, now seen corresponding path program 2 times [2018-10-15 15:07:40,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:40,886 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:07:41,114 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 15:07:41,633 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-15 15:07:41,866 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-15 15:07:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:42,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:42,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:07:42,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:07:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:07:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:07:42,212 INFO L87 Difference]: Start difference. First operand 617 states and 628 transitions. Second operand 10 states. [2018-10-15 15:07:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:43,872 INFO L93 Difference]: Finished difference Result 259 states and 258 transitions. [2018-10-15 15:07:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:07:43,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2018-10-15 15:07:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:43,874 INFO L225 Difference]: With dead ends: 259 [2018-10-15 15:07:43,874 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:07:43,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:07:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:07:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:07:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:07:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:07:43,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2018-10-15 15:07:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:43,876 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:07:43,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:07:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:07:43,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:07:43,882 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:07:43 BoogieIcfgContainer [2018-10-15 15:07:43,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:07:43,884 INFO L168 Benchmark]: Toolchain (without parser) took 10294.90 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 277.9 MB). Free memory was 1.4 GB in the beginning and 979.6 MB in the end (delta: 435.2 MB). Peak memory consumption was 713.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:43,885 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:07:43,886 INFO L168 Benchmark]: Boogie Preprocessor took 62.07 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:07:43,886 INFO L168 Benchmark]: RCFGBuilder took 1369.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:07:43,887 INFO L168 Benchmark]: TraceAbstraction took 8859.05 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 277.9 MB). Free memory was 1.4 GB in the beginning and 979.6 MB in the end (delta: 382.3 MB). Peak memory consumption was 660.2 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:43,891 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.07 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. * RCFGBuilder took 1369.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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. * TraceAbstraction took 8859.05 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 277.9 MB). Free memory was 1.4 GB in the beginning and 979.6 MB in the end (delta: 382.3 MB). Peak memory consumption was 660.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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, 256 locations, 1 error locations. SAFE Result, 8.7s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3541 SDtfs, 1671 SDslu, 4691 SDs, 0 SdLazy, 341 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1147occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 207 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3364 NumberOfCodeBlocks, 3364 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3352 ConstructedInterpolants, 0 QuantifiedInterpolants, 3102382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 452/462 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.ufo.UNBOUNDED.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-07-43-903.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-07-43-903.csv Received shutdown request...