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/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:31:54,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:31:54,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:31:54,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:31:54,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:31:54,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:31:54,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:31:54,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:31:54,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:31:54,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:31:54,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:31:54,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:31:54,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:31:54,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:31:54,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:31:54,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:31:54,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:31:54,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:31:54,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:31:54,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:31:54,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:31:54,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:31:54,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:31:54,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:31:54,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:31:54,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:31:54,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:31:54,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:31:54,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:31:54,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:31:54,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:31:54,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:31:54,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:31:54,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:31:54,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:31:54,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:31:54,948 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:31:54,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:31:54,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:31:54,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:31:54,968 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:31:54,968 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:31:54,968 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:31:54,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:31:54,969 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:31:54,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:31:54,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:31:54,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:31:54,970 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:31:54,970 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:31:54,972 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:31:54,972 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:31:55,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:31:55,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:31:55,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:31:55,070 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:31:55,070 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:31:55,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-10-15 15:31:55,072 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-10-15 15:31:55,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:31:55,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:31:55,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:31:55,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:31:55,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:31:55,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:31:55,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:31:55,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:31:55,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:31:55,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (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:31:55,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:31:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:31:55,883 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:31:55,883 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:55 BoogieIcfgContainer [2018-10-15 15:31:55,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:31:55,884 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:31:55,884 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:31:55,885 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:31:55,889 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,894 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:31:55,914 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:31:55 BasicIcfg [2018-10-15 15:31:55,914 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:31:55,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:31:55,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:31:55,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:31:55,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/3) ... [2018-10-15 15:31:55,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4a3ad8 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:55, skipping insertion in model container [2018-10-15 15:31:55,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:55" (2/3) ... [2018-10-15 15:31:55,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4a3ad8 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:31:55, skipping insertion in model container [2018-10-15 15:31:55,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:31:55" (3/3) ... [2018-10-15 15:31:55,923 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bplleft_unchanged_by_heapseparator [2018-10-15 15:31:55,934 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:31:55,944 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:31:55,959 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:31:55,986 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:31:55,987 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:31:55,987 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:31:55,987 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:31:55,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:31:55,988 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:31:55,988 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:31:55,988 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:31:55,988 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:31:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-10-15 15:31:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 15:31:56,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:56,017 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] [2018-10-15 15:31:56,018 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:56,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:56,024 INFO L82 PathProgramCache]: Analyzing trace with hash 416479419, now seen corresponding path program 1 times [2018-10-15 15:31:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:56,180 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:31:56,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:31:56,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:31:56,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:31:56,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:31:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:31:56,205 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-10-15 15:31:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:56,306 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-10-15 15:31:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:31:56,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-15 15:31:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:56,321 INFO L225 Difference]: With dead ends: 55 [2018-10-15 15:31:56,322 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 15:31:56,324 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:31:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 15:31:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-10-15 15:31:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 15:31:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-10-15 15:31:56,361 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2018-10-15 15:31:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:56,361 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-10-15 15:31:56,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:31:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-10-15 15:31:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 15:31:56,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:56,363 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 15:31:56,364 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:56,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1427848075, now seen corresponding path program 1 times [2018-10-15 15:31:56,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 15:31:56,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:31:56,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:31:56,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:31:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:31:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:31:56,525 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 4 states. [2018-10-15 15:31:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:56,683 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-10-15 15:31:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:31:56,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-15 15:31:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:56,685 INFO L225 Difference]: With dead ends: 68 [2018-10-15 15:31:56,686 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 15:31:56,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:31:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 15:31:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-10-15 15:31:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 15:31:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-10-15 15:31:56,695 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 36 [2018-10-15 15:31:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:56,695 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-10-15 15:31:56,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:31:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-10-15 15:31:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 15:31:56,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:56,698 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 15:31:56,698 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:56,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash -806427033, now seen corresponding path program 1 times [2018-10-15 15:31:56,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 15:31:56,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:56,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:31:56,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:31:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:31:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:31:56,998 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 6 states. [2018-10-15 15:31:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:57,318 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-10-15 15:31:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:31:57,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-10-15 15:31:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:57,325 INFO L225 Difference]: With dead ends: 85 [2018-10-15 15:31:57,325 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 15:31:57,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 15:31:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-10-15 15:31:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 15:31:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-10-15 15:31:57,346 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 48 [2018-10-15 15:31:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:57,347 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-10-15 15:31:57,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:31:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-10-15 15:31:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 15:31:57,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:57,354 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-15 15:31:57,354 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:57,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 296463705, now seen corresponding path program 2 times [2018-10-15 15:31:57,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 15:31:57,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:57,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:31:57,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:31:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:31:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:31:57,546 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2018-10-15 15:31:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:58,127 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-10-15 15:31:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:31:58,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-10-15 15:31:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:58,133 INFO L225 Difference]: With dead ends: 97 [2018-10-15 15:31:58,133 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 15:31:58,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:31:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 15:31:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-10-15 15:31:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 15:31:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-10-15 15:31:58,142 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 60 [2018-10-15 15:31:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:58,142 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-10-15 15:31:58,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:31:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-10-15 15:31:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 15:31:58,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:58,144 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-10-15 15:31:58,145 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:58,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash -504208619, now seen corresponding path program 1 times [2018-10-15 15:31:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:31:58,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:58,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:31:58,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:31:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:31:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:31:58,322 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2018-10-15 15:31:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:58,879 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-10-15 15:31:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:31:58,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-15 15:31:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:58,883 INFO L225 Difference]: With dead ends: 106 [2018-10-15 15:31:58,883 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 15:31:58,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:31:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 15:31:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2018-10-15 15:31:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 15:31:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-10-15 15:31:58,902 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 74 [2018-10-15 15:31:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:58,902 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-10-15 15:31:58,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:31:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-10-15 15:31:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 15:31:58,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:58,907 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:31:58,907 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:58,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash -882666233, now seen corresponding path program 2 times [2018-10-15 15:31:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:31:59,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:59,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:31:59,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:31:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:31:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:59,227 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 9 states. [2018-10-15 15:31:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:59,645 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-10-15 15:31:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:31:59,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-10-15 15:31:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:59,649 INFO L225 Difference]: With dead ends: 120 [2018-10-15 15:31:59,649 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 15:31:59,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:31:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 15:31:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2018-10-15 15:31:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 15:31:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-10-15 15:31:59,659 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 86 [2018-10-15 15:31:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:59,660 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-10-15 15:31:59,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:31:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-10-15 15:31:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 15:31:59,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:59,662 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:31:59,662 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:59,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1639140236, now seen corresponding path program 3 times [2018-10-15 15:31:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 50 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-15 15:31:59,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:59,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:31:59,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:31:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:31:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:59,818 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 9 states. [2018-10-15 15:32:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:00,141 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-10-15 15:32:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:32:00,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-10-15 15:32:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:00,144 INFO L225 Difference]: With dead ends: 118 [2018-10-15 15:32:00,144 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 15:32:00,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:32:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 15:32:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2018-10-15 15:32:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 15:32:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-10-15 15:32:00,152 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 93 [2018-10-15 15:32:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:00,153 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-10-15 15:32:00,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:32:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-10-15 15:32:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 15:32:00,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:00,155 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:32:00,155 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:00,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash -972152440, now seen corresponding path program 4 times [2018-10-15 15:32:00,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 68 proven. 53 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-15 15:32:00,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:00,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:00,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:00,370 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 11 states. [2018-10-15 15:32:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:00,985 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2018-10-15 15:32:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:32:00,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 107 [2018-10-15 15:32:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:00,990 INFO L225 Difference]: With dead ends: 124 [2018-10-15 15:32:00,991 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 15:32:00,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:32:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 15:32:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-10-15 15:32:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 15:32:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-10-15 15:32:00,999 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 107 [2018-10-15 15:32:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:01,000 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-10-15 15:32:01,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-10-15 15:32:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 15:32:01,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:01,002 INFO L375 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:32:01,002 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:01,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash -261932212, now seen corresponding path program 5 times [2018-10-15 15:32:01,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 18 proven. 159 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-15 15:32:01,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:01,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:01,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:01,194 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 11 states. [2018-10-15 15:32:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:01,950 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-10-15 15:32:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:32:01,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2018-10-15 15:32:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:01,953 INFO L225 Difference]: With dead ends: 143 [2018-10-15 15:32:01,953 INFO L226 Difference]: Without dead ends: 143 [2018-10-15 15:32:01,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:32:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-15 15:32:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2018-10-15 15:32:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 15:32:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-10-15 15:32:01,961 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 121 [2018-10-15 15:32:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:01,962 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-10-15 15:32:01,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-10-15 15:32:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 15:32:01,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:01,965 INFO L375 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:32:01,965 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:01,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1922956711, now seen corresponding path program 6 times [2018-10-15 15:32:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-15 15:32:02,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:32:02,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:32:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:32:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:32:02,088 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 5 states. [2018-10-15 15:32:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:02,150 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-10-15 15:32:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:32:02,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-15 15:32:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:02,152 INFO L225 Difference]: With dead ends: 140 [2018-10-15 15:32:02,153 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 15:32:02,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:32:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 15:32:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-15 15:32:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 15:32:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-10-15 15:32:02,159 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 128 [2018-10-15 15:32:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:02,159 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-10-15 15:32:02,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:32:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-10-15 15:32:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 15:32:02,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:02,162 INFO L375 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:32:02,162 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:02,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 905022177, now seen corresponding path program 7 times [2018-10-15 15:32:02,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-15 15:32:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:32:02,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:32:02,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:32:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:32:02,281 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 7 states. [2018-10-15 15:32:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:02,374 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-10-15 15:32:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:32:02,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2018-10-15 15:32:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:02,376 INFO L225 Difference]: With dead ends: 146 [2018-10-15 15:32:02,376 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 15:32:02,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 15:32:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-10-15 15:32:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 15:32:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-10-15 15:32:02,382 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 134 [2018-10-15 15:32:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:02,382 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-10-15 15:32:02,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:32:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-10-15 15:32:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 15:32:02,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:02,384 INFO L375 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:32:02,385 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:02,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1177500517, now seen corresponding path program 8 times [2018-10-15 15:32:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-15 15:32:02,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:32:02,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:32:02,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:32:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:32:02,475 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 6 states. [2018-10-15 15:32:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:02,588 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2018-10-15 15:32:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:32:02,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-15 15:32:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:02,591 INFO L225 Difference]: With dead ends: 157 [2018-10-15 15:32:02,591 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 15:32:02,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 15:32:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-10-15 15:32:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 15:32:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2018-10-15 15:32:02,596 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 140 [2018-10-15 15:32:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:02,596 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2018-10-15 15:32:02,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:32:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2018-10-15 15:32:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 15:32:02,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:02,598 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:32:02,598 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:02,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1145953677, now seen corresponding path program 9 times [2018-10-15 15:32:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 249 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-10-15 15:32:02,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:02,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:02,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:02,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:02,816 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand 11 states. [2018-10-15 15:32:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:03,442 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2018-10-15 15:32:03,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:32:03,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2018-10-15 15:32:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:03,445 INFO L225 Difference]: With dead ends: 184 [2018-10-15 15:32:03,445 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 15:32:03,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:32:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 15:32:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2018-10-15 15:32:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-15 15:32:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 178 transitions. [2018-10-15 15:32:03,450 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 178 transitions. Word has length 152 [2018-10-15 15:32:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:03,450 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 178 transitions. [2018-10-15 15:32:03,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2018-10-15 15:32:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-15 15:32:03,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:03,452 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:32:03,452 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:03,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2050527048, now seen corresponding path program 10 times [2018-10-15 15:32:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 188 proven. 27 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-15 15:32:03,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:03,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:03,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:03,676 INFO L87 Difference]: Start difference. First operand 172 states and 178 transitions. Second operand 11 states. [2018-10-15 15:32:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:04,378 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2018-10-15 15:32:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:32:04,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 171 [2018-10-15 15:32:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:04,380 INFO L225 Difference]: With dead ends: 179 [2018-10-15 15:32:04,380 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 15:32:04,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:32:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 15:32:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-15 15:32:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 15:32:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 185 transitions. [2018-10-15 15:32:04,387 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 185 transitions. Word has length 171 [2018-10-15 15:32:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:04,387 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 185 transitions. [2018-10-15 15:32:04,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 185 transitions. [2018-10-15 15:32:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 15:32:04,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:04,388 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:32:04,389 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:04,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -409167941, now seen corresponding path program 11 times [2018-10-15 15:32:04,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2018-10-15 15:32:04,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:04,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:32:04,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:32:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:32:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:32:04,820 INFO L87 Difference]: Start difference. First operand 179 states and 185 transitions. Second operand 9 states. [2018-10-15 15:32:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:04,911 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-10-15 15:32:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:32:04,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-10-15 15:32:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:04,913 INFO L225 Difference]: With dead ends: 188 [2018-10-15 15:32:04,913 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 15:32:04,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 15:32:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-10-15 15:32:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 15:32:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 191 transitions. [2018-10-15 15:32:04,919 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 191 transitions. Word has length 178 [2018-10-15 15:32:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:04,919 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 191 transitions. [2018-10-15 15:32:04,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:32:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 191 transitions. [2018-10-15 15:32:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 15:32:04,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:04,921 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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:32:04,921 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:04,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2098700917, now seen corresponding path program 12 times [2018-10-15 15:32:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2018-10-15 15:32:05,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:05,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:05,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:05,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:05,382 INFO L87 Difference]: Start difference. First operand 185 states and 191 transitions. Second operand 11 states. [2018-10-15 15:32:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:05,538 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2018-10-15 15:32:05,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:32:05,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2018-10-15 15:32:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:05,539 INFO L225 Difference]: With dead ends: 191 [2018-10-15 15:32:05,539 INFO L226 Difference]: Without dead ends: 191 [2018-10-15 15:32:05,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-15 15:32:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-15 15:32:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 15:32:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 197 transitions. [2018-10-15 15:32:05,543 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 197 transitions. Word has length 184 [2018-10-15 15:32:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:05,544 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 197 transitions. [2018-10-15 15:32:05,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 197 transitions. [2018-10-15 15:32:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 15:32:05,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:05,545 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 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:32:05,546 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:05,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash 938097071, now seen corresponding path program 13 times [2018-10-15 15:32:05,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:06,189 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-15 15:32:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2018-10-15 15:32:06,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:06,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-15 15:32:06,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:06,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:06,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:06,274 INFO L87 Difference]: Start difference. First operand 191 states and 197 transitions. Second operand 10 states. [2018-10-15 15:32:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:06,416 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-10-15 15:32:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:32:06,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-10-15 15:32:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:06,418 INFO L225 Difference]: With dead ends: 188 [2018-10-15 15:32:06,418 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:32:06,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:32:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:32:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:32:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:32:06,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2018-10-15 15:32:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:06,420 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:32:06,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:32:06,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:32:06,425 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:32:06 BasicIcfg [2018-10-15 15:32:06,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:32:06,427 INFO L168 Benchmark]: Toolchain (without parser) took 11295.60 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 16.8 MB). Free memory was 1.5 GB in the beginning and 939.6 MB in the end (delta: 541.3 MB). Peak memory consumption was 558.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:32:06,428 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:32:06,428 INFO L168 Benchmark]: Boogie Preprocessor took 59.65 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:32:06,429 INFO L168 Benchmark]: RCFGBuilder took 690.75 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:32:06,430 INFO L168 Benchmark]: IcfgTransformer took 30.12 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:32:06,430 INFO L168 Benchmark]: TraceAbstraction took 10510.38 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 16.8 MB). Free memory was 1.5 GB in the beginning and 939.6 MB in the end (delta: 520.1 MB). Peak memory consumption was 536.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:32:06,435 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.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.65 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 690.75 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 30.12 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 10510.38 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 16.8 MB). Free memory was 1.5 GB in the beginning and 939.6 MB in the end (delta: 520.1 MB). Peak memory consumption was 536.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: 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, 50 locations, 1 error locations. SAFE Result, 10.4s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 720 SDtfs, 1527 SDslu, 3313 SDs, 0 SdLazy, 1351 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 134 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1932 NumberOfCodeBlocks, 1932 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1915 ConstructedInterpolants, 0 QuantifiedInterpolants, 696562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 3442/4107 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/eureka_05.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-32-06-448.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-32-06-448.csv Received shutdown request...