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_false-valid-deref.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:56:19,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:56:19,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:56:19,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:56:19,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:56:19,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:56:19,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:56:19,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:56:19,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:56:19,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:56:19,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:56:19,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:56:19,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:56:19,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:56:19,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:56:19,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:56:19,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:56:19,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:56:19,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:56:19,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:56:19,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:56:19,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:56:19,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:56:19,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:56:19,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:56:19,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:56:19,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:56:19,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:56:19,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:56:19,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:56:19,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:56:19,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:56:19,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:56:19,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:56:19,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:56:19,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:56:19,784 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-14 16:56:19,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:56:19,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:56:19,795 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:56:19,795 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:56:19,795 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:56:19,796 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:56:19,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:56:19,796 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:56:19,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:56:19,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:56:19,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:56:19,797 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:56:19,797 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:56:19,798 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:56:19,798 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:56:19,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:56:19,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:56:19,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:56:19,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:56:19,892 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:56:19,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_7.bpl [2018-10-14 16:56:19,893 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_7.bpl' [2018-10-14 16:56:19,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:56:19,992 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:56:19,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:56:19,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:56:19,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:56:20,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/1) ... [2018-10-14 16:56:20,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:56:20,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:56:20,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:56:20,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:56:20,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (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-14 16:56:20,145 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:56:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:56:20,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:56:20,757 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:56:20,758 INFO L202 PluginConnector]: Adding new model test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:56:20 BoogieIcfgContainer [2018-10-14 16:56:20,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:56:20,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:56:20,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:56:20,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:56:20,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:19" (1/2) ... [2018-10-14 16:56:20,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0c5211 and model type test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:56:20, skipping insertion in model container [2018-10-14 16:56:20,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:56:20" (2/2) ... [2018-10-14 16:56:20,767 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i_7.bpl [2018-10-14 16:56:20,777 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:56:20,786 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:56:20,804 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:56:20,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:56:20,835 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:56:20,835 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:56:20,835 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:56:20,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:56:20,836 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:56:20,836 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:56:20,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:56:20,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:56:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-10-14 16:56:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-14 16:56:20,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:20,870 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] [2018-10-14 16:56:20,871 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:20,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1532984741, now seen corresponding path program 1 times [2018-10-14 16:56:20,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:21,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-14 16:56:21,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:56:21,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 16:56:21,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 16:56:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 16:56:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:56:21,291 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2018-10-14 16:56:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:21,472 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-14 16:56:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 16:56:21,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-10-14 16:56:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:21,488 INFO L225 Difference]: With dead ends: 81 [2018-10-14 16:56:21,488 INFO L226 Difference]: Without dead ends: 81 [2018-10-14 16:56:21,490 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-14 16:56:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-14 16:56:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-14 16:56:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-14 16:56:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-14 16:56:21,535 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-10-14 16:56:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:21,536 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-14 16:56:21,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 16:56:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-14 16:56:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-14 16:56:21,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:21,539 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] [2018-10-14 16:56:21,540 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:21,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash -604737268, now seen corresponding path program 1 times [2018-10-14 16:56:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:21,700 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-14 16:56:21,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:56:21,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:56:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:56:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:56:21,704 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 5 states. [2018-10-14 16:56:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:21,860 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-14 16:56:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 16:56:21,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-10-14 16:56:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:21,864 INFO L225 Difference]: With dead ends: 84 [2018-10-14 16:56:21,864 INFO L226 Difference]: Without dead ends: 84 [2018-10-14 16:56:21,865 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-14 16:56:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-14 16:56:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-14 16:56:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-14 16:56:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-14 16:56:21,874 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-10-14 16:56:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:21,875 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-14 16:56:21,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:56:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-14 16:56:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-14 16:56:21,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:21,878 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] [2018-10-14 16:56:21,879 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:21,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash 293957701, now seen corresponding path program 2 times [2018-10-14 16:56:21,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:22,151 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-14 16:56:22,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:22,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 16:56:22,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:56:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:56:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:22,154 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 6 states. [2018-10-14 16:56:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:22,369 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-14 16:56:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:56:22,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-10-14 16:56:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:22,372 INFO L225 Difference]: With dead ends: 87 [2018-10-14 16:56:22,372 INFO L226 Difference]: Without dead ends: 87 [2018-10-14 16:56:22,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-14 16:56:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-14 16:56:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-14 16:56:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-14 16:56:22,383 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-14 16:56:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:22,384 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-14 16:56:22,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:56:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-14 16:56:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-14 16:56:22,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:22,386 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] [2018-10-14 16:56:22,386 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:22,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1510344084, now seen corresponding path program 3 times [2018-10-14 16:56:22,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:22,534 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-14 16:56:22,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:22,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:56:22,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:56:22,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:56:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:56:22,537 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 7 states. [2018-10-14 16:56:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:22,748 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-14 16:56:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 16:56:22,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-10-14 16:56:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:22,751 INFO L225 Difference]: With dead ends: 90 [2018-10-14 16:56:22,751 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 16:56:22,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 16:56:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-14 16:56:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-14 16:56:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-14 16:56:22,759 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-14 16:56:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:22,760 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-14 16:56:22,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:56:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-14 16:56:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-14 16:56:22,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:22,762 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] [2018-10-14 16:56:22,762 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:22,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1949111579, now seen corresponding path program 4 times [2018-10-14 16:56:22,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:23,279 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-14 16:56:23,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:23,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:56:23,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:56:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:56:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:23,282 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 8 states. [2018-10-14 16:56:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:23,468 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-14 16:56:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:56:23,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-10-14 16:56:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:23,473 INFO L225 Difference]: With dead ends: 93 [2018-10-14 16:56:23,473 INFO L226 Difference]: Without dead ends: 93 [2018-10-14 16:56:23,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-14 16:56:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-14 16:56:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-14 16:56:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-14 16:56:23,481 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-14 16:56:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:23,482 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-14 16:56:23,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:56:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-14 16:56:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-14 16:56:23,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:23,484 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] [2018-10-14 16:56:23,485 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:23,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash 608893900, now seen corresponding path program 5 times [2018-10-14 16:56:23,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:23,795 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-14 16:56:23,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:23,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:56:23,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:56:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:56:23,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:56:23,797 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 9 states. [2018-10-14 16:56:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:24,294 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-14 16:56:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:56:24,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-10-14 16:56:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:24,298 INFO L225 Difference]: With dead ends: 96 [2018-10-14 16:56:24,298 INFO L226 Difference]: Without dead ends: 96 [2018-10-14 16:56:24,298 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-14 16:56:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-14 16:56:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-14 16:56:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-14 16:56:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-14 16:56:24,305 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-14 16:56:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:24,306 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-14 16:56:24,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:56:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-14 16:56:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-14 16:56:24,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:24,308 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] [2018-10-14 16:56:24,309 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:24,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 545385861, now seen corresponding path program 6 times [2018-10-14 16:56:24,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:24,510 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-14 16:56:24,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:24,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:56:24,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:56:24,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:56:24,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:24,512 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 10 states. [2018-10-14 16:56:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:24,778 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-14 16:56:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:56:24,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-10-14 16:56:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:24,780 INFO L225 Difference]: With dead ends: 99 [2018-10-14 16:56:24,781 INFO L226 Difference]: Without dead ends: 99 [2018-10-14 16:56:24,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:56:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-14 16:56:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-14 16:56:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-14 16:56:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-14 16:56:24,788 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-14 16:56:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:24,789 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-14 16:56:24,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:56:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-14 16:56:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-14 16:56:24,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:24,791 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] [2018-10-14 16:56:24,791 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:24,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:24,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1636993748, now seen corresponding path program 7 times [2018-10-14 16:56:24,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:24,983 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-14 16:56:24,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:24,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:56:24,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:56:24,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:56:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:56:24,985 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 11 states. [2018-10-14 16:56:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:25,198 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-14 16:56:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:56:25,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-10-14 16:56:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:25,201 INFO L225 Difference]: With dead ends: 102 [2018-10-14 16:56:25,201 INFO L226 Difference]: Without dead ends: 102 [2018-10-14 16:56:25,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:56:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-14 16:56:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-14 16:56:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-14 16:56:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-14 16:56:25,210 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-14 16:56:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:25,211 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-14 16:56:25,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:56:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-14 16:56:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-14 16:56:25,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:25,213 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] [2018-10-14 16:56:25,213 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:25,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:25,214 INFO L82 PathProgramCache]: Analyzing trace with hash 307001381, now seen corresponding path program 8 times [2018-10-14 16:56:25,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:25,668 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-14 16:56:25,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:25,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:56:25,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:56:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:56:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:25,670 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 12 states. [2018-10-14 16:56:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:26,108 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-14 16:56:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:56:26,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-10-14 16:56:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:26,109 INFO L225 Difference]: With dead ends: 105 [2018-10-14 16:56:26,110 INFO L226 Difference]: Without dead ends: 105 [2018-10-14 16:56:26,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:56:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-14 16:56:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-14 16:56:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 16:56:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-14 16:56:26,115 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-14 16:56:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:26,116 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-14 16:56:26,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:56:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-14 16:56:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 16:56:26,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:26,118 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] [2018-10-14 16:56:26,118 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:26,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 526870156, now seen corresponding path program 9 times [2018-10-14 16:56:26,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:26,372 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-14 16:56:26,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:26,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:56:26,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:56:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:56:26,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:56:26,374 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 13 states. [2018-10-14 16:56:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:26,632 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-14 16:56:26,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:56:26,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-10-14 16:56:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:26,634 INFO L225 Difference]: With dead ends: 106 [2018-10-14 16:56:26,634 INFO L226 Difference]: Without dead ends: 106 [2018-10-14 16:56:26,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:56:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-14 16:56:26,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-10-14 16:56:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 16:56:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-14 16:56:26,640 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-14 16:56:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:26,640 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-14 16:56:26,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:56:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-14 16:56:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-14 16:56:26,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:26,642 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] [2018-10-14 16:56:26,643 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:26,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 812419781, now seen corresponding path program 10 times [2018-10-14 16:56:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-14 16:56:26,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:56:26,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 16:56:26,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:56:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:56:26,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:26,875 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 8 states. [2018-10-14 16:56:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:27,142 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-14 16:56:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:56:27,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-10-14 16:56:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:27,143 INFO L225 Difference]: With dead ends: 104 [2018-10-14 16:56:27,143 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:56:27,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:56:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:56:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:56:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:56:27,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-10-14 16:56:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:27,146 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:56:27,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:56:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:56:27,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:56:27,152 INFO L202 PluginConnector]: Adding new model test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:56:27 BoogieIcfgContainer [2018-10-14 16:56:27,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:56:27,153 INFO L168 Benchmark]: Toolchain (without parser) took 7161.84 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -25.8 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:27,156 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:56:27,156 INFO L168 Benchmark]: Boogie Preprocessor took 76.75 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-14 16:56:27,157 INFO L168 Benchmark]: RCFGBuilder took 687.92 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-14 16:56:27,157 INFO L168 Benchmark]: TraceAbstraction took 6392.77 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -57.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:56:27,161 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.75 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 687.92 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 6392.77 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -57.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: 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, 80 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 763 SDtfs, 547 SDslu, 3396 SDs, 0 SdLazy, 619 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 990 NumberOfCodeBlocks, 990 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 979 ConstructedInterpolants, 0 QuantifiedInterpolants, 211389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 145/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_false-valid-deref.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-56-27-173.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-56-27-173.csv Received shutdown request...