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/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:31:58,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:31:58,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:31:58,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:31:58,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:31:58,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:31:58,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:31:58,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:31:58,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:31:58,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:31:58,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:31:58,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:31:59,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:31:59,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:31:59,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:31:59,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:31:59,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:31:59,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:31:59,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:31:59,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:31:59,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:31:59,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:31:59,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:31:59,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:31:59,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:31:59,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:31:59,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:31:59,019 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:31:59,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:31:59,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:31:59,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:31:59,021 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_imprecise.epf [2018-01-24 16:31:59,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:31:59,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:31:59,033 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:31:59,033 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:31:59,033 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:31:59,033 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:31:59,033 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:31:59,034 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:31:59,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:31:59,035 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:31:59,035 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:31:59,035 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:31:59,035 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:31:59,035 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:31:59,036 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:31:59,036 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:31:59,036 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:31:59,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:31:59,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:31:59,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:31:59,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:31:59,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:31:59,037 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:31:59,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:31:59,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:31:59,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:31:59,038 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:31:59,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:31:59,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:31:59,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:31:59,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:31:59,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:31:59,039 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:31:59,040 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:31:59,040 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:31:59,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:31:59,093 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:31:59,097 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:31:59,099 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:31:59,100 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:31:59,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:31:59,323 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:31:59,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:31:59,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:31:59,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:31:59,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:31:59,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af4b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59, skipping insertion in model container [2018-01-24 16:31:59,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,362 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:31:59,408 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:31:59,539 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:31:59,564 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:31:59,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59 WrapperNode [2018-01-24 16:31:59,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:31:59,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:31:59,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:31:59,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:31:59,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (1/1) ... [2018-01-24 16:31:59,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:31:59,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:31:59,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:31:59,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:31:59,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:31:59" (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-24 16:31:59,679 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:31:59,679 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-01-24 16:31:59,680 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:31:59,680 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:31:59,680 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:31:59,681 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:31:59,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:31:59,683 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:32:00,600 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:32:00,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:32:00 BoogieIcfgContainer [2018-01-24 16:32:00,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:32:00,602 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:32:00,602 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:32:00,602 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:32:00,603 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:32:00" (1/1) ... [2018-01-24 16:32:00,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:32:27,602 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:32:27,629 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:32:27,722 INFO L268 AbstractInterpreter]: Visited 370 different actions 6195 times. Merged at 195 different actions 1581 times. Widened at 3 different actions 3 times. Found 251 fixpoints after 28 different actions. Largest state had 43 variables. [2018-01-24 16:32:27,725 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:32:27,726 INFO L168 Benchmark]: Toolchain (without parser) took 28402.09 ms. Allocated memory was 302.0 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 262.0 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 351.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:32:27,727 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:32:27,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.28 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 248.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:32:27,727 INFO L168 Benchmark]: Boogie Preprocessor took 51.80 ms. Allocated memory is still 302.0 MB. Free memory was 248.9 MB in the beginning and 246.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:32:27,728 INFO L168 Benchmark]: RCFGBuilder took 971.21 ms. Allocated memory was 302.0 MB in the beginning and 325.6 MB in the end (delta: 23.6 MB). Free memory was 245.9 MB in the beginning and 288.7 MB in the end (delta: -42.8 MB). Peak memory consumption was 73.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:32:27,728 INFO L168 Benchmark]: Abstract Interpretation took 27122.68 ms. Allocated memory was 325.6 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 287.1 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 353.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:32:27,730 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.28 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 248.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.80 ms. Allocated memory is still 302.0 MB. Free memory was 248.9 MB in the beginning and 246.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 971.21 ms. Allocated memory was 302.0 MB in the beginning and 325.6 MB in the end (delta: 23.6 MB). Free memory was 245.9 MB in the beginning and 288.7 MB in the end (delta: -42.8 MB). Peak memory consumption was 73.4 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 27122.68 ms. Allocated memory was 325.6 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 287.1 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 353.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 271 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 2778 LocStat_NO_SUPPORTING_DISEQUALITIES : 551 LocStat_NO_DISJUNCTIONS : -542 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 386 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 528 TransStat_NO_SUPPORTING_DISEQUALITIES : 156 TransStat_NO_DISJUNCTIONS : 442 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.714611 RENAME_VARIABLES(MILLISECONDS) : 0.002044 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.464831 PROJECTAWAY(MILLISECONDS) : 1.691042 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.003379 DISJOIN(MILLISECONDS) : 0.712487 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.007864 ADD_EQUALITY(MILLISECONDS) : 0.011914 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003821 #CONJOIN_DISJUNCTIVE : 10968 #RENAME_VARIABLES : 25763 #UNFREEZE : 0 #CONJOIN : 15774 #PROJECTAWAY : 13414 #ADD_WEAK_EQUALITY : 127 #DISJOIN : 5551 #RENAME_VARIABLES_DISJUNCTIVE : 23170 #ADD_EQUALITY : 569 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 126 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] FCALL shape->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] FCALL shape->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] FCALL shape->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] EXPR, FCALL shape->next [L607] COND FALSE !(!(shape->next)) [L607] COND FALSE !(0) [L608] FCALL shape->slist - UnprovableResult [Line: 625]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND TRUE !data [L642] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] FCALL shape->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] EXPR, FCALL shape->next [L607] COND FALSE !(!(shape->next)) [L607] COND FALSE !(0) [L608] EXPR, FCALL shape->slist [L608] COND FALSE !(!(shape->slist)) [L608] COND FALSE !(0) [L609] FCALL shape->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] FCALL shape->slist->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] FCALL shape->slist->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] EXPR, FCALL shape->next [L607] COND FALSE !(!(shape->next)) [L607] COND FALSE !(0) [L608] EXPR, FCALL shape->slist [L608] COND FALSE !(!(shape->slist)) [L608] COND FALSE !(0) [L609] EXPR, FCALL shape->slist [L609] FCALL shape->slist->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] EXPR, FCALL shape->next [L607] COND FALSE !(!(shape->next)) [L607] COND FALSE !(0) [L608] EXPR, FCALL shape->slist [L608] COND FALSE !(!(shape->slist)) [L608] COND FALSE !(0) [L609] EXPR, FCALL shape->slist [L609] FCALL shape->slist->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] EXPR, FCALL shape->next [L607] COND FALSE !(!(shape->next)) [L607] COND FALSE !(0) [L608] EXPR, FCALL shape->slist [L608] COND FALSE !(!(shape->slist)) [L608] COND FALSE !(0) [L609] EXPR, FCALL shape->slist [L609] EXPR, FCALL shape->slist->next [L609] COND FALSE !(!(shape->slist->next == ((void *)0))) [L609] COND FALSE !(0) [L605] FCALL shape->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] FCALL data->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] FCALL shape->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] FCALL data->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND TRUE !next [L590] FCALL data->next = dst - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] FCALL data->slist [L594] FCALL next->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] FCALL data->slist [L594] FCALL next->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] FCALL shape->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] FCALL shape->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND FALSE !(pos->next) [L623] FCALL pos->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND FALSE !(pos->next) [L623] EXPR, FCALL pos->next [L623] COND FALSE !(!(!pos->next)) [L623] COND FALSE, RET !(0) [L646] inspect_after(data) [L647] FCALL data->slist - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] FCALL \read(*sub1) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] FCALL \read(*sub2) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] FCALL \read(*sub2) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND FALSE !(pos->next) [L623] EXPR, FCALL pos->next [L623] COND FALSE !(!(!pos->next)) [L623] COND FALSE, RET !(0) [L646] inspect_after(data) [L647] EXPR, FCALL data->slist [L647] struct node *node = data->slist; [L648] FCALL free(data) [L649] COND TRUE \read(*node) [L650] FCALL node->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND FALSE !(pos->next) [L623] EXPR, FCALL pos->next [L623] COND FALSE !(!(!pos->next)) [L623] COND FALSE, RET !(0) [L646] inspect_after(data) [L647] EXPR, FCALL data->slist [L647] struct node *node = data->slist; [L648] FCALL free(data) [L649] COND TRUE \read(*node) [L650] FCALL node->next - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND FALSE !(pos->next) [L623] EXPR, FCALL pos->next [L623] COND FALSE !(!(!pos->next)) [L623] COND FALSE, RET !(0) [L646] inspect_after(data) [L647] EXPR, FCALL data->slist [L647] struct node *node = data->slist; [L648] FCALL free(data) [L649] COND TRUE \read(*node) [L650] EXPR, FCALL node->next [L650] struct node *snext = node->next; [L651] FCALL free(node) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] FCALL \read(*sub1) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL, EXPR seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND TRUE !next [L590] FCALL data->next = dst [L591] dst = data [L600] RET return dst; [L645] EXPR seq_sort_core(data) [L645] data = seq_sort_core(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] FCALL \read(**data) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] EXPR, FCALL \read(*sub1) [L578] sub1 && sub1->value < sub2->value [L578] FCALL \read(*sub1) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL, EXPR seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND TRUE !next [L590] FCALL data->next = dst [L591] dst = data [L600] RET return dst; [L645] EXPR seq_sort_core(data) [L645] data = seq_sort_core(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND TRUE pos->next [L622] FCALL pos->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND TRUE shape->next [L606] COND FALSE !(!(shape)) [L606] COND FALSE !(0) [L607] EXPR, FCALL shape->next [L607] COND FALSE !(!(shape->next)) [L607] COND FALSE !(0) [L608] EXPR, FCALL shape->slist [L608] COND FALSE !(!(shape->slist)) [L608] COND FALSE !(0) [L609] EXPR, FCALL shape->slist [L609] EXPR, FCALL shape->slist->next [L609] COND FALSE !(!(shape->slist->next == ((void *)0))) [L609] COND FALSE !(0) [L605] EXPR, FCALL shape->next [L605] shape = shape->next [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] EXPR, FCALL \read(*sub1) [L578] sub1 && sub1->value < sub2->value [L578] EXPR, FCALL \read(*sub1) [L578] FCALL sub1->value - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] EXPR, FCALL \read(*sub1) [L578] sub1 && sub1->value < sub2->value [L578] EXPR, FCALL \read(*sub1) [L578] FCALL sub1->value - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] FCALL node->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] FCALL node->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] EXPR, FCALL \read(*sub1) [L578] sub1 && sub1->value < sub2->value [L578] EXPR, FCALL \read(*sub1) [L578] FCALL sub1->value [L578] FCALL \read(*sub2) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] EXPR, FCALL node->next [L568] FCALL *data = node->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] EXPR, FCALL \read(*sub1) [L578] sub1 && sub1->value < sub2->value [L578] EXPR, FCALL \read(*sub1) [L578] FCALL sub1->value [L578] EXPR, FCALL \read(*sub2) [L578] FCALL sub2->value - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] EXPR, FCALL \read(*sub1) [L578] sub1 && sub1->value < sub2->value [L578] EXPR, FCALL \read(*sub1) [L578] FCALL sub1->value [L578] EXPR, FCALL \read(*sub2) [L578] FCALL sub2->value - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] EXPR, FCALL node->next [L568] FCALL *data = node->next [L569] FCALL node->next = ((void *)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] EXPR, FCALL node->next [L568] FCALL *data = node->next [L569] FCALL node->next = ((void *)0) [L570] FCALL \read(***dst) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] EXPR, FCALL node->next [L568] FCALL *data = node->next [L569] FCALL node->next = ((void *)0) [L570] EXPR, FCALL \read(***dst) [L570] FCALL **dst = node - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] EXPR, FCALL node->next [L568] FCALL *data = node->next [L569] FCALL node->next = ((void *)0) [L570] EXPR, FCALL \read(***dst) [L570] FCALL **dst = node - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst [L596] dst = data [L597] FCALL next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst [L596] dst = data [L597] FCALL next->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] COND TRUE sub1 || sub2 [L578] EXPR, FCALL \read(*sub2) [L578] !sub2 || (sub1 && sub1->value < sub2->value) [L578] COND TRUE !sub2 || (sub1 && sub1->value < sub2->value) [L579] CALL merge_single_node(&dst, &sub1) [L567] EXPR, FCALL \read(**data) [L567] struct node *node = *data; [L568] EXPR, FCALL node->next [L568] FCALL *data = node->next [L569] FCALL node->next = ((void *)0) [L570] EXPR, FCALL \read(***dst) [L570] FCALL **dst = node [L571] FCALL *dst = &node->next - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst [L596] dst = data [L597] EXPR, FCALL next->next [L597] data = next->next [L598] FCALL free(next) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst [L596] dst = data [L597] EXPR, FCALL next->next [L597] data = next->next [L598] FCALL free(next) [L587] COND TRUE \read(*data) [L588] FCALL data->next - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] FCALL node->next = ((void *)0) [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L643] CALL inspect_before(data) [L604] COND FALSE !(!(shape)) [L604] COND FALSE !(0) [L605] FCALL shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L611] COND FALSE !(0) [L612] EXPR, FCALL shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) [L613] EXPR, FCALL shape->slist [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next [L614] COND FALSE !(!(shape->slist->next == ((void *)0))) [L614] COND FALSE, RET !(0) [L643] inspect_before(data) [L644] FCALL data->next [L644] COND TRUE data->next [L645] CALL, EXPR seq_sort_core(data) [L586] struct list *dst = ((void *)0); [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND FALSE !(!next) [L594] EXPR, FCALL data->slist [L594] EXPR, FCALL next->slist [L594] CALL merge_pair(&data->slist, data->slist, next->slist) [L577] EXPR, FCALL \read(*sub1) [L577] sub1 || sub2 [L577] EXPR, FCALL \read(*sub2) [L577] sub1 || sub2 [L577] COND FALSE, RET !(sub1 || sub2) [L594] merge_pair(&data->slist, data->slist, next->slist) [L595] FCALL data->next = dst [L596] dst = data [L597] EXPR, FCALL next->next [L597] data = next->next [L598] FCALL free(next) [L587] COND TRUE \read(*data) [L588] EXPR, FCALL data->next [L588] struct list *next = data->next; [L589] COND TRUE !next [L590] FCALL data->next = dst [L591] dst = data [L600] RET return dst; [L645] EXPR seq_sort_core(data) [L645] data = seq_sort_core(data) [L644] FCALL data->next [L644] COND FALSE !(data->next) [L646] CALL inspect_after(data) [L618] COND FALSE !(!(shape)) [L618] COND FALSE !(0) [L619] EXPR, FCALL shape->next [L619] COND FALSE !(!(shape->next == ((void *)0))) [L619] COND FALSE !(0) [L620] EXPR, FCALL shape->slist [L620] COND FALSE !(!(shape->slist != ((void *)0))) [L620] COND FALSE !(0) [L621] struct node *pos; [L622] EXPR, FCALL shape->slist [L622] pos = shape->slist [L622] FCALL pos->next [L622] COND FALSE !(pos->next) [L623] EXPR, FCALL pos->next [L623] COND FALSE !(!(!pos->next)) [L623] COND FALSE, RET !(0) [L646] inspect_after(data) [L647] EXPR, FCALL data->slist [L647] struct node *node = data->slist; [L648] FCALL free(data) - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-32-27-748.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-32-27-748.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-32-27-748.csv Received shutdown request...