java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/relax_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:38:00,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:38:00,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:38:00,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:38:00,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:38:00,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:38:00,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:38:00,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:38:00,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:38:00,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:38:00,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:38:00,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:38:00,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:38:00,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:38:00,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:38:00,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:38:00,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:38:00,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:38:00,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:38:00,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:38:00,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:38:00,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:38:00,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:38:00,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:38:00,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:38:00,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:38:00,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:38:00,501 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:38:00,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:38:00,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:38:00,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:38:00,503 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 23:38:00,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:38:00,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:38:00,512 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:38:00,513 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:38:00,513 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:38:00,513 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:38:00,513 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:38:00,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:38:00,514 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:38:00,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:38:00,515 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:38:00,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:38:00,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:38:00,516 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:38:00,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:38:00,516 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:38:00,517 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:38:00,517 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:38:00,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:38:00,517 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:38:00,518 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:38:00,518 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:38:00,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:38:00,561 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:38:00,565 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:38:00,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:38:00,566 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:38:00,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax_false-valid-deref.i [2018-01-28 23:38:00,741 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:38:00,746 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:38:00,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:38:00,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:38:00,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:38:00,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:00,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a02deed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00, skipping insertion in model container [2018-01-28 23:38:00,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:00,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:38:00,806 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:38:00,928 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:38:00,954 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:38:00,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00 WrapperNode [2018-01-28 23:38:00,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:38:00,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:38:00,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:38:00,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:38:00,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:00,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:00,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:00,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:00,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:01,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:01,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... [2018-01-28 23:38:01,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:38:01,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:38:01,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:38:01,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:38:01,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (1/1) ... No working directory specified, using /storage/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-01-28 23:38:01,060 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:38:01,060 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:38:01,060 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-28 23:38:01,060 INFO L136 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2018-01-28 23:38:01,061 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:38:01,061 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:38:01,061 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:38:01,061 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:38:01,061 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:38:01,061 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:38:01,062 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-28 23:38:01,062 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2018-01-28 23:38:01,062 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-28 23:38:01,062 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-28 23:38:01,062 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 23:38:01,062 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 23:38:01,063 INFO L128 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2018-01-28 23:38:01,063 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:38:01,063 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:38:01,063 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:38:01,525 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:38:01,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:38:01 BoogieIcfgContainer [2018-01-28 23:38:01,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:38:01,547 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:38:01,547 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:38:01,548 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:38:01,550 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:38:01" (1/1) ... [2018-01-28 23:38:01,557 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:38:01,557 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:38:01,558 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:38:01,650 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:38:01,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:38:16,416 INFO L311 AbstractInterpreter]: Visited 161 different actions 749 times. Merged at 102 different actions 363 times. Widened at 1 different actions 1 times. Found 95 fixpoints after 40 different actions. Largest state had 44 variables. [2018-01-28 23:38:16,418 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:38:16,433 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 10 [2018-01-28 23:38:16,433 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:38:16,433 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:38:16,434 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_3| v_main_~pat~11.base_3) (+ (* 4 v_main_~i~13_5) v_main_~pat~11.offset_3)), at (SUMMARY for call #t~mem11 := read~int(~pat~11.base, ~pat~11.offset + ~i~13 * 4, 4); srcloc: L596)) ((select (select |v_#memory_int_2| v_is_relaxed_prefix_~a.base_2) (+ (* (- 4) v_is_relaxed_prefix_~shift~8_2) (* 4 v_is_relaxed_prefix_~i~9_6) v_is_relaxed_prefix_~a.offset_2)), at (SUMMARY for call #t~mem3 := read~int(~a.base, ~a.offset + (~i~9 - ~shift~8) * 4, 4); srcloc: L569')) ((select (select |v_#memory_int_4| v_main_~a~11.base_3) (+ v_main_~a~11.offset_3 (* 4 v_main_~i~13_7))), at (SUMMARY for call #t~mem12 := read~int(~a~11.base, ~a~11.offset + ~i~13 * 4, 4); srcloc: L596')) ((select (select |v_#memory_int_9| v_main_~pat~11.base_12) (+ (* 4 v_main_~i~15_4) v_main_~pat~11.offset_9)), at (SUMMARY for call #t~mem18 := read~int(~pat~11.base, ~pat~11.offset + ~i~15 * 4, 4); srcloc: L608)) ((select (select |v_#memory_int_1| v_is_relaxed_prefix_~pat.base_2) (+ (* 4 v_is_relaxed_prefix_~i~9_4) v_is_relaxed_prefix_~pat.offset_2)), at (SUMMARY for call #t~mem2 := read~int(~pat.base, ~pat.offset + ~i~9 * 4, 4); srcloc: L569)) ((select (select |v_#memory_int_10| v_main_~a~11.base_12) (+ v_main_~a~11.offset_9 (* 4 (let ((.cse0 (mod (+ (* 4294967295 v_main_~differences~14_2) v_main_~i~15_6) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))))), at (SUMMARY for call #t~mem19 := read~int(~a~11.base, ~a~11.offset + (if (~i~15 - ~differences~14) % 4294967296 % 4294967296 <= 2147483647 then (~i~15 - ~differences~14) % 4294967296 % 4294967296 else (~i~15 - ~differences~14) % 4294967296 % 4294967296 - 4294967296) * 4, 4); srcloc: L608')) ((select (select |v_#memory_int_5| v_main_~pat~11.base_6) (+ (* 4 v_main_~i~13_11) v_main_~pat~11.offset_5)), at (SUMMARY for call #t~mem13 := read~int(~pat~11.base, ~pat~11.offset + ~i~13 * 4, 4); srcloc: L598)) ((select (select |v_#memory_int_6| v_main_~a~11.base_6) (+ v_main_~a~11.offset_5 (* 4 v_main_~i~13_13))), at (SUMMARY for call #t~mem14 := read~int(~a~11.base, ~a~11.offset + ~i~13 * 4, 4); srcloc: L598')) ((select (select |v_#memory_int_7| v_main_~pat~11.base_9) (+ (* 4 v_main_~i~13_17) v_main_~pat~11.offset_7)), at (SUMMARY for call #t~mem15 := read~int(~pat~11.base, ~pat~11.offset + ~i~13 * 4, 4); srcloc: L600)) ((select (select |v_#memory_int_8| v_main_~a~11.base_9) (+ v_main_~a~11.offset_7 (* 4 v_main_~i~13_19) (- 4))), at (SUMMARY for call #t~mem16 := read~int(~a~11.base, ~a~11.offset + (~i~13 - 1) * 4, 4); srcloc: L600')) [2018-01-28 23:38:16,437 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:38:16,437 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:38:16,437 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:38:16,438 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:38:16,438 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:38:16,438 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:38:16,438 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:38:16,438 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:38:16,439 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:38:16,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:38:16 BasicIcfg [2018-01-28 23:38:16,456 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:38:16,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:38:16,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:38:16,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:38:16,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:38:00" (1/4) ... [2018-01-28 23:38:16,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33317608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:38:16, skipping insertion in model container [2018-01-28 23:38:16,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:38:00" (2/4) ... [2018-01-28 23:38:16,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33317608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:38:16, skipping insertion in model container [2018-01-28 23:38:16,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:38:01" (3/4) ... [2018-01-28 23:38:16,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33317608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:38:16, skipping insertion in model container [2018-01-28 23:38:16,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:38:16" (4/4) ... [2018-01-28 23:38:16,463 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:38:16,469 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:38:16,476 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-28 23:38:16,509 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:38:16,509 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:38:16,509 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:38:16,509 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:38:16,510 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:38:16,510 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:38:16,510 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:38:16,510 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:38:16,510 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:38:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-01-28 23:38:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:38:16,527 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:16,528 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:16,529 INFO L371 AbstractCegarLoop]: === Iteration 1 === [is_relaxed_prefixErr3RequiresViolation, is_relaxed_prefixErr0RequiresViolation, is_relaxed_prefixErr2RequiresViolation, is_relaxed_prefixErr1RequiresViolation, mainErr13RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr20EnsuresViolation, mainErr9RequiresViolation, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr16RequiresViolation, mainErr15RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, mainErr19RequiresViolation]=== [2018-01-28 23:38:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1500431398, now seen corresponding path program 1 times [2018-01-28 23:38:16,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:16,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:16,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:16,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:16,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:16,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:16,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:16,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:16,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:38:16,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:38:16,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:38:16,828 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-01-28 23:38:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:16,925 INFO L93 Difference]: Finished difference Result 227 states and 275 transitions. [2018-01-28 23:38:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:38:16,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:38:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:16,941 INFO L225 Difference]: With dead ends: 227 [2018-01-28 23:38:16,942 INFO L226 Difference]: Without dead ends: 130 [2018-01-28 23:38:16,946 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-28 23:38:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-01-28 23:38:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-28 23:38:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2018-01-28 23:38:16,999 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 15 [2018-01-28 23:38:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:17,000 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2018-01-28 23:38:17,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:38:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2018-01-28 23:38:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:38:17,001 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:17,001 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:17,001 INFO L371 AbstractCegarLoop]: === Iteration 2 === [is_relaxed_prefixErr3RequiresViolation, is_relaxed_prefixErr0RequiresViolation, is_relaxed_prefixErr2RequiresViolation, is_relaxed_prefixErr1RequiresViolation, mainErr13RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr20EnsuresViolation, mainErr9RequiresViolation, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr16RequiresViolation, mainErr15RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, mainErr19RequiresViolation]=== [2018-01-28 23:38:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1500431400, now seen corresponding path program 1 times [2018-01-28 23:38:17,002 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:17,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:17,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:17,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:17,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:17,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:17,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:17,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:38:17,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:38:17,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:38:17,098 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand 4 states. [2018-01-28 23:38:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:17,232 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2018-01-28 23:38:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:38:17,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:38:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:17,234 INFO L225 Difference]: With dead ends: 130 [2018-01-28 23:38:17,234 INFO L226 Difference]: Without dead ends: 125 [2018-01-28 23:38:17,235 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-28 23:38:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-28 23:38:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-28 23:38:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-01-28 23:38:17,248 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 15 [2018-01-28 23:38:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:17,248 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-01-28 23:38:17,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:38:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-01-28 23:38:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:38:17,249 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:17,249 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:17,250 INFO L371 AbstractCegarLoop]: === Iteration 3 === [is_relaxed_prefixErr3RequiresViolation, is_relaxed_prefixErr0RequiresViolation, is_relaxed_prefixErr2RequiresViolation, is_relaxed_prefixErr1RequiresViolation, mainErr13RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr20EnsuresViolation, mainErr9RequiresViolation, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr16RequiresViolation, mainErr15RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, mainErr19RequiresViolation]=== [2018-01-28 23:38:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -731266253, now seen corresponding path program 1 times [2018-01-28 23:38:17,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:17,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:17,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:17,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:17,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:17,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:17,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:17,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:38:17,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:38:17,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:38:17,298 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 4 states. [2018-01-28 23:38:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:17,351 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2018-01-28 23:38:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:38:17,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:38:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:17,353 INFO L225 Difference]: With dead ends: 125 [2018-01-28 23:38:17,353 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 23:38:17,353 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 23:38:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-28 23:38:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-28 23:38:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2018-01-28 23:38:17,363 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 16 [2018-01-28 23:38:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:17,363 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2018-01-28 23:38:17,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:38:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2018-01-28 23:38:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:38:17,364 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:17,364 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:17,365 INFO L371 AbstractCegarLoop]: === Iteration 4 === [is_relaxed_prefixErr3RequiresViolation, is_relaxed_prefixErr0RequiresViolation, is_relaxed_prefixErr2RequiresViolation, is_relaxed_prefixErr1RequiresViolation, mainErr13RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr20EnsuresViolation, mainErr9RequiresViolation, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr16RequiresViolation, mainErr15RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, mainErr19RequiresViolation]=== [2018-01-28 23:38:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash -731266251, now seen corresponding path program 1 times [2018-01-28 23:38:17,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:17,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:17,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:17,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:17,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:17,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:17,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:38:17,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:38:17,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:38:17,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:38:17,498 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand 7 states. [2018-01-28 23:38:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:17,718 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-01-28 23:38:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:38:17,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-28 23:38:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:17,720 INFO L225 Difference]: With dead ends: 124 [2018-01-28 23:38:17,721 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 23:38:17,721 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-28 23:38:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 23:38:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-28 23:38:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-28 23:38:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2018-01-28 23:38:17,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 16 [2018-01-28 23:38:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:17,736 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2018-01-28 23:38:17,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:38:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-01-28 23:38:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 23:38:17,737 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:17,737 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:17,737 INFO L371 AbstractCegarLoop]: === Iteration 5 === [is_relaxed_prefixErr3RequiresViolation, is_relaxed_prefixErr0RequiresViolation, is_relaxed_prefixErr2RequiresViolation, is_relaxed_prefixErr1RequiresViolation, mainErr13RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr20EnsuresViolation, mainErr9RequiresViolation, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr16RequiresViolation, mainErr15RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, mainErr19RequiresViolation]=== [2018-01-28 23:38:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1627789413, now seen corresponding path program 1 times [2018-01-28 23:38:17,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:17,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:17,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:17,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:17,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:17,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:17,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 23:38:17,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:38:17,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:38:17,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:38:17,924 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 8 states. [2018-01-28 23:38:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:18,248 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2018-01-28 23:38:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 23:38:18,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-28 23:38:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:18,249 INFO L225 Difference]: With dead ends: 119 [2018-01-28 23:38:18,249 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 23:38:18,250 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-28 23:38:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 23:38:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-28 23:38:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 23:38:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2018-01-28 23:38:18,258 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 18 [2018-01-28 23:38:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:18,258 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2018-01-28 23:38:18,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:38:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2018-01-28 23:38:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 23:38:18,259 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:18,260 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:18,260 INFO L371 AbstractCegarLoop]: === Iteration 6 === [is_relaxed_prefixErr3RequiresViolation, is_relaxed_prefixErr0RequiresViolation, is_relaxed_prefixErr2RequiresViolation, is_relaxed_prefixErr1RequiresViolation, mainErr13RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr20EnsuresViolation, mainErr9RequiresViolation, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr16RequiresViolation, mainErr15RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, mainErr19RequiresViolation]=== [2018-01-28 23:38:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1137303984, now seen corresponding path program 1 times [2018-01-28 23:38:18,260 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:18,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:18,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:18,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:18,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:38:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:38:18,329 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:38:18,332 INFO L84 mationBacktranslator]: Skipped ATE [645] [645] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_35|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:38:18,332 INFO L84 mationBacktranslator]: Skipped ATE [651] [651] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:38:18,332 INFO L84 mationBacktranslator]: Skipped ATE [657] [657] mainENTRY-->L584: Formula: (= v_main_~pat_len~11_1 |v_main_#t~nondet4_1|) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|, main_~pat_len~11=v_main_~pat_len~11_1} AuxVars[] AssignedVars[main_~pat_len~11] [2018-01-28 23:38:18,332 INFO L84 mationBacktranslator]: Skipped ATE [661] [661] L584-->L584': Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_2|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [665] [665] L584'-->L584'': Formula: (= v_main_~a_len~11_1 |v_main_#t~nondet5_1|) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~a_len~11=v_main_~a_len~11_1} AuxVars[] AssignedVars[main_~a_len~11] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [667] [667] L584''-->L585: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_2|} AuxVars[] AssignedVars[main_#t~nondet5] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [669] [669] L585-->L585': Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_#length_5| (store |v_#length_6| |v_main_#t~malloc6.base_1| (let ((.cse0 (mod (* 4 v_main_~pat_len~11_2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) (= 0 (select |v_#valid_6| |v_main_#t~malloc6.base_1|)) (= |v_main_#t~malloc6.offset_1| 0) (= |v_#valid_5| (store |v_#valid_6| |v_main_#t~malloc6.base_1| 1))) InVars {#length=|v_#length_6|, main_~pat_len~11=v_main_~pat_len~11_2, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~pat_len~11=v_main_~pat_len~11_2, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [671] [671] L585'-->L586: Formula: (and (= v_main_~pat~11.base_1 |v_main_#t~malloc6.base_2|) (= v_main_~pat~11.offset_1 |v_main_#t~malloc6.offset_2|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|} OutVars{main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, main_~pat~11.offset=v_main_~pat~11.offset_1, main_~pat~11.base=v_main_~pat~11.base_1, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|} AuxVars[] AssignedVars[main_~pat~11.base, main_~pat~11.offset] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [673] [673] L586-->L586': Formula: (and (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc7.base_1| (let ((.cse0 (mod (* 4 v_main_~a_len~11_2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) (not (= |v_main_#t~malloc7.base_1| 0)) (= |v_main_#t~malloc7.offset_1| 0) (= 0 (select |v_#valid_8| |v_main_#t~malloc7.base_1|)) (= (store |v_#valid_8| |v_main_#t~malloc7.base_1| 1) |v_#valid_7|)) InVars {#length=|v_#length_8|, main_~a_len~11=v_main_~a_len~11_2, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, main_~a_len~11=v_main_~a_len~11_2, #valid=|v_#valid_7|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [675] [675] L586'-->L587: Formula: (and (= v_main_~a~11.base_1 |v_main_#t~malloc7.base_2|) (= v_main_~a~11.offset_1 |v_main_#t~malloc7.offset_2|)) InVars {main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|} OutVars{main_~a~11.offset=v_main_~a~11.offset_1, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_~a~11.base=v_main_~a~11.base_1} AuxVars[] AssignedVars[main_~a~11.offset, main_~a~11.base] [2018-01-28 23:38:18,333 INFO L84 mationBacktranslator]: Skipped ATE [677] [677] L587-->L587': Formula: true InVars {} OutVars{main_#t~ret8=|v_main_#t~ret8_1|} AuxVars[] AssignedVars[main_#t~ret8] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [683] [683] L587'-->L587''': Formula: (= (mod |v_main_#t~ret8_4| 256) 0) InVars {main_#t~ret8=|v_main_#t~ret8_4|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [689] [689] L587'''-->L603: Formula: true InVars {} OutVars{main_#t~ret8=|v_main_#t~ret8_5|} AuxVars[] AssignedVars[main_#t~ret8] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [697] [697] L603-->L605: Formula: (<= (mod v_main_~pat_len~11_10 4294967296) (mod (+ v_main_~a_len~11_9 1) 4294967296)) InVars {main_~a_len~11=v_main_~a_len~11_9, main_~pat_len~11=v_main_~pat_len~11_10} OutVars{main_~a_len~11=v_main_~a_len~11_9, main_~pat_len~11=v_main_~pat_len~11_10} AuxVars[] AssignedVars[] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [707] [707] L605-->L606: Formula: (= v_main_~differences~14_1 0) InVars {} OutVars{main_~differences~14=v_main_~differences~14_1} AuxVars[] AssignedVars[main_~differences~14] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [723] [723] L606-->L606'''''': Formula: (= v_main_~i~15_1 0) InVars {} OutVars{main_~i~15=v_main_~i~15_1} AuxVars[] AssignedVars[main_~i~15] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [743] [743] L606''''''-->L606': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:38:18,334 INFO L84 mationBacktranslator]: Skipped ATE [759] [759] L606'-->L608: Formula: (let ((.cse0 (mod v_main_~i~15_3 4294967296))) (and (< .cse0 (mod v_main_~a_len~11_11 4294967296)) (< .cse0 (mod v_main_~pat_len~11_12 4294967296)))) InVars {main_~i~15=v_main_~i~15_3, main_~pat_len~11=v_main_~pat_len~11_12, main_~a_len~11=v_main_~a_len~11_11} OutVars{main_~i~15=v_main_~i~15_3, main_~pat_len~11=v_main_~pat_len~11_12, main_~a_len~11=v_main_~a_len~11_11} AuxVars[] AssignedVars[] [2018-01-28 23:38:18,335 INFO L84 mationBacktranslator]: Skipped ATE [783] [783] L608-->mainErr13RequiresViolation: Formula: (let ((.cse0 (* 4 v_main_~i~15_5))) (or (not (<= 0 (+ v_main_~pat~11.offset_10 .cse0))) (not (<= (+ v_main_~pat~11.offset_10 .cse0 4) (select |v_#length_22| v_main_~pat~11.base_14))))) InVars {main_~i~15=v_main_~i~15_5, #length=|v_#length_22|, main_~pat~11.offset=v_main_~pat~11.offset_10, main_~pat~11.base=v_main_~pat~11.base_14} OutVars{main_~i~15=v_main_~i~15_5, #length=|v_#length_22|, main_~pat~11.offset=v_main_~pat~11.offset_10, main_~pat~11.base=v_main_~pat~11.base_14} AuxVars[] AssignedVars[] [2018-01-28 23:38:18,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:38:18 BasicIcfg [2018-01-28 23:38:18,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:38:18,342 INFO L168 Benchmark]: Toolchain (without parser) took 17600.44 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 266.1 MB in the beginning and 569.5 MB in the end (delta: -303.4 MB). Peak memory consumption was 998.4 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:18,342 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.2 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:38:18,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.96 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 254.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:18,343 INFO L168 Benchmark]: Boogie Preprocessor took 38.27 ms. Allocated memory is still 306.2 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:18,343 INFO L168 Benchmark]: RCFGBuilder took 542.14 ms. Allocated memory is still 306.2 MB. Free memory was 252.1 MB in the beginning and 220.1 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:18,343 INFO L168 Benchmark]: IcfgTransformer took 14909.26 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 220.1 MB in the beginning and 780.1 MB in the end (delta: -560.0 MB). Peak memory consumption was 741.8 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:18,343 INFO L168 Benchmark]: TraceAbstraction took 1884.05 ms. Allocated memory is still 1.6 GB. Free memory was 780.1 MB in the beginning and 569.5 MB in the end (delta: 210.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:18,345 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 306.2 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.96 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 254.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.27 ms. Allocated memory is still 306.2 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 542.14 ms. Allocated memory is still 306.2 MB. Free memory was 252.1 MB in the beginning and 220.1 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 14909.26 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 220.1 MB in the beginning and 780.1 MB in the end (delta: -560.0 MB). Peak memory consumption was 741.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1884.05 ms. Allocated memory is still 1.6 GB. Free memory was 780.1 MB in the beginning and 569.5 MB in the end (delta: 210.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 120 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 1526 LocStat_NO_SUPPORTING_DISEQUALITIES : 557 LocStat_NO_DISJUNCTIONS : -240 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 175 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 175 TransStat_NO_SUPPORTING_DISEQUALITIES : 33 TransStat_NO_DISJUNCTIONS : 191 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.965860 RENAME_VARIABLES(MILLISECONDS) : 0.009197 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.671289 PROJECTAWAY(MILLISECONDS) : 0.602081 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.083558 DISJOIN(MILLISECONDS) : 0.223834 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.018500 ADD_EQUALITY(MILLISECONDS) : 0.018381 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006102 #CONJOIN_DISJUNCTIVE : 1151 #RENAME_VARIABLES : 2532 #UNFREEZE : 0 #CONJOIN : 1577 #PROJECTAWAY : 1462 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 232 #RENAME_VARIABLES_DISJUNCTIVE : 2412 #ADD_EQUALITY : 159 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 29 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 135 locations, 25 error locations. UNSAFE Result, 1.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 635 SDtfs, 985 SDslu, 817 SDs, 0 SdLazy, 530 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 7059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-28_23-38-18-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-28_23-38-18-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-28_23-38-18-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-28_23-38-18-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_23-38-18-353.csv Received shutdown request...