./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-token-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:43:04,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:43:05,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:43:05,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:43:05,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:43:05,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:43:05,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:43:05,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:43:05,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:43:05,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:43:05,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:43:05,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:43:05,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:43:05,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:43:05,059 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:43:05,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:05,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:05,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:43:05,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:43:05,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:43:05,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:43:05,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:43:05,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:43:05,061 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2025-01-09 21:43:05,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:43:05,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:43:05,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:43:05,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:43:05,295 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:43:05,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-2.i [2025-01-09 21:43:06,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7be63fc27/c35d986d7dd94736a39c8787a03c971b/FLAG090b8ab66 [2025-01-09 21:43:06,875 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:43:06,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i [2025-01-09 21:43:06,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7be63fc27/c35d986d7dd94736a39c8787a03c971b/FLAG090b8ab66 [2025-01-09 21:43:07,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7be63fc27/c35d986d7dd94736a39c8787a03c971b [2025-01-09 21:43:07,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:43:07,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:43:07,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:07,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:43:07,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:43:07,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb82c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07, skipping insertion in model container [2025-01-09 21:43:07,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:43:07,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:07,419 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:43:07,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:07,478 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:43:07,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07 WrapperNode [2025-01-09 21:43:07,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:07,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:07,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:43:07,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:43:07,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,512 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-01-09 21:43:07,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:07,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:43:07,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:43:07,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:43:07,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,539 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-01-09 21:43:07,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:43:07,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:43:07,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:43:07,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:43:07,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (1/1) ... [2025-01-09 21:43:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:07,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:43:07,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:43:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 21:43:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:43:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:43:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:43:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:43:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:43:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:43:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:43:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:43:07,703 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:43:07,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:43:07,884 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 21:43:07,884 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:43:07,890 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:43:07,890 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 21:43:07,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:07 BoogieIcfgContainer [2025-01-09 21:43:07,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:43:07,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:43:07,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:43:07,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:43:07,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:43:07" (1/3) ... [2025-01-09 21:43:07,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fb8be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:07, skipping insertion in model container [2025-01-09 21:43:07,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:07" (2/3) ... [2025-01-09 21:43:07,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fb8be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:07, skipping insertion in model container [2025-01-09 21:43:07,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:07" (3/3) ... [2025-01-09 21:43:07,897 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2025-01-09 21:43:07,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:43:07,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-2.i that has 2 procedures, 52 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 21:43:07,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:43:07,938 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;@4fe728a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:43:07,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:43:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 44 states have internal predecessors, (69), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:43:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 21:43:07,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:07,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:07,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:07,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash -825534038, now seen corresponding path program 1 times [2025-01-09 21:43:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265912234] [2025-01-09 21:43:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:08,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 21:43:08,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 21:43:08,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:08,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265912234] [2025-01-09 21:43:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265912234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:43:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350922297] [2025-01-09 21:43:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:08,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:43:08,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:08,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:43:08,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:43:08,103 INFO L87 Difference]: Start difference. First operand has 52 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 44 states have internal predecessors, (69), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:08,112 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-01-09 21:43:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:43:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 21:43:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:08,117 INFO L225 Difference]: With dead ends: 44 [2025-01-09 21:43:08,118 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 21:43:08,119 INFO L434 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 [2025-01-09 21:43:08,123 INFO L435 NwaCegarLoop]: 51 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, 51 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 [2025-01-09 21:43:08,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 21:43:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 21:43:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-01-09 21:43:08,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 8 [2025-01-09 21:43:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:08,145 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-01-09 21:43:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-01-09 21:43:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:43:08,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:08,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:43:08,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:08,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash -623352597, now seen corresponding path program 1 times [2025-01-09 21:43:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45258098] [2025-01-09 21:43:08,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:08,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:43:08,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:43:08,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:08,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45258098] [2025-01-09 21:43:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45258098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:43:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896428689] [2025-01-09 21:43:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:43:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:08,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:43:08,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:43:08,389 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:08,443 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-01-09 21:43:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:08,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 21:43:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:08,444 INFO L225 Difference]: With dead ends: 41 [2025-01-09 21:43:08,444 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 21:43:08,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:43:08,444 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:08,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 94 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 21:43:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 21:43:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-09 21:43:08,447 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 9 [2025-01-09 21:43:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:08,447 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-09 21:43:08,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-09 21:43:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:43:08,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:08,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:08,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:43:08,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:08,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash -543212885, now seen corresponding path program 1 times [2025-01-09 21:43:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:08,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100701029] [2025-01-09 21:43:08,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:08,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:43:08,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:43:08,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:08,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100701029] [2025-01-09 21:43:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100701029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:08,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:43:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411664689] [2025-01-09 21:43:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:08,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:43:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:08,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:43:08,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:43:08,508 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:08,590 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-01-09 21:43:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:43:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 21:43:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:08,591 INFO L225 Difference]: With dead ends: 60 [2025-01-09 21:43:08,591 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 21:43:08,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:43:08,592 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 62 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:08,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 68 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 21:43:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2025-01-09 21:43:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-01-09 21:43:08,598 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 9 [2025-01-09 21:43:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:08,598 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-01-09 21:43:08,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-01-09 21:43:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 21:43:08,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:08,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:08,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:43:08,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:08,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -576682711, now seen corresponding path program 1 times [2025-01-09 21:43:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656181854] [2025-01-09 21:43:08,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:08,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:43:08,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:43:08,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:08,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656181854] [2025-01-09 21:43:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656181854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:43:09,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164107228] [2025-01-09 21:43:09,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:43:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:09,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:43:09,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:09,049 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:09,253 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-01-09 21:43:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:43:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 21:43:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:09,254 INFO L225 Difference]: With dead ends: 57 [2025-01-09 21:43:09,254 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 21:43:09,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:43:09,254 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:09,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 136 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 21:43:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2025-01-09 21:43:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 47 states have internal predecessors, (52), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-01-09 21:43:09,261 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2025-01-09 21:43:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:09,261 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-01-09 21:43:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-01-09 21:43:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 21:43:09,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:09,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:09,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:43:09,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:09,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -496542999, now seen corresponding path program 1 times [2025-01-09 21:43:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:09,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783900660] [2025-01-09 21:43:09,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:09,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:43:09,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:43:09,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:09,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783900660] [2025-01-09 21:43:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783900660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:09,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:43:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332377078] [2025-01-09 21:43:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:43:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:09,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:43:09,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:43:09,334 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:09,451 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-01-09 21:43:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:43:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 21:43:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:09,452 INFO L225 Difference]: With dead ends: 48 [2025-01-09 21:43:09,452 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 21:43:09,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:43:09,452 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:09,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 21:43:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 21:43:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-01-09 21:43:09,458 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 14 [2025-01-09 21:43:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:09,459 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-01-09 21:43:09,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-01-09 21:43:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 21:43:09,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:09,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:43:09,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1365825985, now seen corresponding path program 1 times [2025-01-09 21:43:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744811200] [2025-01-09 21:43:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:09,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:43:09,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:43:09,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:09,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:43:09,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:43:09,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:43:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:43:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:43:09,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:43:09,519 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:43:09,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-01-09 21:43:09,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-01-09 21:43:09,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:43:09,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:43:09,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:43:09,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:43:09 BoogieIcfgContainer [2025-01-09 21:43:09,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:43:09,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:43:09,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:43:09,541 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:43:09,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:07" (3/4) ... [2025-01-09 21:43:09,542 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:43:09,578 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-01-09 21:43:09,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:43:09,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:43:09,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:43:09,616 INFO L158 Benchmark]: Toolchain (without parser) took 2478.69ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 63.4MB in the end (delta: 47.8MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-01-09 21:43:09,616 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:09,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.54ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 93.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:43:09,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:09,617 INFO L158 Benchmark]: Boogie Preprocessor took 47.17ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:43:09,618 INFO L158 Benchmark]: RCFGBuilder took 328.94ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.1MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:43:09,618 INFO L158 Benchmark]: TraceAbstraction took 1648.87ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 69.8MB in the end (delta: 3.8MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2025-01-09 21:43:09,618 INFO L158 Benchmark]: Witness Printer took 74.42ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 63.4MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:09,620 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.54ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 93.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.17ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 328.94ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.1MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1648.87ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 69.8MB in the end (delta: 3.8MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. * Witness Printer took 74.42ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 63.4MB in the end (delta: 6.3MB). There was no memory consumed. 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: 992]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) [L1006] head->prev = ((void*)0) [L1007] head->data = 0 [L1009] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 [L1022] x->next = malloc(sizeof(SLL)) [L1023] EXPR x->next [L1023] x->next->prev = x [L1024] EXPR x->next [L1024] x->next->data = 2 [L1026] x = head VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1030] EXPR x->data [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data [L1035] COND FALSE !(!(1 == x->data)) [L1035] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1036] EXPR x->next [L1036] x = x->next [L1037] EXPR x->data [L1037] COND TRUE !(2 != x->data) [L1037] CALL reach_error() [L992] COND FALSE !(0) [L992] __assert_fail ("0", "dll-token-2.c", 12, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1001]: 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 2 procedures, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 471 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 274 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 197 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:43:09,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)