java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 21:15:59,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 21:15:59,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 21:15:59,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 21:15:59,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 21:15:59,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 21:15:59,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 21:15:59,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 21:15:59,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 21:15:59,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 21:15:59,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 21:15:59,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 21:15:59,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 21:15:59,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 21:15:59,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 21:15:59,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 21:15:59,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 21:15:59,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 21:15:59,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 21:15:59,661 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 21:15:59,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 21:15:59,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 21:15:59,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 21:15:59,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 21:15:59,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 21:15:59,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 21:15:59,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 21:15:59,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 21:15:59,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 21:15:59,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 21:15:59,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 21:15:59,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 21:15:59,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 21:15:59,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 21:15:59,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 21:15:59,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 21:15:59,682 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-12 21:15:59,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 21:15:59,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 21:15:59,695 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 21:15:59,696 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 21:15:59,696 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 21:15:59,696 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 21:15:59,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 21:15:59,697 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 21:15:59,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 21:15:59,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 21:15:59,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 21:15:59,698 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 21:15:59,698 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 21:15:59,699 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 21:15:59,699 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 21:15:59,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 21:15:59,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 21:15:59,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 21:15:59,776 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 21:15:59,777 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 21:15:59,778 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl [2018-10-12 21:15:59,778 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl' [2018-10-12 21:15:59,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 21:15:59,852 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 21:15:59,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 21:15:59,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 21:15:59,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 21:15:59,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/1) ... [2018-10-12 21:15:59,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 21:15:59,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 21:15:59,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 21:15:59,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 21:15:59,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (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-12 21:15:59,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 21:15:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 21:15:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 21:16:00,749 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 21:16:00,750 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:16:00 BoogieIcfgContainer [2018-10-12 21:16:00,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 21:16:00,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 21:16:00,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 21:16:00,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 21:16:00,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:15:59" (1/2) ... [2018-10-12 21:16:00,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678e6b98 and model type test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:16:00, skipping insertion in model container [2018-10-12 21:16:00,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:16:00" (2/2) ... [2018-10-12 21:16:00,758 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl [2018-10-12 21:16:00,768 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 21:16:00,777 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 21:16:00,794 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 21:16:00,823 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 21:16:00,824 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 21:16:00,824 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 21:16:00,824 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 21:16:00,824 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 21:16:00,825 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 21:16:00,825 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 21:16:00,825 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 21:16:00,825 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 21:16:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-10-12 21:16:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-12 21:16:00,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:00,860 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] [2018-10-12 21:16:00,861 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:00,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1241051684, now seen corresponding path program 1 times [2018-10-12 21:16:00,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:01,260 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-12 21:16:01,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:16:01,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-12 21:16:01,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-12 21:16:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-12 21:16:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 21:16:01,289 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2018-10-12 21:16:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:01,497 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-12 21:16:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-12 21:16:01,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-12 21:16:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:01,527 INFO L225 Difference]: With dead ends: 108 [2018-10-12 21:16:01,527 INFO L226 Difference]: Without dead ends: 108 [2018-10-12 21:16:01,531 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-12 21:16:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-12 21:16:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-12 21:16:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-12 21:16:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-12 21:16:01,612 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-12 21:16:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:01,613 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-12 21:16:01,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-12 21:16:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-12 21:16:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-12 21:16:01,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:01,617 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] [2018-10-12 21:16:01,618 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:01,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1354376021, now seen corresponding path program 1 times [2018-10-12 21:16:01,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:01,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 21:16:01,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 21:16:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 21:16:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-12 21:16:01,822 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 5 states. [2018-10-12 21:16:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:01,972 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-12 21:16:01,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-12 21:16:01,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-10-12 21:16:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:01,985 INFO L225 Difference]: With dead ends: 111 [2018-10-12 21:16:01,985 INFO L226 Difference]: Without dead ends: 111 [2018-10-12 21:16:01,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:16:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-12 21:16:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-12 21:16:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-12 21:16:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-12 21:16:01,999 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-12 21:16:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:02,000 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-12 21:16:02,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 21:16:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-12 21:16:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-12 21:16:02,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:02,004 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 21:16:02,004 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:02,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -555094212, now seen corresponding path program 2 times [2018-10-12 21:16:02,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:02,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:02,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-12 21:16:02,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 21:16:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 21:16:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:16:02,203 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 6 states. [2018-10-12 21:16:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:02,357 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-12 21:16:02,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 21:16:02,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-10-12 21:16:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:02,361 INFO L225 Difference]: With dead ends: 114 [2018-10-12 21:16:02,361 INFO L226 Difference]: Without dead ends: 114 [2018-10-12 21:16:02,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:16:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-12 21:16:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-12 21:16:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-12 21:16:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-12 21:16:02,372 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-12 21:16:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:02,373 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-12 21:16:02,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 21:16:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-12 21:16:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-12 21:16:02,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:02,375 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:02,376 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:02,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1259030005, now seen corresponding path program 3 times [2018-10-12 21:16:02,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:02,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:02,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 21:16:02,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 21:16:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 21:16:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 21:16:02,702 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 7 states. [2018-10-12 21:16:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:03,033 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-12 21:16:03,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-12 21:16:03,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-10-12 21:16:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:03,036 INFO L225 Difference]: With dead ends: 117 [2018-10-12 21:16:03,036 INFO L226 Difference]: Without dead ends: 117 [2018-10-12 21:16:03,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:16:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-12 21:16:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-12 21:16:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-12 21:16:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-12 21:16:03,047 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-12 21:16:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:03,048 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-12 21:16:03,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 21:16:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-12 21:16:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-12 21:16:03,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:03,050 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:03,051 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:03,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2034874212, now seen corresponding path program 4 times [2018-10-12 21:16:03,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:03,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:03,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 21:16:03,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:16:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:16:03,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:16:03,348 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 8 states. [2018-10-12 21:16:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:04,081 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-12 21:16:04,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 21:16:04,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2018-10-12 21:16:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:04,085 INFO L225 Difference]: With dead ends: 120 [2018-10-12 21:16:04,085 INFO L226 Difference]: Without dead ends: 120 [2018-10-12 21:16:04,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-12 21:16:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-12 21:16:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-12 21:16:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-12 21:16:04,108 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-12 21:16:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:04,109 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-12 21:16:04,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:16:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-12 21:16:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-12 21:16:04,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:04,114 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:04,114 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:04,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 677376149, now seen corresponding path program 5 times [2018-10-12 21:16:04,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:04,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:04,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 21:16:04,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 21:16:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 21:16:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-12 21:16:04,388 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 9 states. [2018-10-12 21:16:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:04,840 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-12 21:16:04,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 21:16:04,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2018-10-12 21:16:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:04,848 INFO L225 Difference]: With dead ends: 123 [2018-10-12 21:16:04,848 INFO L226 Difference]: Without dead ends: 123 [2018-10-12 21:16:04,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-12 21:16:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-12 21:16:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-12 21:16:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-12 21:16:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-12 21:16:04,855 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-12 21:16:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:04,856 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-12 21:16:04,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 21:16:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-12 21:16:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-12 21:16:04,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:04,858 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:04,859 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:04,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash 108141052, now seen corresponding path program 6 times [2018-10-12 21:16:04,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:05,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:05,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 21:16:05,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 21:16:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 21:16:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:16:05,201 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 10 states. [2018-10-12 21:16:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:05,435 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-12 21:16:05,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-12 21:16:05,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2018-10-12 21:16:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:05,440 INFO L225 Difference]: With dead ends: 126 [2018-10-12 21:16:05,440 INFO L226 Difference]: Without dead ends: 126 [2018-10-12 21:16:05,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-12 21:16:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-12 21:16:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-12 21:16:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-12 21:16:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-12 21:16:05,447 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-12 21:16:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:05,448 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-12 21:16:05,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 21:16:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-12 21:16:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-12 21:16:05,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:05,450 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:05,451 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:05,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1443749067, now seen corresponding path program 7 times [2018-10-12 21:16:05,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 21:16:06,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 21:16:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 21:16:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-12 21:16:06,228 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 11 states. [2018-10-12 21:16:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:06,571 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-12 21:16:06,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 21:16:06,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-10-12 21:16:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:06,573 INFO L225 Difference]: With dead ends: 129 [2018-10-12 21:16:06,573 INFO L226 Difference]: Without dead ends: 129 [2018-10-12 21:16:06,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-12 21:16:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-12 21:16:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-12 21:16:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-12 21:16:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-12 21:16:06,579 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-12 21:16:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:06,579 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-12 21:16:06,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 21:16:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-12 21:16:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-12 21:16:06,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:06,582 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:06,582 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:06,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1520657244, now seen corresponding path program 8 times [2018-10-12 21:16:06,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:06,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:06,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 21:16:06,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 21:16:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 21:16:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:06,914 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 12 states. [2018-10-12 21:16:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:07,147 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-12 21:16:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 21:16:07,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2018-10-12 21:16:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:07,156 INFO L225 Difference]: With dead ends: 132 [2018-10-12 21:16:07,156 INFO L226 Difference]: Without dead ends: 132 [2018-10-12 21:16:07,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-12 21:16:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-12 21:16:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-12 21:16:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-12 21:16:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-12 21:16:07,166 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-12 21:16:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:07,172 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-12 21:16:07,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 21:16:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-12 21:16:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-12 21:16:07,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:07,177 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:07,178 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:07,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1031527893, now seen corresponding path program 9 times [2018-10-12 21:16:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:08,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:08,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 21:16:08,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 21:16:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 21:16:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-12 21:16:08,088 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 13 states. [2018-10-12 21:16:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:08,432 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-12 21:16:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 21:16:08,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2018-10-12 21:16:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:08,434 INFO L225 Difference]: With dead ends: 133 [2018-10-12 21:16:08,434 INFO L226 Difference]: Without dead ends: 133 [2018-10-12 21:16:08,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-12 21:16:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-12 21:16:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-10-12 21:16:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-12 21:16:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-12 21:16:08,439 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-12 21:16:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:08,440 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-12 21:16:08,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 21:16:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-12 21:16:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-12 21:16:08,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:08,441 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:16:08,442 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:08,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2091899716, now seen corresponding path program 10 times [2018-10-12 21:16:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:09,495 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-10-12 21:16:10,057 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-10-12 21:16:10,455 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 18 [2018-10-12 21:16:11,133 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2018-10-12 21:16:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:14,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:14,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 21:16:14,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 21:16:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 21:16:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 21:16:14,107 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-12 21:16:18,122 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 52 [2018-10-12 21:16:18,543 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2018-10-12 21:16:18,775 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 48 [2018-10-12 21:16:19,012 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 55 [2018-10-12 21:16:19,320 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 57 [2018-10-12 21:16:19,620 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 59 [2018-10-12 21:16:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:19,621 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-12 21:16:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 21:16:19,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-12 21:16:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:19,622 INFO L225 Difference]: With dead ends: 122 [2018-10-12 21:16:19,622 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 21:16:19,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 23 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=702, Invalid=4998, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 21:16:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 21:16:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 21:16:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 21:16:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 21:16:19,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-10-12 21:16:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:19,625 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 21:16:19,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 21:16:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 21:16:19,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 21:16:19,630 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 09:16:19 BoogieIcfgContainer [2018-10-12 21:16:19,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 21:16:19,631 INFO L168 Benchmark]: Toolchain (without parser) took 19780.21 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 220.7 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -250.7 MB). Peak memory consumption was 683.8 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:19,632 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-12 21:16:19,633 INFO L168 Benchmark]: Boogie Preprocessor took 62.17 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-12 21:16:19,633 INFO L168 Benchmark]: RCFGBuilder took 834.83 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:19,634 INFO L168 Benchmark]: TraceAbstraction took 18878.82 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 220.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -282.4 MB). Peak memory consumption was 652.1 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:19,638 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.22 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 62.17 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 834.83 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18878.82 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 220.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -282.4 MB). Peak memory consumption was 652.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: 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, 107 locations, 1 error locations. SAFE Result, 18.8s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1011 SDtfs, 1079 SDslu, 5395 SDs, 0 SdLazy, 2282 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 24 SyntacticMatches, 23 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=10, 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, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1287 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1276 ConstructedInterpolants, 0 QuantifiedInterpolants, 550425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/550 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/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_21-16-19-648.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_21-16-19-648.csv Received shutdown request...