./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/weaver/popl20-more-buffer-mult2.wvr.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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:24,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:24,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:40:24,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:24,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:24,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:24,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:24,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:24,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:24,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:24,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:24,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:24,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:24,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:24,178 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:24,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:24,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:24,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:24,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:24,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:24,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:24,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:24,180 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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-02-08 08:40:24,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:24,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:24,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:24,418 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:24,418 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:24,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-02-08 08:40:25,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36ccc5f81/65d8d6baaf3144d682e513c496e00ff2/FLAG3d72d3c4e [2025-02-08 08:40:25,839 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:25,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-02-08 08:40:25,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36ccc5f81/65d8d6baaf3144d682e513c496e00ff2/FLAG3d72d3c4e [2025-02-08 08:40:25,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36ccc5f81/65d8d6baaf3144d682e513c496e00ff2 [2025-02-08 08:40:25,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:25,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:25,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:25,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:25,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:25,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:25" (1/1) ... [2025-02-08 08:40:25,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d49933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:25, skipping insertion in model container [2025-02-08 08:40:25,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:25" (1/1) ... [2025-02-08 08:40:25,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:26,032 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:40:26,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:26,041 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:26,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:26,072 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:26,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26 WrapperNode [2025-02-08 08:40:26,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:26,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:26,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:26,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:26,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,105 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 276 [2025-02-08 08:40:26,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:26,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:26,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:26,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:26,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,124 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 08:40:26,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:26,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:26,144 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:26,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:26,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (1/1) ... [2025-02-08 08:40:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:26,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:40:26,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:40:26,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:26,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:26,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:26,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 08:40:26,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:40:26,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:40:26,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:26,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:26,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:26,202 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:40:26,292 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:26,294 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:26,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc #t~post9#1; [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-1: ~q1_front~0 := 1 + #t~post9#1; [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-2: #t~post9#1 := ~q1_front~0; [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: ~cond~2#1 := (if 0 == (if ~i~0 < ~N~0 || ~q1_front~0 < ~q1_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc #t~ret8#1; [2025-02-08 08:40:26,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-1: havoc #t~mem7#1; [2025-02-08 08:40:26,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-2: ~total~0 := #t~ret8#1; [2025-02-08 08:40:26,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:40:26,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:26,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:26,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-6: #t~ret8#1 := plus_#res#1; [2025-02-08 08:40:26,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc #t~ret11#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc #t~mem10#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: ~total~0 := #t~ret11#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: #t~ret11#1 := plus_#res#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc #t~post12#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: ~q2_front~0 := 1 + #t~post12#1; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-2: #t~post12#1 := ~q2_front~0; [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: [2025-02-08 08:40:26,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: ~cond~3#1 := (if 0 == (if ~j~0 < ~N~0 || ~q2_front~0 < ~q2_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:40:26,650 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:26,651 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:26,891 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L167 is not an error location. [2025-02-08 08:40:26,892 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L167 is not an error location. [2025-02-08 08:40:26,892 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:26,893 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:26,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:26 BoogieIcfgContainer [2025-02-08 08:40:26,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:26,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:26,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:26,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:26,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:25" (1/3) ... [2025-02-08 08:40:26,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41baf3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:26, skipping insertion in model container [2025-02-08 08:40:26,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:26" (2/3) ... [2025-02-08 08:40:26,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41baf3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:26, skipping insertion in model container [2025-02-08 08:40:26,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:26" (3/3) ... [2025-02-08 08:40:26,899 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-02-08 08:40:26,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:26,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-02-08 08:40:26,913 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:26,973 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:40:26,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-02-08 08:40:27,029 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-02-08 08:40:27,032 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:27,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 120 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-02-08 08:40:27,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-02-08 08:40:27,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2025-02-08 08:40:27,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:27,058 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;@1fc98365, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:27,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 08:40:27,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:27,061 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:27,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:27,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:27,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:27,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:27,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash 737572, now seen corresponding path program 1 times [2025-02-08 08:40:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648537677] [2025-02-08 08:40:27,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:27,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:27,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:27,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:27,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648537677] [2025-02-08 08:40:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648537677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919821335] [2025-02-08 08:40:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:27,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:27,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:27,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:27,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-02-08 08:40:27,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:27,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:27,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:28,619 INFO L124 PetriNetUnfolderBase]: 10232/14040 cut-off events. [2025-02-08 08:40:28,620 INFO L125 PetriNetUnfolderBase]: For 379/379 co-relation queries the response was YES. [2025-02-08 08:40:28,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28428 conditions, 14040 events. 10232/14040 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 83962 event pairs, 9160 based on Foata normal form. 1/9555 useless extension candidates. Maximal degree in co-relation 26340. Up to 13600 conditions per place. [2025-02-08 08:40:28,719 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 40 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-02-08 08:40:28,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 214 flow [2025-02-08 08:40:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-08 08:40:28,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:40:28,734 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 3 states and 93 transitions. [2025-02-08 08:40:28,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 214 flow [2025-02-08 08:40:28,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 08:40:28,805 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 118 flow [2025-02-08 08:40:28,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-02-08 08:40:28,809 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-02-08 08:40:28,809 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 118 flow [2025-02-08 08:40:28,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-02-08 08:40:28,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:28,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:28,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:28,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 737573, now seen corresponding path program 1 times [2025-02-08 08:40:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601755743] [2025-02-08 08:40:28,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:28,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601755743] [2025-02-08 08:40:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601755743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891098779] [2025-02-08 08:40:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:29,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:29,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:29,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:29,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-02-08 08:40:29,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:29,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:29,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:30,119 INFO L124 PetriNetUnfolderBase]: 10232/14039 cut-off events. [2025-02-08 08:40:30,119 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 08:40:30,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27909 conditions, 14039 events. 10232/14039 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 84017 event pairs, 9160 based on Foata normal form. 0/9553 useless extension candidates. Maximal degree in co-relation 27888. Up to 13604 conditions per place. [2025-02-08 08:40:30,185 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-02-08 08:40:30,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 202 flow [2025-02-08 08:40:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-08 08:40:30,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2025-02-08 08:40:30,187 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 118 flow. Second operand 4 states and 108 transitions. [2025-02-08 08:40:30,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 202 flow [2025-02-08 08:40:30,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:30,188 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 120 flow [2025-02-08 08:40:30,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-02-08 08:40:30,189 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-02-08 08:40:30,189 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 120 flow [2025-02-08 08:40:30,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-02-08 08:40:30,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:30,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:40:30,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:30,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:30,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash 22865748, now seen corresponding path program 1 times [2025-02-08 08:40:30,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470508209] [2025-02-08 08:40:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:40:30,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:40:30,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:30,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470508209] [2025-02-08 08:40:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470508209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520313459] [2025-02-08 08:40:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:30,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:30,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:30,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:30,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:30,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2025-02-08 08:40:30,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:30,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:30,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:31,223 INFO L124 PetriNetUnfolderBase]: 10234/14045 cut-off events. [2025-02-08 08:40:31,223 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 08:40:31,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27926 conditions, 14045 events. 10234/14045 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 83883 event pairs, 9160 based on Foata normal form. 0/9556 useless extension candidates. Maximal degree in co-relation 27902. Up to 13607 conditions per place. [2025-02-08 08:40:31,285 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 42 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-02-08 08:40:31,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 236 flow [2025-02-08 08:40:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-02-08 08:40:31,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2025-02-08 08:40:31,289 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 120 flow. Second operand 5 states and 130 transitions. [2025-02-08 08:40:31,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 236 flow [2025-02-08 08:40:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:40:31,293 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 165 flow [2025-02-08 08:40:31,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-02-08 08:40:31,294 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-02-08 08:40:31,294 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 165 flow [2025-02-08 08:40:31,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2025-02-08 08:40:31,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:31,295 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:40:31,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:40:31,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:31,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 499170126, now seen corresponding path program 1 times [2025-02-08 08:40:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847228609] [2025-02-08 08:40:31,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:31,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:31,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847228609] [2025-02-08 08:40:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847228609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778234519] [2025-02-08 08:40:31,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:31,537 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) [2025-02-08 08:40:31,538 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 [2025-02-08 08:40:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:31,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:31,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:31,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:31,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:31,650 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 [2025-02-08 08:40:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:31,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778234519] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:31,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:31,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:40:31,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832196132] [2025-02-08 08:40:31,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:31,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:31,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:31,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:31,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:31,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 165 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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) [2025-02-08 08:40:31,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:31,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:31,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:33,012 INFO L124 PetriNetUnfolderBase]: 10236/14050 cut-off events. [2025-02-08 08:40:33,012 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 08:40:33,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27958 conditions, 14050 events. 10236/14050 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 83942 event pairs, 9160 based on Foata normal form. 0/9564 useless extension candidates. Maximal degree in co-relation 27898. Up to 13601 conditions per place. [2025-02-08 08:40:33,110 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 36 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2025-02-08 08:40:33,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 295 flow [2025-02-08 08:40:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:40:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:40:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2025-02-08 08:40:33,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2025-02-08 08:40:33,115 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 165 flow. Second operand 9 states and 200 transitions. [2025-02-08 08:40:33,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 295 flow [2025-02-08 08:40:33,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:33,119 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 222 flow [2025-02-08 08:40:33,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-02-08 08:40:33,120 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-02-08 08:40:33,120 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 222 flow [2025-02-08 08:40:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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) [2025-02-08 08:40:33,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:33,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:33,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:40:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:33,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:33,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1254024275, now seen corresponding path program 1 times [2025-02-08 08:40:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887245094] [2025-02-08 08:40:33,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:33,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:33,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:33,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:33,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:33,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887245094] [2025-02-08 08:40:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887245094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:33,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103587689] [2025-02-08 08:40:33,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:33,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:33,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:33,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:33,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 08:40:33,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2025-02-08 08:40:33,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:33,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 08:40:33,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:34,284 INFO L124 PetriNetUnfolderBase]: 12585/17447 cut-off events. [2025-02-08 08:40:34,285 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-08 08:40:34,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34758 conditions, 17447 events. 12585/17447 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 107678 event pairs, 11357 based on Foata normal form. 541/13163 useless extension candidates. Maximal degree in co-relation 27902. Up to 13615 conditions per place. [2025-02-08 08:40:34,382 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 88 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2025-02-08 08:40:34,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 528 flow [2025-02-08 08:40:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-02-08 08:40:34,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209677419354839 [2025-02-08 08:40:34,385 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 222 flow. Second operand 4 states and 154 transitions. [2025-02-08 08:40:34,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 528 flow [2025-02-08 08:40:34,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 460 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:34,389 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 195 flow [2025-02-08 08:40:34,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2025-02-08 08:40:34,390 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-02-08 08:40:34,390 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 195 flow [2025-02-08 08:40:34,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2025-02-08 08:40:34,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:34,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:34,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:40:34,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:34,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:34,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1139771141, now seen corresponding path program 1 times [2025-02-08 08:40:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:34,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583966521] [2025-02-08 08:40:34,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:34,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:34,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:34,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583966521] [2025-02-08 08:40:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583966521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:34,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:34,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375780522] [2025-02-08 08:40:34,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:34,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:34,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:34,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:34,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:34,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-02-08 08:40:34,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:34,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:34,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:35,055 INFO L124 PetriNetUnfolderBase]: 8910/12474 cut-off events. [2025-02-08 08:40:35,056 INFO L125 PetriNetUnfolderBase]: For 797/797 co-relation queries the response was YES. [2025-02-08 08:40:35,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27101 conditions, 12474 events. 8910/12474 cut-off events. For 797/797 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 74717 event pairs, 7927 based on Foata normal form. 0/9514 useless extension candidates. Maximal degree in co-relation 22231. Up to 12000 conditions per place. [2025-02-08 08:40:35,109 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 48 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-02-08 08:40:35,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 295 flow [2025-02-08 08:40:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-08 08:40:35,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2025-02-08 08:40:35,110 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 195 flow. Second operand 4 states and 106 transitions. [2025-02-08 08:40:35,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 295 flow [2025-02-08 08:40:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 291 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:35,113 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 195 flow [2025-02-08 08:40:35,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2025-02-08 08:40:35,113 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-02-08 08:40:35,113 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 195 flow [2025-02-08 08:40:35,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-02-08 08:40:35,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:35,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:35,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:40:35,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:35,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1139771142, now seen corresponding path program 1 times [2025-02-08 08:40:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760905702] [2025-02-08 08:40:35,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:35,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:35,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760905702] [2025-02-08 08:40:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760905702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:35,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222967046] [2025-02-08 08:40:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:35,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:35,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:35,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 08:40:35,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-02-08 08:40:35,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:35,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 08:40:35,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:36,005 INFO L124 PetriNetUnfolderBase]: 11951/17059 cut-off events. [2025-02-08 08:40:36,005 INFO L125 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2025-02-08 08:40:36,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37101 conditions, 17059 events. 11951/17059 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 108912 event pairs, 10818 based on Foata normal form. 569/14320 useless extension candidates. Maximal degree in co-relation 22184. Up to 12016 conditions per place. [2025-02-08 08:40:36,087 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-02-08 08:40:36,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 431 flow [2025-02-08 08:40:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-02-08 08:40:36,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592741935483871 [2025-02-08 08:40:36,088 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 195 flow. Second operand 4 states and 147 transitions. [2025-02-08 08:40:36,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 431 flow [2025-02-08 08:40:36,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:40:36,091 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 204 flow [2025-02-08 08:40:36,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-02-08 08:40:36,091 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-02-08 08:40:36,091 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 204 flow [2025-02-08 08:40:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-02-08 08:40:36,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:36,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:36,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:40:36,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:36,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -329527600, now seen corresponding path program 1 times [2025-02-08 08:40:36,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:36,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011547537] [2025-02-08 08:40:36,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:36,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:36,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:36,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:36,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:36,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011547537] [2025-02-08 08:40:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011547537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:36,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210212295] [2025-02-08 08:40:36,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:36,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:36,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:36,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:36,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-02-08 08:40:36,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:36,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:36,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:36,799 INFO L124 PetriNetUnfolderBase]: 9014/12960 cut-off events. [2025-02-08 08:40:36,799 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2025-02-08 08:40:36,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29287 conditions, 12960 events. 9014/12960 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 80587 event pairs, 8104 based on Foata normal form. 0/10896 useless extension candidates. Maximal degree in co-relation 16487. Up to 12390 conditions per place. [2025-02-08 08:40:36,857 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 43 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-02-08 08:40:36,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 296 flow [2025-02-08 08:40:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-02-08 08:40:36,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2025-02-08 08:40:36,858 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 204 flow. Second operand 5 states and 120 transitions. [2025-02-08 08:40:36,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 296 flow [2025-02-08 08:40:36,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:36,861 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 206 flow [2025-02-08 08:40:36,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-02-08 08:40:36,862 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-02-08 08:40:36,862 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 206 flow [2025-02-08 08:40:36,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-02-08 08:40:36,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:36,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:40:36,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:36,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash -329527599, now seen corresponding path program 1 times [2025-02-08 08:40:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140154792] [2025-02-08 08:40:36,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:36,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:36,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:36,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:36,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:37,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140154792] [2025-02-08 08:40:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140154792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687715293] [2025-02-08 08:40:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:37,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:37,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:37,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:37,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-02-08 08:40:37,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-02-08 08:40:37,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:37,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-02-08 08:40:37,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:37,658 INFO L124 PetriNetUnfolderBase]: 6601/9585 cut-off events. [2025-02-08 08:40:37,659 INFO L125 PetriNetUnfolderBase]: For 1392/1392 co-relation queries the response was YES. [2025-02-08 08:40:37,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21115 conditions, 9585 events. 6601/9585 cut-off events. For 1392/1392 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 57905 event pairs, 5890 based on Foata normal form. 0/8702 useless extension candidates. Maximal degree in co-relation 10386. Up to 9174 conditions per place. [2025-02-08 08:40:37,708 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 44 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-02-08 08:40:37,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 294 flow [2025-02-08 08:40:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-02-08 08:40:37,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4112903225806452 [2025-02-08 08:40:37,710 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 206 flow. Second operand 4 states and 102 transitions. [2025-02-08 08:40:37,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 294 flow [2025-02-08 08:40:37,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 283 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:40:37,713 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 195 flow [2025-02-08 08:40:37,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-02-08 08:40:37,713 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-02-08 08:40:37,713 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 195 flow [2025-02-08 08:40:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-02-08 08:40:37,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:37,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:37,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:40:37,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:37,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1245776000, now seen corresponding path program 1 times [2025-02-08 08:40:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57351290] [2025-02-08 08:40:37,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:37,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:37,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:37,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57351290] [2025-02-08 08:40:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57351290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297181763] [2025-02-08 08:40:37,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:37,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:37,856 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) [2025-02-08 08:40:37,857 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 [2025-02-08 08:40:37,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:37,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:37,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:37,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:37,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:40:37,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:37,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297181763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:37,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-08 08:40:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058882566] [2025-02-08 08:40:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:40:37,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 08:40:37,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2025-02-08 08:40:37,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:37,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 08:40:37,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:38,335 INFO L124 PetriNetUnfolderBase]: 4922/7270 cut-off events. [2025-02-08 08:40:38,336 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2025-02-08 08:40:38,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15574 conditions, 7270 events. 4922/7270 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 43196 event pairs, 4350 based on Foata normal form. 0/7062 useless extension candidates. Maximal degree in co-relation 10309. Up to 6894 conditions per place. [2025-02-08 08:40:38,361 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 38 selfloop transitions, 6 changer transitions 2/55 dead transitions. [2025-02-08 08:40:38,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 279 flow [2025-02-08 08:40:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-08 08:40:38,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2025-02-08 08:40:38,363 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 195 flow. Second operand 4 states and 108 transitions. [2025-02-08 08:40:38,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 279 flow [2025-02-08 08:40:38,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:38,365 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 186 flow [2025-02-08 08:40:38,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2025-02-08 08:40:38,365 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-02-08 08:40:38,365 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 186 flow [2025-02-08 08:40:38,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2025-02-08 08:40:38,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:38,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:38,372 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 [2025-02-08 08:40:38,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:38,570 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-08 08:40:38,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash -434073013, now seen corresponding path program 1 times [2025-02-08 08:40:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131599623] [2025-02-08 08:40:38,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:40:38,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:40:38,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:38,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131599623] [2025-02-08 08:40:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131599623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373415673] [2025-02-08 08:40:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:38,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:38,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:38,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:38,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-08 08:40:38,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 08:40:38,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:38,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-08 08:40:38,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:38,820 INFO L124 PetriNetUnfolderBase]: 3481/5277 cut-off events. [2025-02-08 08:40:38,821 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-02-08 08:40:38,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10923 conditions, 5277 events. 3481/5277 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31092 event pairs, 3089 based on Foata normal form. 4/5205 useless extension candidates. Maximal degree in co-relation 6428. Up to 4983 conditions per place. [2025-02-08 08:40:38,827 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-02-08 08:40:38,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 268 flow [2025-02-08 08:40:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:40:38,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2025-02-08 08:40:38,828 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 186 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:40:38,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 268 flow [2025-02-08 08:40:38,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:38,829 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2025-02-08 08:40:38,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2025-02-08 08:40:38,829 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-02-08 08:40:38,829 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2025-02-08 08:40:38,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 08:40:38,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 26 remaining) [2025-02-08 08:40:38,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-02-08 08:40:38,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-02-08 08:40:38,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (15 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-02-08 08:40:38,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-02-08 08:40:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:40:38,832 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:38,836 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:40:38,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:40:38,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:40:38 BasicIcfg [2025-02-08 08:40:38,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:40:38,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:40:38,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:40:38,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:40:38,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:26" (3/4) ... [2025-02-08 08:40:38,841 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:40:38,842 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:40:38,843 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:40:38,843 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:40:38,843 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 08:40:38,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 116 nodes and edges [2025-02-08 08:40:38,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-02-08 08:40:38,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 08:40:38,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 08:40:38,902 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:40:38,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:40:38,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:40:38,903 INFO L158 Benchmark]: Toolchain (without parser) took 13017.09ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 108.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. [2025-02-08 08:40:38,904 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:38,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.64ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 95.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:38,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:38,904 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:38,904 INFO L158 Benchmark]: IcfgBuilder took 749.90ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 83.1MB in the end (delta: 8.4MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-02-08 08:40:38,904 INFO L158 Benchmark]: TraceAbstraction took 11944.44ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 82.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-02-08 08:40:38,905 INFO L158 Benchmark]: Witness Printer took 63.52ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:38,906 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.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.64ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 95.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 749.90ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 83.1MB in the end (delta: 8.4MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11944.44ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 82.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 63.52ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 121]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 95 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1382 IncrementalHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 29 mSDtfsCounter, 1382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 921 SizeOfPredicates, 6 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 7/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:40:38,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE