./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/memsafety-ext3/derefAfterFree2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5'] 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/memsafety-ext3/derefAfterFree2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:30:12,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:30:12,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:30:12,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:30:12,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:30:12,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:30:12,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:30:12,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:30:12,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:30:12,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:30:12,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:30:12,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:30:12,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:30:12,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:30:12,232 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:30:12,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:30:12,233 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:30:12,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:30:12,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:30:12,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:30:12,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:30:12,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:30:12,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:30:12,235 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5 [2024-11-07 16:30:12,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:30:12,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:30:12,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:30:12,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:30:12,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:30:12,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2024-11-07 16:30:13,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:30:14,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:30:14,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2024-11-07 16:30:14,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27b8fd16d/a381f97b8ad44d34bc80e3ccb55c451b/FLAGe807aa381 [2024-11-07 16:30:14,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27b8fd16d/a381f97b8ad44d34bc80e3ccb55c451b [2024-11-07 16:30:14,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:30:14,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:30:14,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:30:14,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:30:14,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:30:14,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb37ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14, skipping insertion in model container [2024-11-07 16:30:14,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:30:14,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:30:14,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:30:14,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:30:14,251 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:30:14,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14 WrapperNode [2024-11-07 16:30:14,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:30:14,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:30:14,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:30:14,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:30:14,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,278 INFO L138 Inliner]: procedures = 9, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-11-07 16:30:14,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:30:14,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:30:14,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:30:14,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:30:14,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,298 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-07 16:30:14,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:30:14,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:30:14,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:30:14,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:30:14,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (1/1) ... [2024-11-07 16:30:14,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:30:14,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:14,341 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) [2024-11-07 16:30:14,343 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 [2024-11-07 16:30:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:30:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:30:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:30:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:30:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:30:14,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:30:14,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:30:14,514 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 16:30:14,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:30:14,522 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:30:14,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:30:14,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:14 BoogieIcfgContainer [2024-11-07 16:30:14,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:30:14,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:30:14,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:30:14,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:30:14,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:30:14" (1/3) ... [2024-11-07 16:30:14,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a845de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:14, skipping insertion in model container [2024-11-07 16:30:14,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:14" (2/3) ... [2024-11-07 16:30:14,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a845de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:14, skipping insertion in model container [2024-11-07 16:30:14,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:14" (3/3) ... [2024-11-07 16:30:14,533 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree2.c [2024-11-07 16:30:14,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:30:14,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 16:30:14,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:30:14,600 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;@3b98e320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:30:14,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 16:30:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.75) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:30:14,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:14,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:30:14,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:14,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-07 16:30:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212861839] [2024-11-07 16:30:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212861839] [2024-11-07 16:30:14,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212861839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:14,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036644972] [2024-11-07 16:30:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:14,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:14,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:14,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:14,825 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.75) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:14,871 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-07 16:30:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-07 16:30:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:14,881 INFO L225 Difference]: With dead ends: 24 [2024-11-07 16:30:14,881 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 16:30:14,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:14,887 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:14,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 16:30:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-07 16:30:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-07 16:30:14,918 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 4 [2024-11-07 16:30:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:14,919 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-07 16:30:14,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-07 16:30:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:30:14,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:14,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:30:14,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:30:14,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:14,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2024-11-07 16:30:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203460363] [2024-11-07 16:30:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:15,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:15,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203460363] [2024-11-07 16:30:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203460363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:15,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:15,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:15,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166275556] [2024-11-07 16:30:15,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:15,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:15,013 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:15,061 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-07 16:30:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-07 16:30:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:15,063 INFO L225 Difference]: With dead ends: 23 [2024-11-07 16:30:15,063 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 16:30:15,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:15,064 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:15,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 16:30:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-07 16:30:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-07 16:30:15,067 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 4 [2024-11-07 16:30:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:15,067 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-07 16:30:15,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-07 16:30:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:30:15,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:15,068 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:15,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:30:15,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:15,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 264743433, now seen corresponding path program 1 times [2024-11-07 16:30:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:15,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143045360] [2024-11-07 16:30:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143045360] [2024-11-07 16:30:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143045360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539674290] [2024-11-07 16:30:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:15,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:15,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:15,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 16:30:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:30:15,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:15,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 16:30:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:15,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539674290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:15,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-07 16:30:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654206623] [2024-11-07 16:30:15,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:30:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:30:15,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:15,573 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:15,664 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-07 16:30:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 16:30:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:15,666 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:30:15,666 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 16:30:15,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:15,668 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:15,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 16:30:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-07 16:30:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-07 16:30:15,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 8 [2024-11-07 16:30:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:15,677 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-07 16:30:15,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-07 16:30:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:30:15,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:15,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-07 16:30:15,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:30:15,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:15,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:15,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -641553951, now seen corresponding path program 1 times [2024-11-07 16:30:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323953797] [2024-11-07 16:30:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:15,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323953797] [2024-11-07 16:30:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323953797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:15,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81729616] [2024-11-07 16:30:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:15,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:15,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:30:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:15,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:30:15,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:16,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:16,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81729616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:16,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:16,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-07 16:30:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180797700] [2024-11-07 16:30:16,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:16,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:30:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:30:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:30:16,072 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:16,126 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-07 16:30:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:30:16,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 16:30:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:16,127 INFO L225 Difference]: With dead ends: 40 [2024-11-07 16:30:16,127 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 16:30:16,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:30:16,128 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:16,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 16:30:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 16:30:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-07 16:30:16,162 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 13 [2024-11-07 16:30:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:16,163 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-07 16:30:16,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-07 16:30:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:30:16,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:16,163 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2024-11-07 16:30:16,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:16,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:16,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1461083186, now seen corresponding path program 1 times [2024-11-07 16:30:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:16,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028599940] [2024-11-07 16:30:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:30:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:16,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028599940] [2024-11-07 16:30:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028599940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:16,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:16,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:16,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165686766] [2024-11-07 16:30:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:16,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:16,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:16,419 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:16,425 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-07 16:30:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-07 16:30:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:16,426 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:30:16,427 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 16:30:16,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:16,428 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 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-11-07 16:30:16,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 16:30:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-07 16:30:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-07 16:30:16,436 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 18 [2024-11-07 16:30:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:16,436 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-07 16:30:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-07 16:30:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:30:16,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:16,437 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1] [2024-11-07 16:30:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:30:16,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1951061540, now seen corresponding path program 1 times [2024-11-07 16:30:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742163391] [2024-11-07 16:30:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:30:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742163391] [2024-11-07 16:30:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742163391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:30:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617469792] [2024-11-07 16:30:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:16,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:30:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:30:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:16,497 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:16,513 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-07 16:30:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:30:16,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 16:30:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:16,514 INFO L225 Difference]: With dead ends: 38 [2024-11-07 16:30:16,514 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 16:30:16,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:30:16,515 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:16,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 16:30:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 16:30:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-07 16:30:16,523 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2024-11-07 16:30:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-07 16:30:16,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-07 16:30:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:30:16,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:16,524 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2024-11-07 16:30:16,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:30:16,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:16,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash 353611346, now seen corresponding path program 2 times [2024-11-07 16:30:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512422847] [2024-11-07 16:30:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512422847] [2024-11-07 16:30:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512422847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363650156] [2024-11-07 16:30:16,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:30:16,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:16,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:16,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:16,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:30:16,782 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:30:16,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:16,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 16:30:16,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:16,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 16:30:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:30:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363650156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:30:17,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-07 16:30:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470642652] [2024-11-07 16:30:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:17,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:30:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:17,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:30:17,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:30:17,047 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:17,109 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-07 16:30:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:30:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 16:30:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:17,110 INFO L225 Difference]: With dead ends: 37 [2024-11-07 16:30:17,111 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 16:30:17,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:30:17,112 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:17,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 16:30:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 16:30:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-07 16:30:17,118 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 20 [2024-11-07 16:30:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:17,118 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-07 16:30:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-07 16:30:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:30:17,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:17,119 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:17,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:30:17,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:17,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 151232171, now seen corresponding path program 1 times [2024-11-07 16:30:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296336914] [2024-11-07 16:30:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296336914] [2024-11-07 16:30:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296336914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595558090] [2024-11-07 16:30:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:17,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:17,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:30:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:30:17,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595558090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:17,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:17,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-07 16:30:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426879037] [2024-11-07 16:30:17,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:30:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:30:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:17,534 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:17,582 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-07 16:30:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:30:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:30:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:17,584 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:30:17,585 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 16:30:17,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:17,585 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:17,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 16:30:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-07 16:30:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-11-07 16:30:17,590 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2024-11-07 16:30:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:17,591 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-11-07 16:30:17,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-07 16:30:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:30:17,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:17,591 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-11-07 16:30:17,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:30:17,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-07 16:30:17,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:17,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:17,794 INFO L85 PathProgramCache]: Analyzing trace with hash -896652971, now seen corresponding path program 2 times [2024-11-07 16:30:17,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:17,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798828589] [2024-11-07 16:30:17,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798828589] [2024-11-07 16:30:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798828589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869139874] [2024-11-07 16:30:17,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:30:17,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:17,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:17,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:17,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:30:18,006 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:30:18,007 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:18,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:30:18,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:18,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:18,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869139874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:18,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:18,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-07 16:30:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170492686] [2024-11-07 16:30:18,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:18,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:30:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:30:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:30:18,153 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:18,220 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-07 16:30:18,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:30:18,221 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 16:30:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:18,222 INFO L225 Difference]: With dead ends: 52 [2024-11-07 16:30:18,222 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 16:30:18,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:30:18,222 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:18,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 16:30:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-07 16:30:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-07 16:30:18,230 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 29 [2024-11-07 16:30:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:18,230 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-07 16:30:18,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:30:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-07 16:30:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:30:18,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:18,230 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:18,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:30:18,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:18,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2024-11-07 16:30:18,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1418335515, now seen corresponding path program 2 times [2024-11-07 16:30:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:18,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414401571] [2024-11-07 16:30:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:30:18,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 16:30:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:30:18,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 16:30:18,476 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 16:30:18,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 6 remaining) [2024-11-07 16:30:18,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2024-11-07 16:30:18,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (3 of 6 remaining) [2024-11-07 16:30:18,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (2 of 6 remaining) [2024-11-07 16:30:18,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (1 of 6 remaining) [2024-11-07 16:30:18,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-07 16:30:18,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:30:18,482 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2024-11-07 16:30:18,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:30:18,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:30:18 BoogieIcfgContainer [2024-11-07 16:30:18,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:30:18,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:30:18,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:30:18,507 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:30:18,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:14" (3/4) ... [2024-11-07 16:30:18,508 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 16:30:18,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 16:30:18,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:30:18,546 INFO L158 Benchmark]: Toolchain (without parser) took 4469.07ms. Allocated memory is still 109.1MB. Free memory was 85.7MB in the beginning and 45.5MB in the end (delta: 40.1MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-11-07 16:30:18,547 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:30:18,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.77ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 75.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:30:18,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.18ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 74.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:30:18,548 INFO L158 Benchmark]: Boogie Preprocessor took 32.60ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:30:18,548 INFO L158 Benchmark]: RCFGBuilder took 210.69ms. Allocated memory is still 109.1MB. Free memory was 73.2MB in the beginning and 63.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:30:18,548 INFO L158 Benchmark]: TraceAbstraction took 3979.73ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 47.3MB in the end (delta: 16.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-07 16:30:18,548 INFO L158 Benchmark]: Witness Printer took 38.10ms. Allocated memory is still 109.1MB. Free memory was 47.3MB in the beginning and 45.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:30:18,551 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.23ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.77ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 75.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.18ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 74.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.60ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 210.69ms. Allocated memory is still 109.1MB. Free memory was 73.2MB in the beginning and 63.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3979.73ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 47.3MB in the end (delta: 16.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 38.10ms. Allocated memory is still 109.1MB. Free memory was 47.3MB in the beginning and 45.5MB in the end (delta: 1.8MB). 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: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=0, p={-1:0}] [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=0, p={-1:0}] [L8] i++ VAL [i=1, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=1, p={-1:0}] [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=1, p={-1:0}] [L8] i++ VAL [i=2, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=2, p={-1:0}] [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=2, p={-1:0}] [L8] i++ VAL [i=3, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=3, p={-1:0}] [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=3, p={-1:0}] [L8] i++ VAL [i=4, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=4, p={-1:0}] [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=4, p={-1:0}] [L8] i++ VAL [i=5, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=5, p={-1:0}] [L9] p[i] = 1 [L10] COND TRUE i == 5 VAL [i=5, p={-1:0}] [L11] free(p) VAL [i=5, p={-1:0}] [L11] free(p) VAL [i=5, p={-1:0}] [L11] free(p) [L8] i++ VAL [i=6, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=6, p={-1:0}] [L9] p[i] = 1 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 5]: 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 1 procedures, 19 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 87 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=9, InterpolantAutomatonStates: 53, 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, 9 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 107/424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 16:30:18,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-deref)