java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:02:47,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:02:47,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:02:47,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:02:47,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:02:47,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:02:47,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:02:47,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:02:47,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:02:47,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:02:47,608 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:02:47,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:02:47,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:02:47,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:02:47,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:02:47,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:02:47,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:02:47,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:02:47,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:02:47,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:02:47,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:02:47,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:02:47,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:02:47,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:02:47,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:02:47,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:02:47,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:02:47,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:02:47,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:02:47,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:02:47,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:02:47,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:02:47,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:02:47,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:02:47,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:02:47,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:02:47,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:02:47,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:02:47,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:02:47,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:02:47,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:02:47,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:02:47,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:02:47,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:02:47,685 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:02:47,686 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:02:47,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_19.bpl [2019-08-05 11:02:47,687 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_19.bpl' [2019-08-05 11:02:47,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:02:47,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:02:47,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:02:47,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:02:47,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:02:47,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:02:47,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:02:47,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:02:47,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:02:47,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/1) ... [2019-08-05 11:02:47,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:02:47,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:02:47,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:02:47,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:02:47,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (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 [2019-08-05 11:02:47,912 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:02:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:02:47,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:02:48,362 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:02:48,362 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:02:48,363 INFO L202 PluginConnector]: Adding new model test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:02:48 BoogieIcfgContainer [2019-08-05 11:02:48,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:02:48,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:02:48,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:02:48,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:02:48,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:47" (1/2) ... [2019-08-05 11:02:48,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5331d301 and model type test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:02:48, skipping insertion in model container [2019-08-05 11:02:48,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:02:48" (2/2) ... [2019-08-05 11:02:48,383 INFO L109 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i_19.bpl [2019-08-05 11:02:48,405 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:02:48,423 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:02:48,459 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:02:48,493 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:02:48,494 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:02:48,494 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:02:48,494 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:02:48,494 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:02:48,495 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:02:48,495 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:02:48,495 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:02:48,495 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:02:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:02:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:02:48,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:48,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:02:48,520 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash 29985, now seen corresponding path program 1 times [2019-08-05 11:02:48,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:48,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:02:48,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:48,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:02:48,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:02:48,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:02:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:02:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:02:48,776 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:02:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:48,806 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:02:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:02:48,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:02:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:48,818 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:02:48,818 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:02:48,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:02:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:02:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:02:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:02:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:02:48,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:02:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:48,854 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:02:48,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:02:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:02:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:02:48,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:48,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:02:48,856 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash 927559, now seen corresponding path program 1 times [2019-08-05 11:02:48,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:48,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:02:48,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:02:49,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:02:49,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:02:49,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:02:49,169 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:02:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:49,257 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:02:49,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:02:49,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:02:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:49,258 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:02:49,258 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:02:49,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:02:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:02:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:02:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:02:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:02:49,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:02:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:49,262 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:02:49,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:02:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:02:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:02:49,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:49,263 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:02:49,263 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 28752353, now seen corresponding path program 2 times [2019-08-05 11:02:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:49,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:02:49,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:49,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:02:49,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:02:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:02:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:49,540 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:02:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:49,573 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:02:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:02:49,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:02:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:49,574 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:02:49,574 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:02:49,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:02:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:02:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:02:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:02:49,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:02:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:49,577 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:02:49,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:02:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:02:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:02:49,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:49,578 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:02:49,578 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash 891320967, now seen corresponding path program 3 times [2019-08-05 11:02:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:49,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:02:49,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:49,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:02:49,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:02:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:02:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:49,851 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:02:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:49,897 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:02:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:02:49,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:02:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:49,899 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:02:49,899 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:02:49,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:02:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:02:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:02:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:02:49,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:02:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:49,904 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:02:49,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:02:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:02:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:02:49,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:49,905 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:02:49,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144225, now seen corresponding path program 4 times [2019-08-05 11:02:49,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:50,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:02:50,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:50,309 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:50,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:02:50,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:50,635 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-08-05 11:02:50,636 INFO L567 ElimStorePlain]: treesize reduction 17, result has 81.7 percent of original size [2019-08-05 11:02:50,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:50,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:51,355 WARN L188 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-08-05 11:02:51,356 INFO L341 Elim1Store]: treesize reduction 90, result has 60.9 percent of original size [2019-08-05 11:02:51,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 183 [2019-08-05 11:02:51,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:51,920 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-08-05 11:02:51,921 INFO L567 ElimStorePlain]: treesize reduction 88, result has 58.3 percent of original size [2019-08-05 11:02:51,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 11:02:51,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:51,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:63 [2019-08-05 11:02:52,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:52,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2019-08-05 11:02:52,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:52,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:52,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:52,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:74 [2019-08-05 11:02:52,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,241 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:52,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2019-08-05 11:02:52,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:52,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:52,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:52,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:89 [2019-08-05 11:02:52,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:52,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 111 [2019-08-05 11:02:52,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:52,660 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-08-05 11:02:52,661 INFO L567 ElimStorePlain]: treesize reduction 36, result has 73.3 percent of original size [2019-08-05 11:02:52,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:52,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:113, output treesize:99 [2019-08-05 11:02:52,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:52,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:52,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 17 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 99 [2019-08-05 11:02:52,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:52,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:52,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:52,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:115, output treesize:111 [2019-08-05 11:02:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:53,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:53,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:02:53,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:53,252 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:03:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:05,509 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:03:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:03:05,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:03:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:05,510 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:03:05,510 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:03:05,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:03:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:03:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:03:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:03:05,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-08-05 11:03:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:05,512 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:03:05,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:03:05,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:03:05,519 INFO L202 PluginConnector]: Adding new model test-bitfields-2.1_false-valid-free.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:03:05 BoogieIcfgContainer [2019-08-05 11:03:05,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:03:05,521 INFO L168 Benchmark]: Toolchain (without parser) took 17766.24 ms. Allocated memory was 133.2 MB in the beginning and 196.1 MB in the end (delta: 62.9 MB). Free memory was 109.9 MB in the beginning and 60.4 MB in the end (delta: 49.5 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:05,522 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:03:05,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 133.2 MB. Free memory was 109.9 MB in the beginning and 108.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:05,523 INFO L168 Benchmark]: Boogie Preprocessor took 45.13 ms. Allocated memory is still 133.2 MB. Free memory was 108.1 MB in the beginning and 106.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:05,524 INFO L168 Benchmark]: RCFGBuilder took 515.53 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 87.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:05,525 INFO L168 Benchmark]: TraceAbstraction took 17153.95 ms. Allocated memory was 133.2 MB in the beginning and 196.1 MB in the end (delta: 62.9 MB). Free memory was 87.1 MB in the beginning and 60.4 MB in the end (delta: 26.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:05,529 INFO L335 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 133.2 MB. Free memory was 109.9 MB in the beginning and 108.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.13 ms. Allocated memory is still 133.2 MB. Free memory was 108.1 MB in the beginning and 106.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 515.53 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 87.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17153.95 ms. Allocated memory was 133.2 MB in the beginning and 196.1 MB in the end (delta: 62.9 MB). Free memory was 87.1 MB in the beginning and 60.4 MB in the end (delta: 26.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 224]: 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, 5 locations, 1 error locations. SAFE Result, 17.0s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 6 SDs, 0 SdLazy, 41 SolverSat, 6 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=4, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 20 ConstructedInterpolants, 5 QuantifiedInterpolants, 2982 SizeOfPredicates, 31 NumberOfNonLiveVariables, 625 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...