java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e4dfe74 [2018-12-18 18:10:34,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 18:10:34,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 18:10:34,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 18:10:34,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 18:10:34,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 18:10:34,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 18:10:34,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 18:10:34,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 18:10:34,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 18:10:34,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 18:10:34,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 18:10:34,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 18:10:34,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 18:10:34,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 18:10:34,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 18:10:34,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 18:10:34,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 18:10:34,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 18:10:34,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 18:10:34,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 18:10:34,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 18:10:34,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 18:10:34,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 18:10:34,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 18:10:34,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 18:10:34,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 18:10:34,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 18:10:34,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 18:10:34,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 18:10:34,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 18:10:34,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 18:10:34,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 18:10:34,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 18:10:34,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 18:10:34,789 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 18:10:34,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-18 18:10:34,810 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 18:10:34,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 18:10:34,811 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 18:10:34,811 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 18:10:34,811 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 18:10:34,814 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 18:10:34,815 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 18:10:34,815 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 18:10:34,815 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-18 18:10:34,815 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-18 18:10:34,816 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 18:10:34,816 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 18:10:34,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 18:10:34,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 18:10:34,818 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 18:10:34,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 18:10:34,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 18:10:34,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 18:10:34,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 18:10:34,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 18:10:34,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 18:10:34,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 18:10:34,819 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 18:10:34,821 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 18:10:34,821 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 18:10:34,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 18:10:34,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 18:10:34,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 18:10:34,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 18:10:34,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 18:10:34,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 18:10:34,823 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 18:10:34,823 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 18:10:34,823 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 18:10:34,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 18:10:34,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 18:10:34,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 18:10:34,824 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 18:10:34,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 18:10:34,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 18:10:34,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 18:10:34,900 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 18:10:34,901 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 18:10:34,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2018-12-18 18:10:34,903 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2018-12-18 18:10:34,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 18:10:34,970 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 18:10:34,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 18:10:34,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 18:10:34,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 18:10:34,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 18:10:35,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 18:10:35,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 18:10:35,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 18:10:35,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/1) ... [2018-12-18 18:10:35,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 18:10:35,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 18:10:35,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 18:10:35,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 18:10:35,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 18:10:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-18 18:10:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 18:10:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 18:10:35,868 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 18:10:35,868 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-18 18:10:35,868 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:10:35 BoogieIcfgContainer [2018-12-18 18:10:35,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 18:10:35,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 18:10:35,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 18:10:35,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 18:10:35,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 06:10:34" (1/2) ... [2018-12-18 18:10:35,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b13a49 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:10:35, skipping insertion in model container [2018-12-18 18:10:35,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:10:35" (2/2) ... [2018-12-18 18:10:35,877 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2018-12-18 18:10:35,887 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 18:10:35,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-18 18:10:35,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-18 18:10:35,950 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 18:10:35,950 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 18:10:35,950 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 18:10:35,950 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 18:10:35,950 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 18:10:35,951 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 18:10:35,951 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 18:10:35,951 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 18:10:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-18 18:10:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 18:10:35,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 18:10:35,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 18:10:35,978 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2018-12-18 18:10:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 18:10:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2018-12-18 18:10:35,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 18:10:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 18:10:36,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 18:10:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 18:10:36,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 18:10:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 18:10:36,277 INFO L273 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;call main_p1 := malloc();call main_p2 := malloc();call main_p3 := malloc();call main_p4 := malloc();call main_p5 := malloc();call main_p6 := malloc();call main_p7 := malloc();assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 18:10:36,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {21#false} is VALID [2018-12-18 18:10:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 18:10:36,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 18:10:36,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 18:10:36,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 18:10:36,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 18:10:36,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 18:10:36,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 18:10:36,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 18:10:36,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 18:10:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 18:10:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 18:10:36,358 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-18 18:10:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 18:10:36,818 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-12-18 18:10:36,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 18:10:36,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 18:10:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 18:10:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 18:10:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-18 18:10:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 18:10:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-18 18:10:36,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-12-18 18:10:37,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 18:10:37,044 INFO L225 Difference]: With dead ends: 33 [2018-12-18 18:10:37,045 INFO L226 Difference]: Without dead ends: 28 [2018-12-18 18:10:37,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 18:10:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-18 18:10:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-18 18:10:37,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 18:10:37,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2018-12-18 18:10:37,134 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2018-12-18 18:10:37,135 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2018-12-18 18:10:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 18:10:37,145 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 18:10:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-18 18:10:37,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 18:10:37,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 18:10:37,147 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2018-12-18 18:10:37,147 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2018-12-18 18:10:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 18:10:37,152 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 18:10:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-18 18:10:37,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 18:10:37,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 18:10:37,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 18:10:37,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 18:10:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 18:10:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-18 18:10:37,171 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2018-12-18 18:10:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 18:10:37,172 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-18 18:10:37,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 18:10:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-18 18:10:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 18:10:37,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 18:10:37,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 18:10:37,174 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2018-12-18 18:10:37,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 18:10:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2018-12-18 18:10:37,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 18:10:37,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 18:10:37,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 18:10:37,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 18:10:37,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 18:10:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 18:10:37,410 INFO L273 TraceCheckUtils]: 0: Hoare triple {134#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;call main_p1 := malloc();call main_p2 := malloc();call main_p3 := malloc();call main_p4 := malloc();call main_p5 := malloc();call main_p6 := malloc();call main_p7 := malloc();assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 18:10:37,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] <= 0; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 18:10:37,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] >= 0); {135#false} is VALID [2018-12-18 18:10:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 18:10:37,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 18:10:37,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 18:10:37,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 18:10:37,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 18:10:37,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 18:10:37,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 18:10:37,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 18:10:37,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 18:10:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 18:10:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 18:10:37,478 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2018-12-18 18:10:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 18:10:37,836 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 18:10:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 18:10:37,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 18:10:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 18:10:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 18:10:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-18 18:10:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 18:10:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-18 18:10:37,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-12-18 18:10:38,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 18:10:38,076 INFO L225 Difference]: With dead ends: 28 [2018-12-18 18:10:38,076 INFO L226 Difference]: Without dead ends: 27 [2018-12-18 18:10:38,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 18:10:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-18 18:10:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-18 18:10:38,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 18:10:38,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2018-12-18 18:10:38,089 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2018-12-18 18:10:38,089 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2018-12-18 18:10:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 18:10:38,092 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-18 18:10:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-18 18:10:38,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 18:10:38,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 18:10:38,093 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2018-12-18 18:10:38,094 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2018-12-18 18:10:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 18:10:38,097 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-18 18:10:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-18 18:10:38,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 18:10:38,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 18:10:38,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 18:10:38,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 18:10:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-18 18:10:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-12-18 18:10:38,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2018-12-18 18:10:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 18:10:38,101 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2018-12-18 18:10:38,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 18:10:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2018-12-18 18:10:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 18:10:38,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 18:10:38,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 18:10:38,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2018-12-18 18:10:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 18:10:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2018-12-18 18:10:38,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 18:10:38,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 18:10:38,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 18:10:38,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 18:10:38,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 18:10:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 18:10:38,322 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-18 18:10:38,339 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;call main_p1 := malloc();call main_p2 := malloc();call main_p3 := malloc();call main_p4 := malloc();call main_p5 := malloc();call main_p6 := malloc();call main_p7 := malloc();assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-18 18:10:38,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 18:10:38,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 18:10:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 18:10:38,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 18:10:38,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 18:10:38,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 18:10:38,361 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2018-12-18 18:10:38,418 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-18 18:10:38,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 18:10:38,453 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: Unknonwn type of statement: CallStatement[false,[VariableLHS[main_p1,]],malloc,[]] at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: Unknonwn type of statement: CallStatement[false,[VariableLHS[main_p1,]],malloc,[]] at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:51) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.handleInternalTransition(ArrayDomainPostOperator.java:124) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:74) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-12-18 18:10:38,457 INFO L168 Benchmark]: Toolchain (without parser) took 3488.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-12-18 18:10:38,458 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 18:10:38,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.94 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-12-18 18:10:38,459 INFO L168 Benchmark]: Boogie Preprocessor took 43.02 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-12-18 18:10:38,460 INFO L168 Benchmark]: RCFGBuilder took 778.63 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-12-18 18:10:38,460 INFO L168 Benchmark]: TraceAbstraction took 2585.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-12-18 18:10:38,464 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.94 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 43.02 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 778.63 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 2585.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: Unknonwn type of statement: CallStatement[false,[VariableLHS[main_p1,]],malloc,[]] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: Unknonwn type of statement: CallStatement[false,[VariableLHS[main_p1,]],malloc,[]]: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...