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/lis_unsafe_false-valid-deref.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:05:45,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:05:45,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:05:45,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:05:45,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:05:45,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:05:45,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:05:45,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:05:45,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:05:45,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:05:45,776 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:05:45,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:05:45,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:05:45,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:05:45,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:05:45,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:05:45,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:05:45,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:05:45,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:05:45,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:05:45,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:05:45,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:05:45,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:05:45,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:05:45,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:05:45,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:05:45,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:05:45,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:05:45,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:05:45,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:05:45,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:05:45,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:05:45,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:05:45,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:05:45,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:05:45,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:05:45,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:05:45,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:05:45,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:05:45,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:05:45,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:05:45,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:05:45,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:05:45,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:05:45,886 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:05:45,887 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:05:45,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/lis_unsafe_false-valid-deref.i_11.bpl [2019-08-05 11:05:45,889 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/lis_unsafe_false-valid-deref.i_11.bpl' [2019-08-05 11:05:45,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:05:45,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:05:45,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:45,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:05:45,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:05:45,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:45,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:45,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:45,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:05:45,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:05:45,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:05:45,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:45,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:45,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:45,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:46,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:46,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:46,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/1) ... [2019-08-05 11:05:46,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:05:46,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:05:46,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:05:46,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:05:46,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (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:05:46,097 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:05:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:05:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:05:46,523 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:05:46,524 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:05:46,525 INFO L202 PluginConnector]: Adding new model lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:46 BoogieIcfgContainer [2019-08-05 11:05:46,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:05:46,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:05:46,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:05:46,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:05:46,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:45" (1/2) ... [2019-08-05 11:05:46,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39917ea and model type lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:05:46, skipping insertion in model container [2019-08-05 11:05:46,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:46" (2/2) ... [2019-08-05 11:05:46,540 INFO L109 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i_11.bpl [2019-08-05 11:05:46,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:05:46,573 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:05:46,592 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:05:46,619 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:05:46,620 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:05:46,620 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:05:46,621 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:05:46,621 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:05:46,621 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:05:46,621 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:05:46,621 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:05:46,621 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:05:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:05:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:05:46,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:46,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:05:46,648 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 11:05:46,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:46,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:05:46,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:46,821 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:05:46,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:05:46,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:05:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:05:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:05:46,849 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:05:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:46,878 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:05:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:05:46,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:05:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:46,891 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:05:46,892 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:05:46,893 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:05:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:05:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:05:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:05:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:05:46,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:05:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:46,927 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:05:46,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:05:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:05:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:05:46,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:46,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:05:46,929 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:46,930 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 11:05:46,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:47,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:05:47,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:47,164 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:05:47,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:47,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:05:47,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:47,171 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:05:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:47,275 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:05:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:05:47,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:05:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:47,277 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:05:47,277 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:05:47,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:05:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:05:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:05:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:05:47,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:05:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:47,283 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:05:47,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:05:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:05:47,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:47,284 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:05:47,285 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 11:05:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:05:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:05:47,458 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:05:47,490 INFO L202 PluginConnector]: Adding new model lis_unsafe_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:05:47 BoogieIcfgContainer [2019-08-05 11:05:47,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:05:47,494 INFO L168 Benchmark]: Toolchain (without parser) took 1552.96 ms. Allocated memory was 140.0 MB in the beginning and 178.3 MB in the end (delta: 38.3 MB). Free memory was 109.1 MB in the beginning and 146.7 MB in the end (delta: -37.6 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:47,495 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:05:47,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 140.0 MB. Free memory was 109.1 MB in the beginning and 107.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:47,497 INFO L168 Benchmark]: Boogie Preprocessor took 45.65 ms. Allocated memory is still 140.0 MB. Free memory was 107.0 MB in the beginning and 106.1 MB in the end (delta: 900.4 kB). Peak memory consumption was 900.4 kB. Max. memory is 7.1 GB. [2019-08-05 11:05:47,498 INFO L168 Benchmark]: RCFGBuilder took 501.76 ms. Allocated memory is still 140.0 MB. Free memory was 105.7 MB in the beginning and 92.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:47,500 INFO L168 Benchmark]: TraceAbstraction took 963.73 ms. Allocated memory was 140.0 MB in the beginning and 178.3 MB in the end (delta: 38.3 MB). Free memory was 92.4 MB in the beginning and 146.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:47,505 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.23 ms. Allocated memory is still 140.0 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 140.0 MB. Free memory was 109.1 MB in the beginning and 107.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.65 ms. Allocated memory is still 140.0 MB. Free memory was 107.0 MB in the beginning and 106.1 MB in the end (delta: 900.4 kB). Peak memory consumption was 900.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 501.76 ms. Allocated memory is still 140.0 MB. Free memory was 105.7 MB in the beginning and 92.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 963.73 ms. Allocated memory was 140.0 MB in the beginning and 178.3 MB in the end (delta: 38.3 MB). Free memory was 92.4 MB in the beginning and 146.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 145]: assertion can be violated assertion can be violated We found a FailurePath: [L66] #NULL.offset, #NULL.base := 0, 0; [L67] #valid := #valid[0 := 0]; [L68] main_old_#valid := #valid; [L69] havoc main_#res; [L70] havoc main_#t~ret17, main_~a~0.offset, main_#t~nondet16, main_~N~0, main_~a~0.base; [L71] havoc main_~a~0.offset, main_~a~0.base; [L72] assume 0 <= main_#t~nondet16 + 2147483648 && main_#t~nondet16 <= 2147483647; [L73] main_~N~0 := main_#t~nondet16; [L74] havoc main_#t~nondet16; [L75] lis_#in~a.offset, lis_#in~N, lis_#in~a.base := main_~a~0.offset, main_~N~0, main_~a~0.base; [L76] havoc lis_#res; [L77] havoc lis_~best~0.base, lis_#t~malloc2.offset, lis_#t~post5, lis_~max~0, lis_#t~post6, lis_~a.base, lis_~best~0.offset, lis_#t~mem10, lis_~N, lis_~prev~0.base, lis_~prev~0.offset, lis_#t~mem7, lis_#t~mem9, lis_#t~short11, lis_#t~post13, lis_~j~0, lis_#t~mem8, lis_~a.offset, lis_#t~mem12, lis_#t~malloc3.base, lis_#t~mem14, lis_~i~0, lis_#t~mem15, lis_#t~post4, lis_#t~malloc2.base, lis_#t~malloc3.offset; [L78] lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset; [L79] lis_~N := lis_#in~N; [L80] havoc lis_~best~0.base, lis_~best~0.offset; [L81] havoc lis_~prev~0.base, lis_~prev~0.offset; [L82] havoc lis_~i~0; [L83] havoc lis_~j~0; [L84] lis_~max~0 := 0; [L85] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L86] #Ultimate.alloc_~size := 4 * lis_~N; [L87] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L88] havoc #valid, #length; [L89] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L90] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1] == #valid; [L91] assume #Ultimate.alloc_#res.offset == 0; [L92] assume !(0 == #Ultimate.alloc_#res.base); [L93] assume #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size] == #length; [L94] lis_#t~malloc2.offset, lis_#t~malloc2.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L95] lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset; [L96] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L97] #Ultimate.alloc_~size := 4 * lis_~N; [L98] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L99] havoc #valid, #length; [L100] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L101] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L102] assume #Ultimate.alloc_#res.offset == 0; [L103] assume !(0 == #Ultimate.alloc_#res.base); [L104] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L105] lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L106] lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset; [L107] lis_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, lis_#in~a.base=12, lis_#in~a.offset=-4, lis_#in~N=2, lis_#t~malloc2.base=11, lis_#t~malloc2.offset=0, lis_#t~malloc3.base=9, lis_#t~malloc3.offset=0, lis_~a.base=12, lis_~a.offset=-4, lis_~best~0.base=11, lis_~best~0.offset=0, lis_~i~0=0, lis_~max~0=0, lis_~N=2, lis_~prev~0.base=9, lis_~prev~0.offset=0, main_~a~0.base=12, main_~a~0.offset=-4, main_~N~0=2] [L123] assume lis_~i~0 < lis_~N; [L124] write~int_old_#memory_int := #memory_int; [L125] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, lis_~best~0.base, 1, 4 * lis_~i~0 + lis_~best~0.offset; [L126] assume #valid[write~int_#ptr.base] == 1; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] write~int_old_#memory_int := #memory_int; [L133] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, lis_~prev~0.base, lis_~i~0, 4 * lis_~i~0 + lis_~prev~0.offset; [L134] assume #valid[write~int_#ptr.base] == 1; [L135] assume 0 <= write~int_#ptr.offset && write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]; [L136] assume #valid[write~int_#ptr.base] == 1; [L137] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L138] havoc #memory_int; [L139] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L140] lis_#t~post4 := lis_~i~0; [L141] lis_~i~0 := lis_#t~post4 + 1; [L142] havoc lis_#t~post4; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, lis_#in~a.base=12, lis_#in~a.offset=-4, lis_#in~N=2, lis_#t~malloc2.base=11, lis_#t~malloc2.offset=0, lis_#t~malloc3.base=9, lis_#t~malloc3.offset=0, lis_~a.base=12, lis_~a.offset=-4, lis_~best~0.base=11, lis_~best~0.offset=0, lis_~i~0=1, lis_~max~0=0, lis_~N=2, lis_~prev~0.base=9, lis_~prev~0.offset=0, main_~a~0.base=12, main_~a~0.offset=-4, main_~N~0=2, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=0] [L123] assume lis_~i~0 < lis_~N; [L124] write~int_old_#memory_int := #memory_int; [L125] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, lis_~best~0.base, 1, 4 * lis_~i~0 + lis_~best~0.offset; [L126] assume #valid[write~int_#ptr.base] == 1; [L127] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L128] assume 1 == #valid[write~int_#ptr.base]; [L129] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L130] havoc #memory_int; [L131] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L132] write~int_old_#memory_int := #memory_int; [L133] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, lis_~prev~0.base, lis_~i~0, 4 * lis_~i~0 + lis_~prev~0.offset; [L134] assume #valid[write~int_#ptr.base] == 1; [L135] assume 0 <= write~int_#ptr.offset && write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]; [L136] assume #valid[write~int_#ptr.base] == 1; [L137] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L138] havoc #memory_int; [L139] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L140] lis_#t~post4 := lis_~i~0; [L141] lis_~i~0 := lis_#t~post4 + 1; [L142] havoc lis_#t~post4; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, lis_#in~a.base=12, lis_#in~a.offset=-4, lis_#in~N=2, lis_#t~malloc2.base=11, lis_#t~malloc2.offset=0, lis_#t~malloc3.base=9, lis_#t~malloc3.offset=0, lis_~a.base=12, lis_~a.offset=-4, lis_~best~0.base=11, lis_~best~0.offset=0, lis_~i~0=2, lis_~max~0=0, lis_~N=2, lis_~prev~0.base=9, lis_~prev~0.offset=0, main_~a~0.base=12, main_~a~0.offset=-4, main_~N~0=2, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1] [L114] assume !(lis_~i~0 < lis_~N); [L115] lis_~i~0 := 1; [L116] assume lis_~i~0 < lis_~N; [L117] lis_~j~0 := 0; [L118] assume lis_~j~0 < lis_~i~0; [L119] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4; [L120] assume !(1 == #valid[read~int_#ptr.base]); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, lis_#in~a.base=12, lis_#in~a.offset=-4, lis_#in~N=2, lis_#t~malloc2.base=11, lis_#t~malloc2.offset=0, lis_#t~malloc3.base=9, lis_#t~malloc3.offset=0, lis_~a.base=12, lis_~a.offset=-4, lis_~best~0.base=11, lis_~best~0.offset=0, lis_~i~0=1, lis_~j~0=0, lis_~max~0=0, lis_~N=2, lis_~prev~0.base=9, lis_~prev~0.offset=0, main_~a~0.base=12, main_~a~0.offset=-4, main_~N~0=2, read~int_#ptr.base=12, read~int_#ptr.offset=0, read~int_#sizeOfReadType=4, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1] [L145] assert false; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, lis_#in~a.base=12, lis_#in~a.offset=-4, lis_#in~N=2, lis_#t~malloc2.base=11, lis_#t~malloc2.offset=0, lis_#t~malloc3.base=9, lis_#t~malloc3.offset=0, lis_~a.base=12, lis_~a.offset=-4, lis_~best~0.base=11, lis_~best~0.offset=0, lis_~i~0=1, lis_~j~0=0, lis_~max~0=0, lis_~N=2, lis_~prev~0.base=9, lis_~prev~0.offset=0, main_~a~0.base=12, main_~a~0.offset=-4, main_~N~0=2, read~int_#ptr.base=12, read~int_#ptr.offset=0, read~int_#sizeOfReadType=4, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 7 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=2, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 4 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...