./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 15:42:20,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:42:20,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:42:20,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:42:20,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:42:20,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:42:20,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:42:20,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:42:20,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:42:20,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:42:20,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:42:20,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:42:20,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:42:20,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:42:20,760 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:42:20,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:42:20,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:42:20,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:42:20,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:42:20,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:42:20,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:42:20,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:42:20,762 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:42:20,763 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:42:20,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:42:20,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:42:20,763 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:42:20,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:42:20,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:42:20,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:42:20,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:42:20,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:42:20,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:42:20,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:42:20,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:42:20,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:42:20,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:42:20,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:42:20,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:42:20,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:42:20,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:42:20,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:42:20,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:42:20,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:42:20,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:42:20,769 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-10-24 15:42:21,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:42:21,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:42:21,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:42:21,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:42:21,074 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:42:21,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-10-24 15:42:22,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:42:22,753 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:42:22,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-10-24 15:42:22,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b553bd0c/ec87e063a80846e29dc8a8142d24267c/FLAG2d27ec10e [2024-10-24 15:42:23,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b553bd0c/ec87e063a80846e29dc8a8142d24267c [2024-10-24 15:42:23,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:42:23,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:42:23,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:42:23,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:42:23,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:42:23,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7330c948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23, skipping insertion in model container [2024-10-24 15:42:23,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:42:23,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:42:23,475 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:42:23,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:42:23,575 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:42:23,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23 WrapperNode [2024-10-24 15:42:23,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:42:23,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:42:23,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:42:23,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:42:23,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,634 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-24 15:42:23,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:42:23,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:42:23,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:42:23,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:42:23,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,690 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 6, 8, 8, 18]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 1, 7]. [2024-10-24 15:42:23,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:42:23,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:42:23,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:42:23,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:42:23,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (1/1) ... [2024-10-24 15:42:23,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:42:23,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:42:23,764 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-10-24 15:42:23,771 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-10-24 15:42:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-24 15:42:23,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-24 15:42:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:42:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:42:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:42:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:42:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:42:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:42:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 15:42:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 15:42:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:42:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-10-24 15:42:23,825 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 15:42:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 15:42:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 15:42:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 15:42:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-10-24 15:42:23,827 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-10-24 15:42:23,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 15:42:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 15:42:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 15:42:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 15:42:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 15:42:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-10-24 15:42:23,829 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-10-24 15:42:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:42:23,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:42:24,107 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:42:24,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:42:24,486 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-24 15:42:24,490 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:42:24,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:42:24,533 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-24 15:42:24,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:42:24 BoogieIcfgContainer [2024-10-24 15:42:24,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:42:24,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:42:24,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:42:24,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:42:24,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:42:23" (1/3) ... [2024-10-24 15:42:24,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d178f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:42:24, skipping insertion in model container [2024-10-24 15:42:24,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:42:23" (2/3) ... [2024-10-24 15:42:24,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d178f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:42:24, skipping insertion in model container [2024-10-24 15:42:24,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:42:24" (3/3) ... [2024-10-24 15:42:24,543 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2024-10-24 15:42:24,555 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:42:24,555 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:42:24,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:42:24,597 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;@2bf510aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:42:24,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:42:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 81 states have internal predecessors, (124), 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-10-24 15:42:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 15:42:24,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:42:24,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:42:24,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:42:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:42:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash 438214350, now seen corresponding path program 1 times [2024-10-24 15:42:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:42:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220917339] [2024-10-24 15:42:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:42:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:42:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:42:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:42:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220917339] [2024-10-24 15:42:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220917339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:42:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:42:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:42:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249791307] [2024-10-24 15:42:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:42:24,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:42:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:42:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:42:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:42:24,857 INFO L87 Difference]: Start difference. First operand has 94 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 81 states have internal predecessors, (124), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-10-24 15:42:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:42:24,902 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2024-10-24 15:42:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:42:24,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2024-10-24 15:42:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:42:24,914 INFO L225 Difference]: With dead ends: 92 [2024-10-24 15:42:24,915 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 15:42:24,917 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-10-24 15:42:24,920 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:42:24,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:42:24,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 15:42:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 15:42:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 78 states have internal predecessors, (86), 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-10-24 15:42:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2024-10-24 15:42:24,956 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 16 [2024-10-24 15:42:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:42:24,957 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-10-24 15:42:24,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-10-24 15:42:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2024-10-24 15:42:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 15:42:24,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:42:24,959 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 15:42:24,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:42:24,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:42:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:42:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -33787687, now seen corresponding path program 1 times [2024-10-24 15:42:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:42:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131653792] [2024-10-24 15:42:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:42:24,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:42:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 15:42:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 15:42:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:42:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:42:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131653792] [2024-10-24 15:42:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131653792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 15:42:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448325093] [2024-10-24 15:42:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:42:25,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 15:42:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:42:25,834 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-10-24 15:42:25,836 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-10-24 15:42:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:26,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 15:42:26,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:42:26,146 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-10-24 15:42:26,239 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-10-24 15:42:26,247 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-10-24 15:42:26,331 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-10-24 15:42:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:42:26,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:42:26,405 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-10-24 15:42:26,522 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-10-24 15:42:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:42:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448325093] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:42:26,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 15:42:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 12 [2024-10-24 15:42:26,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009828455] [2024-10-24 15:42:26,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 15:42:26,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 15:42:26,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:42:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 15:42:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-24 15:42:26,540 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-10-24 15:42:30,560 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-10-24 15:42:34,583 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-10-24 15:42:38,617 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-10-24 15:42:42,639 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-10-24 15:42:46,687 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-10-24 15:42:50,751 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-10-24 15:42:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:42:51,356 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2024-10-24 15:42:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 15:42:51,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 29 [2024-10-24 15:42:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:42:51,359 INFO L225 Difference]: With dead ends: 113 [2024-10-24 15:42:51,360 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 15:42:51,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-10-24 15:42:51,361 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 155 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 37 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:42:51,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 434 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 650 Invalid, 6 Unknown, 0 Unchecked, 24.6s Time] [2024-10-24 15:42:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 15:42:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2024-10-24 15:42:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 92 states have internal predecessors, (103), 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-10-24 15:42:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2024-10-24 15:42:51,381 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 29 [2024-10-24 15:42:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:42:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2024-10-24 15:42:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-10-24 15:42:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2024-10-24 15:42:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 15:42:51,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:42:51,384 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 15:42:51,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 15:42:51,584 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-10-24 15:42:51,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:42:51,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:42:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash -273449149, now seen corresponding path program 1 times [2024-10-24 15:42:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:42:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338606368] [2024-10-24 15:42:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:42:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:42:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 15:42:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 15:42:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:42:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:42:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338606368] [2024-10-24 15:42:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338606368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 15:42:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299801835] [2024-10-24 15:42:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:42:52,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 15:42:52,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:42:52,010 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-10-24 15:42:52,011 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-10-24 15:42:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:42:52,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 15:42:52,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:42:52,263 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-10-24 15:42:52,278 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-10-24 15:42:52,339 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-10-24 15:42:52,343 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-10-24 15:42:52,355 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-10-24 15:42:52,358 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-10-24 15:42:52,509 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-10-24 15:42:52,516 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-10-24 15:42:52,519 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-10-24 15:42:52,523 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-10-24 15:42:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:42:52,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:42:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299801835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:42:52,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 15:42:52,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-10-24 15:42:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243557543] [2024-10-24 15:42:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:42:52,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 15:42:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:42:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 15:42:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2024-10-24 15:42:52,624 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-10-24 15:42:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:42:53,105 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2024-10-24 15:42:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 15:42:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 31 [2024-10-24 15:42:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:42:53,108 INFO L225 Difference]: With dead ends: 206 [2024-10-24 15:42:53,108 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 15:42:53,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-10-24 15:42:53,109 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 131 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:42:53,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 757 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:42:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 15:42:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 133. [2024-10-24 15:42:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 114 states have internal predecessors, (129), 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-10-24 15:42:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2024-10-24 15:42:53,136 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 31 [2024-10-24 15:42:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:42:53,136 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2024-10-24 15:42:53,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-10-24 15:42:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2024-10-24 15:42:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 15:42:53,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:42:53,138 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 15:42:53,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 15:42:53,338 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-10-24 15:42:53,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:42:53,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:42:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 320934575, now seen corresponding path program 1 times [2024-10-24 15:42:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:42:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040972806] [2024-10-24 15:42:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:42:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:42:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:42:53,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:42:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:42:53,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:42:53,437 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:42:53,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-24 15:42:53,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-24 15:42:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:42:53,443 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 15:42:53,475 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:42:53,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:42:53 BoogieIcfgContainer [2024-10-24 15:42:53,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:42:53,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:42:53,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:42:53,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:42:53,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:42:24" (3/4) ... [2024-10-24 15:42:53,480 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 15:42:53,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 15:42:53,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:42:53,523 INFO L158 Benchmark]: Toolchain (without parser) took 30454.35ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 124.2MB in the beginning and 116.3MB in the end (delta: 8.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,524 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:42:53,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.15ms. Allocated memory is still 153.1MB. Free memory was 124.2MB in the beginning and 103.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.30ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 101.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,525 INFO L158 Benchmark]: Boogie Preprocessor took 86.14ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 95.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,525 INFO L158 Benchmark]: RCFGBuilder took 812.30ms. Allocated memory is still 153.1MB. Free memory was 95.9MB in the beginning and 101.3MB in the end (delta: -5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,525 INFO L158 Benchmark]: TraceAbstraction took 28942.23ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 100.1MB in the beginning and 118.3MB in the end (delta: -18.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,525 INFO L158 Benchmark]: Witness Printer took 44.11ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 116.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:42:53,529 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.10ms. Allocated memory is still 109.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.15ms. Allocated memory is still 153.1MB. Free memory was 124.2MB in the beginning and 103.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.30ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 101.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.14ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 95.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 812.30ms. Allocated memory is still 153.1MB. Free memory was 95.9MB in the beginning and 101.3MB in the end (delta: -5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28942.23ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 100.1MB in the beginning and 118.3MB in the end (delta: -18.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 44.11ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 116.3MB in the end (delta: 2.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; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L590] RET chain_node(&list) VAL [list={5:0}, pp1={3:0}, pp2={6: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; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L597] RET chain_node(&list) VAL [list={5:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [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}] [L627] COND FALSE !(!(end)) 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, 94 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 1300 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 915 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 250 mSDtfsCounter, 915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 32, 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, 79 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 159 ConstructedInterpolants, 8 QuantifiedInterpolants, 1334 SizeOfPredicates, 27 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 8/20 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-10-24 15:42:53,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)