./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:37:04,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:37:04,270 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:37:04,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:37:04,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:37:04,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:37:04,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:37:04,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:37:04,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:37:04,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:37:04,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:37:04,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:37:04,297 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:37:04,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:04,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:37:04,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:37:04,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:37:04,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:37:04,299 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-02-08 08:37:04,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:37:04,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:37:04,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:37:04,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:37:04,525 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:37:04,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-02-08 08:37:05,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d45bf3675/1b06f6902ac648c0acf75df973144607/FLAGf05172070 [2025-02-08 08:37:05,831 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:37:05,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-02-08 08:37:05,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d45bf3675/1b06f6902ac648c0acf75df973144607/FLAGf05172070 [2025-02-08 08:37:05,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d45bf3675/1b06f6902ac648c0acf75df973144607 [2025-02-08 08:37:05,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:37:05,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:37:05,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:05,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:37:05,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:37:05,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:05" (1/1) ... [2025-02-08 08:37:05,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:05, skipping insertion in model container [2025-02-08 08:37:05,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:05" (1/1) ... [2025-02-08 08:37:05,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:37:06,022 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:37:06,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:06,035 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:37:06,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:06,068 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:37:06,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06 WrapperNode [2025-02-08 08:37:06,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:06,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:06,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:37:06,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:37:06,075 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:37:06" (1/1) ... [2025-02-08 08:37:06,082 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:37:06" (1/1) ... [2025-02-08 08:37:06,108 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 270 [2025-02-08 08:37:06,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:06,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:37:06,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:37:06,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:37:06,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,139 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 08:37:06,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:37:06,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:37:06,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:37:06,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:37:06,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (1/1) ... [2025-02-08 08:37:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:06,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:37:06,179 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:37:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:37:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:37:06,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:37:06,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:37:06,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:37:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:37:06,198 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:37:06,281 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:37:06,282 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:37:06,458 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,458 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-4: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-5: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~ret5#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: ~sum1~0 := #t~ret5#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: #t~ret5#1 := plus_#res#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: havoc plus_#res#1; [2025-02-08 08:37:06,459 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum1~0, ~bag1~0; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-5: assume false; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-7: assume false; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-9: assume false; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-11: assume false; [2025-02-08 08:37:06,460 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:37:06,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc #t~mem6#1; [2025-02-08 08:37:06,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:37:06,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-1: ~bag1~0 := #t~mem6#1; [2025-02-08 08:37:06,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: SUMMARY for call #t~mem6#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~0, 4); srcloc: null [2025-02-08 08:37:06,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: assume !(1 == #valid[~A~0.base]); [2025-02-08 08:37:06,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: assume !(4 + (~A~0.offset + 4 * ~i~0) <= #length[~A~0.base] && 0 <= ~A~0.offset + 4 * ~i~0); [2025-02-08 08:37:06,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:37:06,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-5: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-6: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-8: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-9: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-10: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc #t~ret2#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~ret2#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume #t~ret2#1 < ~cap1~0; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume !(#t~ret2#1 < ~cap1~0); [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: havoc #t~mem1#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: havoc #t~mem1#1; [2025-02-08 08:37:06,465 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-8: #t~ret2#1 := plus_#res#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post7#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~i~0 := 1 + #t~post7#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: #t~post7#1 := ~i~0; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~ret4#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~mem3#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: ~bag1~0 := #t~ret4#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: #t~ret4#1 := plus_#res#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: havoc plus_#res#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~bag1~0, #t~mem3#1; [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: SUMMARY for call #t~mem3#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~0, 4); srcloc: null [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: assume !(1 == #valid[~A~0.base]); [2025-02-08 08:37:06,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: assume !(4 + (~A~0.offset + 4 * ~i~0) <= #length[~A~0.base] && 0 <= ~A~0.offset + 4 * ~i~0); [2025-02-08 08:37:06,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-4: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-5: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: havoc #t~ret13#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: ~sum2~0 := #t~ret13#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-4: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: #t~ret13#1 := plus_#res#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-5: assume false; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: havoc plus_#res#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-7: assume false; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum2~0, ~bag2~0; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-9: assume false; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-11: assume false; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: plus_~b#1 := plus_#in~b#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: plus_~a#1 := plus_#in~a#1; [2025-02-08 08:37:06,585 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~mem14#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~bag2~0 := #t~mem14#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: SUMMARY for call #t~mem14#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~j~0, 4); srcloc: null [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: assume !(1 == #valid[~A~0.base]); [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: assume !(4 + (~A~0.offset + 4 * ~j~0) <= #length[~A~0.base] && 0 <= ~A~0.offset + 4 * ~j~0); [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-5: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-6: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-8: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-9: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-10: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: havoc assume_abort_if_not_~cond#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: havoc #t~ret10#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~ret10#1; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume #t~ret10#1 < ~cap2~0; [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume !(#t~ret10#1 < ~cap2~0); [2025-02-08 08:37:06,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: havoc #t~mem9#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: havoc #t~mem9#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-8: #t~ret10#1 := plus_#res#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc #t~post15#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: ~j~0 := 1 + #t~post15#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-2: #t~post15#1 := ~j~0; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret12#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~mem11#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: ~bag2~0 := #t~ret12#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:06,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: #t~ret12#1 := plus_#res#1; [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: havoc plus_#res#1; [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~bag2~0, #t~mem11#1; [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: SUMMARY for call #t~mem11#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~j~0, 4); srcloc: null [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: assume !(1 == #valid[~A~0.base]); [2025-02-08 08:37:06,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: assume !(4 + (~A~0.offset + 4 * ~j~0) <= #length[~A~0.base] && 0 <= ~A~0.offset + 4 * ~j~0); [2025-02-08 08:37:06,673 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:37:06,673 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:37:06,853 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:37:06,853 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:37:06,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:06 BoogieIcfgContainer [2025-02-08 08:37:06,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:37:06,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:37:06,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:37:06,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:37:06,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:37:05" (1/3) ... [2025-02-08 08:37:06,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e60837f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:06, skipping insertion in model container [2025-02-08 08:37:06,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:06" (2/3) ... [2025-02-08 08:37:06,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e60837f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:06, skipping insertion in model container [2025-02-08 08:37:06,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:06" (3/3) ... [2025-02-08 08:37:06,861 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-02-08 08:37:06,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:37:06,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-08 08:37:06,873 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:37:06,911 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:37:06,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 76 flow [2025-02-08 08:37:06,957 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2025-02-08 08:37:06,959 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:37:06,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 1/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-02-08 08:37:06,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 76 flow [2025-02-08 08:37:06,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 68 flow [2025-02-08 08:37:06,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:37:06,976 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;@3dd0053b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:37:06,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 08:37:06,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:37:06,979 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:37:06,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:37:06,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:06,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:37:06,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 685985, now seen corresponding path program 1 times [2025-02-08 08:37:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407823070] [2025-02-08 08:37:06,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:07,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:37:07,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:37:07,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:07,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:07,182 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:37:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407823070] [2025-02-08 08:37:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407823070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:07,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:37:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827462848] [2025-02-08 08:37:07,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:07,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:07,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:07,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:37:07,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:07,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:07,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:07,282 INFO L124 PetriNetUnfolderBase]: 23/73 cut-off events. [2025-02-08 08:37:07,282 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:37:07,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 73 events. 23/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 22 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 108. Up to 53 conditions per place. [2025-02-08 08:37:07,285 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 13 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2025-02-08 08:37:07,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 92 flow [2025-02-08 08:37:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-08 08:37:07,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-02-08 08:37:07,295 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 68 flow. Second operand 3 states and 56 transitions. [2025-02-08 08:37:07,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 92 flow [2025-02-08 08:37:07,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:37:07,303 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2025-02-08 08:37:07,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-02-08 08:37:07,307 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-02-08 08:37:07,308 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2025-02-08 08:37:07,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:37:07,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:07,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:37:07,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:37:07,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:07,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 685986, now seen corresponding path program 1 times [2025-02-08 08:37:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509720249] [2025-02-08 08:37:07,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:07,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:37:07,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:37:07,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:07,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:07,574 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:37:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509720249] [2025-02-08 08:37:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509720249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892083197] [2025-02-08 08:37:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:07,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:07,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:07,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:07,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:07,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:07,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:07,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:07,662 INFO L124 PetriNetUnfolderBase]: 24/76 cut-off events. [2025-02-08 08:37:07,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:37:07,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 76 events. 24/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 301 event pairs, 22 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 123. Up to 58 conditions per place. [2025-02-08 08:37:07,664 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 15 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-02-08 08:37:07,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 104 flow [2025-02-08 08:37:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-08 08:37:07,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2025-02-08 08:37:07,667 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 4 states and 72 transitions. [2025-02-08 08:37:07,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 104 flow [2025-02-08 08:37:07,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:07,669 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 81 flow [2025-02-08 08:37:07,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2025-02-08 08:37:07,670 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-02-08 08:37:07,671 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 81 flow [2025-02-08 08:37:07,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:07,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:07,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:37:07,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:37:07,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 659254481, now seen corresponding path program 1 times [2025-02-08 08:37:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535785143] [2025-02-08 08:37:07,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:07,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:37:07,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:37:07,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:07,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:07,893 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:37:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535785143] [2025-02-08 08:37:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535785143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773840706] [2025-02-08 08:37:07,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:07,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:07,897 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:37:07,898 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:37:07,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:37:07,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:37:07,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:07,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:07,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:37:07,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:07,999 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 10 treesize of output 9 [2025-02-08 08:37:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:08,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:08,285 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:37:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773840706] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:08,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:37:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554583602] [2025-02-08 08:37:08,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:37:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:08,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:37:08,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:37:08,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:08,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 81 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 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:37:08,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:08,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:08,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:08,505 INFO L124 PetriNetUnfolderBase]: 24/75 cut-off events. [2025-02-08 08:37:08,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:37:08,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 75 events. 24/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 306 event pairs, 22 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 130. Up to 54 conditions per place. [2025-02-08 08:37:08,506 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 11 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2025-02-08 08:37:08,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 113 flow [2025-02-08 08:37:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:37:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:37:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-02-08 08:37:08,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.521505376344086 [2025-02-08 08:37:08,507 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 81 flow. Second operand 6 states and 97 transitions. [2025-02-08 08:37:08,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 113 flow [2025-02-08 08:37:08,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:08,508 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 88 flow [2025-02-08 08:37:08,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2025-02-08 08:37:08,508 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-02-08 08:37:08,508 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 88 flow [2025-02-08 08:37:08,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 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:37:08,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:08,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:37:08,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:37:08,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:08,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1036436911, now seen corresponding path program 1 times [2025-02-08 08:37:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025439785] [2025-02-08 08:37:08,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:37:08,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:37:08,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:08,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:08,774 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:37:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:08,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025439785] [2025-02-08 08:37:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025439785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:08,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:08,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208111549] [2025-02-08 08:37:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:08,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:08,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:08,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-02-08 08:37:08,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:08,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:08,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-02-08 08:37:08,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:08,836 INFO L124 PetriNetUnfolderBase]: 24/71 cut-off events. [2025-02-08 08:37:08,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:37:08,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 71 events. 24/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 273 event pairs, 22 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 127. Up to 53 conditions per place. [2025-02-08 08:37:08,838 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 15 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2025-02-08 08:37:08,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 120 flow [2025-02-08 08:37:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-08 08:37:08,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2025-02-08 08:37:08,840 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 88 flow. Second operand 4 states and 61 transitions. [2025-02-08 08:37:08,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 120 flow [2025-02-08 08:37:08,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 90 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 08:37:08,842 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 60 flow [2025-02-08 08:37:08,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-02-08 08:37:08,843 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-02-08 08:37:08,843 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 60 flow [2025-02-08 08:37:08,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:08,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:08,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:37:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:37:08,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1036436910, now seen corresponding path program 1 times [2025-02-08 08:37:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634635313] [2025-02-08 08:37:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:08,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:37:08,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:37:08,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:08,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:08,896 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:37:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634635313] [2025-02-08 08:37:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634635313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522152707] [2025-02-08 08:37:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:08,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:08,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:08,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:08,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:08,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:37:08,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:08,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:08,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:08,964 INFO L124 PetriNetUnfolderBase]: 42/109 cut-off events. [2025-02-08 08:37:08,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:37:08,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 109 events. 42/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 432 event pairs, 33 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 116. Up to 49 conditions per place. [2025-02-08 08:37:08,965 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 21 selfloop transitions, 4 changer transitions 1/32 dead transitions. [2025-02-08 08:37:08,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 128 flow [2025-02-08 08:37:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-08 08:37:08,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2025-02-08 08:37:08,966 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 60 flow. Second operand 4 states and 79 transitions. [2025-02-08 08:37:08,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 128 flow [2025-02-08 08:37:08,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:08,967 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 75 flow [2025-02-08 08:37:08,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-02-08 08:37:08,968 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-02-08 08:37:08,968 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 75 flow [2025-02-08 08:37:08,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:37:08,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:08,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:08,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:37:08,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:08,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1033010493, now seen corresponding path program 1 times [2025-02-08 08:37:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:08,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805559311] [2025-02-08 08:37:08,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:37:08,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:37:08,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:09,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:09,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805559311] [2025-02-08 08:37:09,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805559311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:09,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122341476] [2025-02-08 08:37:09,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:09,115 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:37:09,116 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:37:09,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:37:09,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:37:09,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:09,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:09,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:37:09,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:09,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:09,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:37:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122341476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:09,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-08 08:37:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509685346] [2025-02-08 08:37:09,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:37:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:09,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:37:09,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:37:09,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:09,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 75 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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:37:09,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:09,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:09,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:09,464 INFO L124 PetriNetUnfolderBase]: 36/112 cut-off events. [2025-02-08 08:37:09,464 INFO L125 PetriNetUnfolderBase]: For 45/51 co-relation queries the response was YES. [2025-02-08 08:37:09,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 112 events. 36/112 cut-off events. For 45/51 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 497 event pairs, 35 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 135. Up to 52 conditions per place. [2025-02-08 08:37:09,464 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 22 selfloop transitions, 4 changer transitions 2/34 dead transitions. [2025-02-08 08:37:09,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 151 flow [2025-02-08 08:37:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:37:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:37:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-02-08 08:37:09,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6064516129032258 [2025-02-08 08:37:09,465 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 75 flow. Second operand 5 states and 94 transitions. [2025-02-08 08:37:09,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 151 flow [2025-02-08 08:37:09,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:09,466 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 76 flow [2025-02-08 08:37:09,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2025-02-08 08:37:09,467 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-02-08 08:37:09,467 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 76 flow [2025-02-08 08:37:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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:37:09,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:09,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:09,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:37:09,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:09,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:09,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:09,668 INFO L85 PathProgramCache]: Analyzing trace with hash 402206681, now seen corresponding path program 1 times [2025-02-08 08:37:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:09,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368170198] [2025-02-08 08:37:09,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:09,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:37:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:37:09,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:09,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:09,741 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:37:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368170198] [2025-02-08 08:37:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368170198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647555799] [2025-02-08 08:37:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:09,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:09,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:09,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:09,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:37:09,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:09,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:09,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:09,801 INFO L124 PetriNetUnfolderBase]: 31/95 cut-off events. [2025-02-08 08:37:09,801 INFO L125 PetriNetUnfolderBase]: For 43/49 co-relation queries the response was YES. [2025-02-08 08:37:09,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 95 events. 31/95 cut-off events. For 43/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 394 event pairs, 22 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 132. Up to 42 conditions per place. [2025-02-08 08:37:09,802 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 4 changer transitions 1/32 dead transitions. [2025-02-08 08:37:09,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 153 flow [2025-02-08 08:37:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-08 08:37:09,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2025-02-08 08:37:09,803 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 76 flow. Second operand 4 states and 79 transitions. [2025-02-08 08:37:09,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 153 flow [2025-02-08 08:37:09,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:37:09,804 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2025-02-08 08:37:09,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-02-08 08:37:09,805 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-02-08 08:37:09,805 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2025-02-08 08:37:09,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:37:09,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:09,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:09,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:37:09,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:09,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -599973878, now seen corresponding path program 1 times [2025-02-08 08:37:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370382188] [2025-02-08 08:37:09,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:09,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:37:09,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:37:09,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:09,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370382188] [2025-02-08 08:37:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370382188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071703592] [2025-02-08 08:37:09,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:09,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:09,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:09,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:37:09,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:37:09,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:37:09,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:09,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:09,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:37:09,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:10,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:10,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 08:37:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071703592] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:10,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:10,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-08 08:37:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451291853] [2025-02-08 08:37:10,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:10,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:37:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:10,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:37:10,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:37:10,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31 [2025-02-08 08:37:10,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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:37:10,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:10,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31 [2025-02-08 08:37:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:10,290 INFO L124 PetriNetUnfolderBase]: 23/80 cut-off events. [2025-02-08 08:37:10,291 INFO L125 PetriNetUnfolderBase]: For 62/67 co-relation queries the response was YES. [2025-02-08 08:37:10,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 80 events. 23/80 cut-off events. For 62/67 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 308 event pairs, 22 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 115. Up to 37 conditions per place. [2025-02-08 08:37:10,291 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 21 selfloop transitions, 4 changer transitions 1/31 dead transitions. [2025-02-08 08:37:10,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 156 flow [2025-02-08 08:37:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:37:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:37:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-02-08 08:37:10,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5935483870967742 [2025-02-08 08:37:10,293 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 5 states and 92 transitions. [2025-02-08 08:37:10,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 156 flow [2025-02-08 08:37:10,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:10,294 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 89 flow [2025-02-08 08:37:10,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2025-02-08 08:37:10,294 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-02-08 08:37:10,294 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 89 flow [2025-02-08 08:37:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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:37:10,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:10,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:10,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:37:10,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:10,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:37:10,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -568308497, now seen corresponding path program 1 times [2025-02-08 08:37:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049569814] [2025-02-08 08:37:10,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:10,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:10,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:37:10,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:37:10,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:10,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:10,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049569814] [2025-02-08 08:37:10,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049569814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:10,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:10,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:37:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978274342] [2025-02-08 08:37:10,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:10,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:37:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:10,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:37:10,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:37:10,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 31 [2025-02-08 08:37:10,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:37:10,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:10,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 31 [2025-02-08 08:37:10,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:10,658 INFO L124 PetriNetUnfolderBase]: 17/62 cut-off events. [2025-02-08 08:37:10,658 INFO L125 PetriNetUnfolderBase]: For 54/58 co-relation queries the response was YES. [2025-02-08 08:37:10,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 62 events. 17/62 cut-off events. For 54/58 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 201 event pairs, 16 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 80. Up to 48 conditions per place. [2025-02-08 08:37:10,659 INFO L140 encePairwiseOnDemand]: 29/31 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2025-02-08 08:37:10,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 119 flow [2025-02-08 08:37:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-08 08:37:10,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2025-02-08 08:37:10,660 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 89 flow. Second operand 3 states and 55 transitions. [2025-02-08 08:37:10,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 119 flow [2025-02-08 08:37:10,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:37:10,660 INFO L231 Difference]: Finished difference. Result has 33 places, 0 transitions, 0 flow [2025-02-08 08:37:10,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=33, PETRI_TRANSITIONS=0} [2025-02-08 08:37:10,661 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-02-08 08:37:10,661 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 0 transitions, 0 flow [2025-02-08 08:37:10,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 14 remaining) [2025-02-08 08:37:10,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-08 08:37:10,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-02-08 08:37:10,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-02-08 08:37:10,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-02-08 08:37:10,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-08 08:37:10,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-08 08:37:10,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-02-08 08:37:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:37:10,664 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:10,667 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:37:10,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:37:10,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:37:10 BasicIcfg [2025-02-08 08:37:10,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:37:10,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:37:10,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:37:10,671 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:37:10,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:06" (3/4) ... [2025-02-08 08:37:10,673 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:37:10,674 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:37:10,674 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:37:10,677 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2025-02-08 08:37:10,677 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-02-08 08:37:10,678 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 08:37:10,678 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 08:37:10,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:37:10,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:37:10,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:37:10,730 INFO L158 Benchmark]: Toolchain (without parser) took 4851.93ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 105.7MB in the beginning and 303.4MB in the end (delta: -197.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.80ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.80ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: Boogie Preprocessor took 38.59ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: IcfgBuilder took 705.65ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: TraceAbstraction took 3815.71ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 85.7MB in the beginning and 310.6MB in the end (delta: -224.9MB). Peak memory consumption was 174.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:10,731 INFO L158 Benchmark]: Witness Printer took 58.84ms. Allocated memory is still 352.3MB. Free memory was 310.6MB in the beginning and 303.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:10,732 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.80ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.80ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.59ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 705.65ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3815.71ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 85.7MB in the beginning and 310.6MB in the end (delta: -224.9MB). Peak memory consumption was 174.4MB. Max. memory is 16.1GB. * Witness Printer took 58.84ms. Allocated memory is still 352.3MB. Free memory was 310.6MB in the beginning and 303.4MB in the end (delta: 7.1MB). 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: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 79]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 14 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: 3.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 869 IncrementalHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 5 mSDtfsCounter, 869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=8, InterpolantAutomatonStates: 38, 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.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 94 ConstructedInterpolants, 1 QuantifiedInterpolants, 1190 SizeOfPredicates, 33 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 18/35 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:37:10,742 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