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.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:34:11,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:34:11,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:34:11,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:34:11,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:34:11,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:34:11,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:34:11,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:34:11,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:34:11,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:34:11,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:34:11,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:34:11,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:34:11,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:34:11,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:34:11,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:34:11,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:34:11,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:34:11,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:34:11,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:34:11,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:34:11,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:34:11,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:34:11,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:34:11,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:34:11,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:34:11,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:34:11,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:34:11,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:34:11,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:34:11,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:34:11,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:34:11,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:34:11,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:34:11,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:34:11,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:34:11,698 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:34:11,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:34:11,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:34:11,719 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:34:11,719 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:34:11,719 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:34:11,719 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:34:11,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:34:11,720 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:34:11,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:34:11,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:34:11,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:34:11,721 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:34:11,722 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:34:11,722 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:34:11,724 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:34:11,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:34:11,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:34:11,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:34:11,814 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:34:11,814 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:34:11,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-15 15:34:11,816 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-10-15 15:34:11,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:34:11,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:34:11,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:34:11,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:34:11,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:34:11,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/1) ... [2018-10-15 15:34:11,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:34:11,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:34:11,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:34:11,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:34:11,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (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:34:12,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:34:12,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:34:13,283 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:34:13,284 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:13 BoogieIcfgContainer [2018-10-15 15:34:13,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:34:13,285 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:34:13,285 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:34:13,286 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:34:13,290 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:13" (1/1) ... [2018-10-15 15:34:13,295 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:34:13,319 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:13 BasicIcfg [2018-10-15 15:34:13,320 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:34:13,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:34:13,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:34:13,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:34:13,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:11" (1/3) ... [2018-10-15 15:34:13,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6539cdfe and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:34:13, skipping insertion in model container [2018-10-15 15:34:13,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:13" (2/3) ... [2018-10-15 15:34:13,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6539cdfe and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:34:13, skipping insertion in model container [2018-10-15 15:34:13,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:13" (3/3) ... [2018-10-15 15:34:13,328 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bplleft_unchanged_by_heapseparator [2018-10-15 15:34:13,338 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:34:13,348 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:34:13,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:34:13,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:34:13,392 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:34:13,393 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:34:13,393 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:34:13,393 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:34:13,393 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:34:13,393 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:34:13,393 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:34:13,393 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:34:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states. [2018-10-15 15:34:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 15:34:13,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:13,439 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] [2018-10-15 15:34:13,441 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:13,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1687654112, now seen corresponding path program 1 times [2018-10-15 15:34:13,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:13,961 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:34:13,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:13,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:13,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:13,996 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 3 states. [2018-10-15 15:34:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:14,102 INFO L93 Difference]: Finished difference Result 343 states and 356 transitions. [2018-10-15 15:34:14,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:14,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-15 15:34:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:14,124 INFO L225 Difference]: With dead ends: 343 [2018-10-15 15:34:14,124 INFO L226 Difference]: Without dead ends: 343 [2018-10-15 15:34:14,126 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:34:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-15 15:34:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2018-10-15 15:34:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 15:34:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 354 transitions. [2018-10-15 15:34:14,200 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 354 transitions. Word has length 218 [2018-10-15 15:34:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:14,202 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 354 transitions. [2018-10-15 15:34:14,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 354 transitions. [2018-10-15 15:34:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 15:34:14,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:14,213 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] [2018-10-15 15:34:14,215 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:14,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:14,217 INFO L82 PathProgramCache]: Analyzing trace with hash 335284608, now seen corresponding path program 1 times [2018-10-15 15:34:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:14,557 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:34:14,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:14,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:14,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:14,561 INFO L87 Difference]: Start difference. First operand 340 states and 354 transitions. Second operand 3 states. [2018-10-15 15:34:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:14,637 INFO L93 Difference]: Finished difference Result 515 states and 541 transitions. [2018-10-15 15:34:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:14,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-15 15:34:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:14,643 INFO L225 Difference]: With dead ends: 515 [2018-10-15 15:34:14,643 INFO L226 Difference]: Without dead ends: 515 [2018-10-15 15:34:14,647 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:34:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-15 15:34:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2018-10-15 15:34:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-10-15 15:34:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 539 transitions. [2018-10-15 15:34:14,700 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 539 transitions. Word has length 218 [2018-10-15 15:34:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:14,701 INFO L481 AbstractCegarLoop]: Abstraction has 512 states and 539 transitions. [2018-10-15 15:34:14,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 539 transitions. [2018-10-15 15:34:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:34:14,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:14,708 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] [2018-10-15 15:34:14,708 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:14,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1110863753, now seen corresponding path program 1 times [2018-10-15 15:34:14,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:14,935 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:34:14,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:14,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:14,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:14,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:14,938 INFO L87 Difference]: Start difference. First operand 512 states and 539 transitions. Second operand 3 states. [2018-10-15 15:34:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:14,978 INFO L93 Difference]: Finished difference Result 841 states and 891 transitions. [2018-10-15 15:34:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:14,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-15 15:34:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:14,988 INFO L225 Difference]: With dead ends: 841 [2018-10-15 15:34:14,989 INFO L226 Difference]: Without dead ends: 841 [2018-10-15 15:34:14,989 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:34:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-15 15:34:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 838. [2018-10-15 15:34:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-15 15:34:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 889 transitions. [2018-10-15 15:34:15,019 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 889 transitions. Word has length 219 [2018-10-15 15:34:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:15,021 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 889 transitions. [2018-10-15 15:34:15,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 889 transitions. [2018-10-15 15:34:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-15 15:34:15,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:15,028 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] [2018-10-15 15:34:15,029 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:15,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1122640351, now seen corresponding path program 1 times [2018-10-15 15:34:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:15,273 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:34:15,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:15,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:15,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:15,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:15,275 INFO L87 Difference]: Start difference. First operand 838 states and 889 transitions. Second operand 3 states. [2018-10-15 15:34:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:15,381 INFO L93 Difference]: Finished difference Result 1457 states and 1551 transitions. [2018-10-15 15:34:15,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:15,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-15 15:34:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:15,389 INFO L225 Difference]: With dead ends: 1457 [2018-10-15 15:34:15,389 INFO L226 Difference]: Without dead ends: 1457 [2018-10-15 15:34:15,390 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:34:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-10-15 15:34:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1454. [2018-10-15 15:34:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-10-15 15:34:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1549 transitions. [2018-10-15 15:34:15,425 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1549 transitions. Word has length 220 [2018-10-15 15:34:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:15,425 INFO L481 AbstractCegarLoop]: Abstraction has 1454 states and 1549 transitions. [2018-10-15 15:34:15,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1549 transitions. [2018-10-15 15:34:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-15 15:34:15,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:15,430 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] [2018-10-15 15:34:15,430 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:15,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2002444375, now seen corresponding path program 1 times [2018-10-15 15:34:15,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:15,667 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:34:15,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:15,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:15,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:15,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:15,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:15,669 INFO L87 Difference]: Start difference. First operand 1454 states and 1549 transitions. Second operand 3 states. [2018-10-15 15:34:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:15,786 INFO L93 Difference]: Finished difference Result 2617 states and 2791 transitions. [2018-10-15 15:34:15,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:15,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-10-15 15:34:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:15,801 INFO L225 Difference]: With dead ends: 2617 [2018-10-15 15:34:15,801 INFO L226 Difference]: Without dead ends: 2617 [2018-10-15 15:34:15,802 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:34:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2018-10-15 15:34:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2614. [2018-10-15 15:34:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2018-10-15 15:34:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 2789 transitions. [2018-10-15 15:34:15,857 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 2789 transitions. Word has length 221 [2018-10-15 15:34:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:15,858 INFO L481 AbstractCegarLoop]: Abstraction has 2614 states and 2789 transitions. [2018-10-15 15:34:15,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 2789 transitions. [2018-10-15 15:34:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 15:34:15,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:15,863 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] [2018-10-15 15:34:15,863 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:15,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:15,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1640100799, now seen corresponding path program 1 times [2018-10-15 15:34:15,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:16,095 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:34:16,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:16,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:16,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:16,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:16,098 INFO L87 Difference]: Start difference. First operand 2614 states and 2789 transitions. Second operand 3 states. [2018-10-15 15:34:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:16,267 INFO L93 Difference]: Finished difference Result 3839 states and 4077 transitions. [2018-10-15 15:34:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:16,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-15 15:34:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:16,288 INFO L225 Difference]: With dead ends: 3839 [2018-10-15 15:34:16,288 INFO L226 Difference]: Without dead ends: 3839 [2018-10-15 15:34:16,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:34:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2018-10-15 15:34:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3820. [2018-10-15 15:34:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2018-10-15 15:34:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 4059 transitions. [2018-10-15 15:34:16,365 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 4059 transitions. Word has length 222 [2018-10-15 15:34:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:16,366 INFO L481 AbstractCegarLoop]: Abstraction has 3820 states and 4059 transitions. [2018-10-15 15:34:16,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 4059 transitions. [2018-10-15 15:34:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-15 15:34:16,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:16,371 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] [2018-10-15 15:34:16,371 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:16,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 457966405, now seen corresponding path program 1 times [2018-10-15 15:34:16,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:17,152 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:34:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:34:17,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:34:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:34:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:34:17,154 INFO L87 Difference]: Start difference. First operand 3820 states and 4059 transitions. Second operand 8 states. [2018-10-15 15:34:17,727 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:34:18,156 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:34:18,416 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 15:34:18,657 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:34:18,858 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:34:19,198 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 15:34:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:19,687 INFO L93 Difference]: Finished difference Result 6798 states and 7165 transitions. [2018-10-15 15:34:19,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:34:19,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 223 [2018-10-15 15:34:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:19,722 INFO L225 Difference]: With dead ends: 6798 [2018-10-15 15:34:19,722 INFO L226 Difference]: Without dead ends: 6798 [2018-10-15 15:34:19,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:34:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2018-10-15 15:34:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 4108. [2018-10-15 15:34:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2018-10-15 15:34:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 4331 transitions. [2018-10-15 15:34:19,821 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 4331 transitions. Word has length 223 [2018-10-15 15:34:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:19,822 INFO L481 AbstractCegarLoop]: Abstraction has 4108 states and 4331 transitions. [2018-10-15 15:34:19,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:34:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 4331 transitions. [2018-10-15 15:34:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:34:19,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:19,829 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] [2018-10-15 15:34:19,830 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:19,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash 796799194, now seen corresponding path program 1 times [2018-10-15 15:34:19,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:20,230 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2018-10-15 15:34:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:34:20,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:20,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:34:20,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:34:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:34:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:34:20,342 INFO L87 Difference]: Start difference. First operand 4108 states and 4331 transitions. Second operand 4 states. [2018-10-15 15:34:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:20,575 INFO L93 Difference]: Finished difference Result 6524 states and 6827 transitions. [2018-10-15 15:34:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:34:20,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-10-15 15:34:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:20,603 INFO L225 Difference]: With dead ends: 6524 [2018-10-15 15:34:20,603 INFO L226 Difference]: Without dead ends: 6524 [2018-10-15 15:34:20,604 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:34:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2018-10-15 15:34:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 6508. [2018-10-15 15:34:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6508 states. [2018-10-15 15:34:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 6811 transitions. [2018-10-15 15:34:20,730 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 6811 transitions. Word has length 296 [2018-10-15 15:34:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:20,731 INFO L481 AbstractCegarLoop]: Abstraction has 6508 states and 6811 transitions. [2018-10-15 15:34:20,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:34:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 6811 transitions. [2018-10-15 15:34:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-15 15:34:20,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:20,755 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:20,755 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:20,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash 314812347, now seen corresponding path program 2 times [2018-10-15 15:34:20,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:21,348 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:34:21,589 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 15:34:22,163 WARN L179 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-15 15:34:22,710 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-10-15 15:34:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 6 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-15 15:34:23,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:23,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:34:23,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:34:23,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:34:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:34:23,280 INFO L87 Difference]: Start difference. First operand 6508 states and 6811 transitions. Second operand 10 states. [2018-10-15 15:34:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:25,084 INFO L93 Difference]: Finished difference Result 5668 states and 5890 transitions. [2018-10-15 15:34:25,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:34:25,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 446 [2018-10-15 15:34:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:25,104 INFO L225 Difference]: With dead ends: 5668 [2018-10-15 15:34:25,104 INFO L226 Difference]: Without dead ends: 5604 [2018-10-15 15:34:25,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:34:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2018-10-15 15:34:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 4012. [2018-10-15 15:34:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2018-10-15 15:34:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 4179 transitions. [2018-10-15 15:34:25,170 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 4179 transitions. Word has length 446 [2018-10-15 15:34:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:25,171 INFO L481 AbstractCegarLoop]: Abstraction has 4012 states and 4179 transitions. [2018-10-15 15:34:25,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:34:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 4179 transitions. [2018-10-15 15:34:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-10-15 15:34:25,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:25,186 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:25,186 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:25,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1700358376, now seen corresponding path program 3 times [2018-10-15 15:34:25,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-15 15:34:25,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:25,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:25,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:25,719 INFO L87 Difference]: Start difference. First operand 4012 states and 4179 transitions. Second operand 3 states. [2018-10-15 15:34:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:25,774 INFO L93 Difference]: Finished difference Result 230 states and 229 transitions. [2018-10-15 15:34:25,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:25,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 523 [2018-10-15 15:34:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:25,776 INFO L225 Difference]: With dead ends: 230 [2018-10-15 15:34:25,776 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:34:25,776 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:34:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:34:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:34:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:34:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:34:25,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 523 [2018-10-15 15:34:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:25,777 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:34:25,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:34:25,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:34:25,783 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:34:25 BasicIcfg [2018-10-15 15:34:25,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:34:25,784 INFO L168 Benchmark]: Toolchain (without parser) took 13876.03 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.8 GB in the end (delta: -341.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:34:25,785 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:34:25,786 INFO L168 Benchmark]: Boogie Preprocessor took 67.99 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:34:25,786 INFO L168 Benchmark]: RCFGBuilder took 1305.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:34:25,787 INFO L168 Benchmark]: IcfgTransformer took 34.97 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:34:25,788 INFO L168 Benchmark]: TraceAbstraction took 12462.60 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.8 GB in the end (delta: -393.8 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:34:25,794 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.18 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 67.99 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 1305.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * IcfgTransformer took 34.97 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 12462.60 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.8 GB in the end (delta: -393.8 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: 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, 252 locations, 1 error locations. SAFE Result, 12.3s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3013 SDtfs, 2227 SDslu, 4360 SDs, 0 SdLazy, 489 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6508occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 4332 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2806 NumberOfCodeBlocks, 2806 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2796 ConstructedInterpolants, 0 QuantifiedInterpolants, 3345577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 949/986 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.5.ufo.BOUNDED-10.pals.c_21.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-34-25-808.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-34-25-808.csv Received shutdown request...