java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:48:48,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:48:48,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:48:48,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:48:48,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:48:48,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:48:48,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:48:48,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:48:48,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:48:48,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:48:48,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:48:48,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:48:48,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:48:48,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:48:48,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:48:48,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:48:48,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:48:48,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:48:48,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:48:48,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:48:48,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:48:48,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:48:48,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:48:48,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:48:48,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:48:48,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:48:48,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:48:48,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:48:48,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:48:48,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:48:48,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:48:48,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:48:48,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:48:48,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:48:48,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:48:48,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:48:48,345 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-10 15:48:48,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:48:48,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:48:48,362 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:48:48,363 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:48:48,363 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:48:48,363 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:48:48,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:48:48,367 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:48:48,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:48:48,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:48:48,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:48:48,368 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:48:48,368 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:48:48,370 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:48:48,370 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:48:48,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:48:48,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:48:48,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:48:48,451 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:48:48,452 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:48:48,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl [2018-10-10 15:48:48,453 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl' [2018-10-10 15:48:48,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:48:48,557 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:48:48,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:48:48,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:48:48,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:48:48,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/1) ... [2018-10-10 15:48:48,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:48:48,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:48:48,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:48:48,623 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:48:48,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (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-10 15:48:48,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:48:48,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:48:48,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:48:49,327 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:48:49,328 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:48:49 BoogieIcfgContainer [2018-10-10 15:48:49,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:48:49,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:48:49,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:48:49,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:48:49,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:48:48" (1/2) ... [2018-10-10 15:48:49,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aee441d and model type test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:48:49, skipping insertion in model container [2018-10-10 15:48:49,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:48:49" (2/2) ... [2018-10-10 15:48:49,336 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl [2018-10-10 15:48:49,346 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:48:49,354 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:48:49,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:48:49,400 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:48:49,401 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:48:49,401 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:48:49,402 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:48:49,402 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:48:49,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:48:49,402 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:48:49,402 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:48:49,402 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:48:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-10-10 15:48:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 15:48:49,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:49,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:49,437 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:49,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -979291157, now seen corresponding path program 1 times [2018-10-10 15:48:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:49,848 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-10 15:48:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:48:49,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:48:49,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:48:49,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:48:49,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:48:49,877 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-10-10 15:48:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:50,077 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-10 15:48:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:48:50,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-10-10 15:48:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:50,093 INFO L225 Difference]: With dead ends: 93 [2018-10-10 15:48:50,093 INFO L226 Difference]: Without dead ends: 93 [2018-10-10 15:48:50,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:48:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-10 15:48:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-10 15:48:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-10 15:48:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-10 15:48:50,141 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-10 15:48:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:50,143 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-10 15:48:50,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:48:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-10 15:48:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-10 15:48:50,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:50,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:50,147 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:50,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 284097426, now seen corresponding path program 1 times [2018-10-10 15:48:50,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:50,381 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-10 15:48:50,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:50,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:48:50,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:48:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:48:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:48:50,388 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 5 states. [2018-10-10 15:48:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:50,534 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-10 15:48:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:48:50,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-10-10 15:48:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:50,538 INFO L225 Difference]: With dead ends: 96 [2018-10-10 15:48:50,538 INFO L226 Difference]: Without dead ends: 96 [2018-10-10 15:48:50,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:48:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-10 15:48:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-10 15:48:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-10 15:48:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-10 15:48:50,549 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-10 15:48:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:50,550 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-10 15:48:50,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:48:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-10 15:48:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 15:48:50,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:50,553 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:50,553 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:50,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958731, now seen corresponding path program 2 times [2018-10-10 15:48:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:50,793 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-10 15:48:50,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:50,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:48:50,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:48:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:48:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:48:50,796 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 6 states. [2018-10-10 15:48:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:50,895 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-10 15:48:50,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:48:50,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-10-10 15:48:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:50,899 INFO L225 Difference]: With dead ends: 99 [2018-10-10 15:48:50,899 INFO L226 Difference]: Without dead ends: 99 [2018-10-10 15:48:50,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:48:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-10 15:48:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-10 15:48:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-10 15:48:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-10 15:48:50,908 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-10 15:48:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:50,909 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-10 15:48:50,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:48:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-10 15:48:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 15:48:50,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:50,911 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:50,912 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:50,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1726944014, now seen corresponding path program 3 times [2018-10-10 15:48:50,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:51,166 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-10 15:48:51,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:48:51,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:48:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:48:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:48:51,168 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 7 states. [2018-10-10 15:48:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:51,557 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-10 15:48:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:48:51,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-10-10 15:48:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:51,563 INFO L225 Difference]: With dead ends: 102 [2018-10-10 15:48:51,563 INFO L226 Difference]: Without dead ends: 102 [2018-10-10 15:48:51,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:48:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-10 15:48:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-10 15:48:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-10 15:48:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-10 15:48:51,584 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-10 15:48:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:51,585 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-10 15:48:51,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:48:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-10 15:48:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 15:48:51,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:51,589 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:51,592 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:51,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash 658231595, now seen corresponding path program 4 times [2018-10-10 15:48:51,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:51,832 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-10 15:48:51,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:51,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:48:51,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:48:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:48:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:48:51,834 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 8 states. [2018-10-10 15:48:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:52,360 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-10 15:48:52,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:48:52,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-10-10 15:48:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:52,363 INFO L225 Difference]: With dead ends: 105 [2018-10-10 15:48:52,364 INFO L226 Difference]: Without dead ends: 105 [2018-10-10 15:48:52,364 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-10 15:48:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-10 15:48:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-10 15:48:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-10 15:48:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-10 15:48:52,372 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-10 15:48:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:52,372 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-10 15:48:52,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:48:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-10 15:48:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 15:48:52,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:52,376 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:52,376 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:52,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1485854290, now seen corresponding path program 5 times [2018-10-10 15:48:52,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:52,585 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-10 15:48:52,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:52,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:48:52,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:48:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:48:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:48:52,587 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 9 states. [2018-10-10 15:48:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:52,804 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-10 15:48:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:48:52,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-10-10 15:48:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:52,807 INFO L225 Difference]: With dead ends: 108 [2018-10-10 15:48:52,807 INFO L226 Difference]: Without dead ends: 108 [2018-10-10 15:48:52,808 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-10 15:48:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-10 15:48:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-10 15:48:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-10 15:48:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-10 15:48:52,819 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-10 15:48:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:52,820 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-10 15:48:52,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:48:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-10 15:48:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 15:48:52,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:52,822 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:52,822 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:52,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:52,823 INFO L82 PathProgramCache]: Analyzing trace with hash -213685301, now seen corresponding path program 6 times [2018-10-10 15:48:52,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:53,060 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-10 15:48:53,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:53,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:48:53,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:48:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:48:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:48:53,062 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 10 states. [2018-10-10 15:48:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:53,295 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-10 15:48:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:48:53,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2018-10-10 15:48:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:53,297 INFO L225 Difference]: With dead ends: 111 [2018-10-10 15:48:53,297 INFO L226 Difference]: Without dead ends: 111 [2018-10-10 15:48:53,298 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-10 15:48:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-10 15:48:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-10 15:48:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-10 15:48:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-10 15:48:53,304 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-10 15:48:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:53,304 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-10 15:48:53,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:48:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-10 15:48:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 15:48:53,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:53,306 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:53,307 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:53,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2123155534, now seen corresponding path program 7 times [2018-10-10 15:48:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:53,590 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-10 15:48:53,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:53,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:48:53,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:48:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:48:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:48:53,592 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 11 states. [2018-10-10 15:48:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:53,822 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-10 15:48:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:48:53,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-10-10 15:48:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:53,825 INFO L225 Difference]: With dead ends: 114 [2018-10-10 15:48:53,825 INFO L226 Difference]: Without dead ends: 114 [2018-10-10 15:48:53,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:48:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-10 15:48:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-10 15:48:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 15:48:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-10 15:48:53,831 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-10 15:48:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:53,832 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-10 15:48:53,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:48:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-10 15:48:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 15:48:53,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:53,834 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:53,834 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:53,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash -309031317, now seen corresponding path program 8 times [2018-10-10 15:48:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:54,173 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-10 15:48:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:48:54,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:48:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:48:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:48:54,175 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 12 states. [2018-10-10 15:48:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:54,559 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-10 15:48:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:48:54,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-10-10 15:48:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:54,562 INFO L225 Difference]: With dead ends: 117 [2018-10-10 15:48:54,562 INFO L226 Difference]: Without dead ends: 117 [2018-10-10 15:48:54,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:48:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-10 15:48:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-10 15:48:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 15:48:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-10 15:48:54,568 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-10 15:48:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:54,568 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-10 15:48:54,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:48:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-10 15:48:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 15:48:54,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:54,570 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:54,571 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:54,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 692031762, now seen corresponding path program 9 times [2018-10-10 15:48:54,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:54,846 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-10 15:48:54,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:54,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:48:54,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:48:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:48:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:48:54,848 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 13 states. [2018-10-10 15:48:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:55,301 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-10 15:48:55,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:48:55,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2018-10-10 15:48:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:55,302 INFO L225 Difference]: With dead ends: 118 [2018-10-10 15:48:55,302 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 15:48:55,303 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-10 15:48:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 15:48:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-10-10 15:48:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 15:48:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-10 15:48:55,305 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-10 15:48:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:55,306 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-10 15:48:55,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:48:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-10 15:48:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 15:48:55,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:55,307 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:55,307 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:55,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:55,308 INFO L82 PathProgramCache]: Analyzing trace with hash -890685173, now seen corresponding path program 10 times [2018-10-10 15:48:55,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:56,045 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-10 15:48:56,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:48:56,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:48:56,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:48:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:48:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:48:56,047 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 8 states. [2018-10-10 15:48:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:56,407 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-10 15:48:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:48:56,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2018-10-10 15:48:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:56,414 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:48:56,414 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:48:56,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:48:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:48:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:48:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:48:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:48:56,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-10-10 15:48:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:56,416 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:48:56,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:48:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:48:56,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:48:56,422 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:48:56 BoogieIcfgContainer [2018-10-10 15:48:56,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:48:56,423 INFO L168 Benchmark]: Toolchain (without parser) took 7867.16 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 26.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 7.1 GB. [2018-10-10 15:48:56,426 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-10 15:48:56,428 INFO L168 Benchmark]: Boogie Preprocessor took 64.89 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-10 15:48:56,428 INFO L168 Benchmark]: RCFGBuilder took 705.21 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-10 15:48:56,429 INFO L168 Benchmark]: TraceAbstraction took 7093.11 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -4.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-10-10 15:48:56,437 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.23 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 64.89 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 705.21 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 7093.11 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -4.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: 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, 92 locations, 1 error locations. SAFE Result, 7.0s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 895 SDtfs, 583 SDslu, 4451 SDs, 0 SdLazy, 675 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1122 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1111 ConstructedInterpolants, 0 QuantifiedInterpolants, 251973 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.1_true-valid-memsafety_true-termination.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-48-56-457.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-48-56-457.csv Received shutdown request...