./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:47:59,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:47:59,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:47:59,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:47:59,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:47:59,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:47:59,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:47:59,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:47:59,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:47:59,755 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:47:59,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:47:59,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:47:59,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:47:59,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:47:59,758 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:47:59,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:47:59,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:47:59,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:47:59,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:47:59,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:47:59,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:47:59,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:47:59,764 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:47:59,764 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:47:59,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:47:59,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:47:59,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:47:59,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:47:59,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:47:59,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:47:59,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:47:59,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:47:59,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:47:59,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:47:59,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:47:59,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:47:59,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:47:59,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:47:59,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:47:59,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:47:59,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:47:59,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:47:59,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:47:59,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:47:59,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:47:59,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2024-11-10 14:48:00,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:48:00,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:48:00,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:48:00,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:48:00,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:48:00,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-11-10 14:48:01,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:48:01,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:48:01,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-11-10 14:48:01,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b173b407/414cc0e6e1ad4cbb8bc592f23a268d55/FLAG07184ef88 [2024-11-10 14:48:01,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b173b407/414cc0e6e1ad4cbb8bc592f23a268d55 [2024-11-10 14:48:01,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:48:01,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:48:01,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:01,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:48:01,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:48:01,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540b8168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01, skipping insertion in model container [2024-11-10 14:48:01,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:48:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:02,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:48:02,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:02,367 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:48:02,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02 WrapperNode [2024-11-10 14:48:02,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:02,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:02,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:48:02,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:48:02,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,430 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 14:48:02,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:02,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:48:02,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:48:02,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:48:02,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,500 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 18, 8, 8, 6]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2024-11-10 14:48:02,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:48:02,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:48:02,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:48:02,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:48:02,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (1/1) ... [2024-11-10 14:48:02,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:48:02,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:02,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:48:02,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:48:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-10 14:48:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-10 14:48:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:48:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:48:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:48:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:48:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:48:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 14:48:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 14:48:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 14:48:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:48:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:48:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 14:48:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-10 14:48:02,685 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-10 14:48:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-10 14:48:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-10 14:48:02,686 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-10 14:48:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 14:48:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 14:48:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 14:48:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 14:48:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 14:48:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-10 14:48:02,689 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-10 14:48:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:48:02,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:48:02,842 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:48:02,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:48:03,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L639: call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2024-11-10 14:48:03,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc create_sll_#t~mem11#1.base, create_sll_#t~mem11#1.offset;call ULTIMATE.dealloc(create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset);havoc create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset; [2024-11-10 14:48:03,202 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-10 14:48:03,202 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:48:03,224 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:48:03,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:48:03,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:03 BoogieIcfgContainer [2024-11-10 14:48:03,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:48:03,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:48:03,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:48:03,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:48:03,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:48:01" (1/3) ... [2024-11-10 14:48:03,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807b000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:03, skipping insertion in model container [2024-11-10 14:48:03,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:02" (2/3) ... [2024-11-10 14:48:03,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807b000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:03, skipping insertion in model container [2024-11-10 14:48:03,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:03" (3/3) ... [2024-11-10 14:48:03,240 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2024-11-10 14:48:03,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:48:03,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:48:03,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:48:03,310 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a1ccfea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:48:03,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:48:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 95 states have (on average 1.568421052631579) internal successors, (149), 106 states have internal predecessors, (149), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 14:48:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 14:48:03,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -600601710, now seen corresponding path program 1 times [2024-11-10 14:48:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456582821] [2024-11-10 14:48:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:03,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456582821] [2024-11-10 14:48:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456582821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:48:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186439849] [2024-11-10 14:48:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:48:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:48:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:48:03,598 INFO L87 Difference]: Start difference. First operand has 119 states, 95 states have (on average 1.568421052631579) internal successors, (149), 106 states have internal predecessors, (149), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:03,625 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-11-10 14:48:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:48:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 14:48:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:03,634 INFO L225 Difference]: With dead ends: 116 [2024-11-10 14:48:03,634 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 14:48:03,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:48:03,639 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:03,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 14:48:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-10 14:48:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:48:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2024-11-10 14:48:03,696 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 19 [2024-11-10 14:48:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2024-11-10 14:48:03,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2024-11-10 14:48:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 14:48:03,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:48:03,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1262638010, now seen corresponding path program 1 times [2024-11-10 14:48:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473756631] [2024-11-10 14:48:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 14:48:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:04,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 14:48:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:48:04,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:04,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473756631] [2024-11-10 14:48:04,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473756631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:04,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083969905] [2024-11-10 14:48:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:04,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:04,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:04,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:48:04,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:48:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:04,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 14:48:04,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:05,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 14:48:05,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-10 14:48:05,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 14:48:05,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 14:48:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:05,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:48:05,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-10 14:48:05,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-10 14:48:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:48:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083969905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:48:05,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:48:05,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 13 [2024-11-10 14:48:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181116321] [2024-11-10 14:48:05,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:48:05,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 14:48:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 14:48:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-10 14:48:05,511 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 14:48:09,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:13,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:17,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:21,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:25,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:29,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:33,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:34,487 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2024-11-10 14:48:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 14:48:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-10 14:48:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:34,492 INFO L225 Difference]: With dead ends: 143 [2024-11-10 14:48:34,492 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 14:48:34,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:48:34,493 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 229 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 42 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:34,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 634 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 817 Invalid, 7 Unknown, 0 Unchecked, 28.7s Time] [2024-11-10 14:48:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 14:48:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2024-11-10 14:48:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 120 states have internal predecessors, (131), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:48:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-11-10 14:48:34,511 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 39 [2024-11-10 14:48:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:34,514 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-11-10 14:48:34,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 14:48:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-11-10 14:48:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 14:48:34,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:34,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:34,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:48:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:34,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1863804833, now seen corresponding path program 1 times [2024-11-10 14:48:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65609772] [2024-11-10 14:48:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 14:48:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 14:48:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:48:35,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:35,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65609772] [2024-11-10 14:48:35,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65609772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:48:35,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889974081] [2024-11-10 14:48:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:35,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:48:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:35,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:48:35,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:48:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:35,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 14:48:35,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:35,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:48:35,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:48:35,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-10 14:48:35,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-10 14:48:35,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:48:35,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:48:35,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 14:48:35,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 14:48:35,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 14:48:35,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 14:48:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:35,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:48:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889974081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:48:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2024-11-10 14:48:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357986688] [2024-11-10 14:48:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:48:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:48:35,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2024-11-10 14:48:35,840 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:48:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:36,269 INFO L93 Difference]: Finished difference Result 258 states and 300 transitions. [2024-11-10 14:48:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:48:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-10 14:48:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:36,272 INFO L225 Difference]: With dead ends: 258 [2024-11-10 14:48:36,272 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 14:48:36,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:48:36,275 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 161 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:36,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 994 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:48:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 14:48:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 170. [2024-11-10 14:48:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.1690140845070423) internal successors, (166), 151 states have internal predecessors, (166), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 14:48:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2024-11-10 14:48:36,294 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 42 [2024-11-10 14:48:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:36,295 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2024-11-10 14:48:36,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:48:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2024-11-10 14:48:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 14:48:36,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:36,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:36,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:48:36,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 14:48:36,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1373047362, now seen corresponding path program 1 times [2024-11-10 14:48:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:36,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621151717] [2024-11-10 14:48:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:48:36,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:48:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:48:36,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:48:36,604 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:48:36,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-10 14:48:36,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-10 14:48:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:48:36,610 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 14:48:36,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:48:36,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:48:36 BoogieIcfgContainer [2024-11-10 14:48:36,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:48:36,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:48:36,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:48:36,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:48:36,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:03" (3/4) ... [2024-11-10 14:48:36,647 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:48:36,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:48:36,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:48:36,700 INFO L158 Benchmark]: Toolchain (without parser) took 34833.46ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 93.1MB in the beginning and 126.1MB in the end (delta: -33.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,700 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 121.6MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:48:36,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.80ms. Allocated memory is still 163.6MB. Free memory was 93.1MB in the beginning and 72.6MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.99ms. Allocated memory is still 163.6MB. Free memory was 72.2MB in the beginning and 69.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,701 INFO L158 Benchmark]: Boogie Preprocessor took 96.73ms. Allocated memory is still 163.6MB. Free memory was 69.9MB in the beginning and 65.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,701 INFO L158 Benchmark]: IcfgBuilder took 696.01ms. Allocated memory is still 163.6MB. Free memory was 65.3MB in the beginning and 107.9MB in the end (delta: -42.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,701 INFO L158 Benchmark]: TraceAbstraction took 33414.46ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 107.5MB in the beginning and 129.2MB in the end (delta: -21.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,702 INFO L158 Benchmark]: Witness Printer took 53.33ms. Allocated memory is still 207.6MB. Free memory was 129.2MB in the beginning and 126.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:48:36,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 121.6MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.80ms. Allocated memory is still 163.6MB. Free memory was 93.1MB in the beginning and 72.6MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.99ms. Allocated memory is still 163.6MB. Free memory was 72.2MB in the beginning and 69.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.73ms. Allocated memory is still 163.6MB. Free memory was 69.9MB in the beginning and 65.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 696.01ms. Allocated memory is still 163.6MB. Free memory was 65.3MB in the beginning and 107.9MB in the end (delta: -42.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33414.46ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 107.5MB in the beginning and 129.2MB in the end (delta: -21.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 53.33ms. Allocated memory is still 207.6MB. Free memory was 129.2MB in the beginning and 126.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); [L588] struct node *list = ((void *)0); [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; VAL [\result={-1:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [\old(ppnode)={3:0}] [L590] RET chain_node(&list) VAL [list={3:0}, pp1={6:0}, pp2={5:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-2:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; VAL [\result={-2:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [\old(ppnode)={3:0}] [L597] RET chain_node(&list) VAL [list={3:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; VAL [\result={-2:0}] [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L641] COND FALSE !(0) VAL [list={-2:0}, p1={6:0}, p2={5:0}] [L642] EXPR \read(*p1) [L642] EXPR \read(*p2) [L642] CALL check_seq_next(p1, p2) VAL [\old(beg)={-1:0}, \old(end)={-1:0}] [L626] COND FALSE !(!(beg)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L626] COND FALSE !(0) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(!(end)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(0) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] COND TRUE !(beg) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] CALL fail() [L565] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_to_dll_rev-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 28.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 1765 SdHoareTripleChecker+Invalid, 28.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1442 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1052 IncrementalHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 323 mSDtfsCounter, 1052 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 96 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 214 ConstructedInterpolants, 12 QuantifiedInterpolants, 1734 SizeOfPredicates, 27 NumberOfNonLiveVariables, 683 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 10/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:48:36,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)