./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:26:37,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:26:37,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:26:37,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:26:37,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:26:37,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:26:37,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:26:37,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:26:37,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:26:37,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:26:37,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:26:37,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:26:37,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:26:37,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:26:37,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:26:37,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:26:37,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:26:37,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:26:37,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:26:37,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:26:37,787 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 ! call(reach_error())) ) 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2025-02-06 04:26:38,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:26:38,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:26:38,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:26:38,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:26:38,049 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:26:38,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-02-06 04:26:39,213 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3635ae768/59cf9990e28349b1bd10705c0a9003ab/FLAGfa0e09975 [2025-02-06 04:26:39,573 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:26:39,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-02-06 04:26:39,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3635ae768/59cf9990e28349b1bd10705c0a9003ab/FLAGfa0e09975 [2025-02-06 04:26:39,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3635ae768/59cf9990e28349b1bd10705c0a9003ab [2025-02-06 04:26:39,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:26:39,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:26:39,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:26:39,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:26:39,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:26:39,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:26:39" (1/1) ... [2025-02-06 04:26:39,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:39, skipping insertion in model container [2025-02-06 04:26:39,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:26:39" (1/1) ... [2025-02-06 04:26:39,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:26:40,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i[186287,186300] [2025-02-06 04:26:40,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:26:40,088 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:26:40,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i[186287,186300] [2025-02-06 04:26:40,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:26:40,161 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:26:40,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40 WrapperNode [2025-02-06 04:26:40,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:26:40,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:26:40,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:26:40,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:26:40,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,202 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2025-02-06 04:26:40,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:26:40,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:26:40,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:26:40,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:26:40,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,223 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2025-02-06 04:26:40,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:26:40,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:26:40,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:26:40,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:26:40,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (1/1) ... [2025-02-06 04:26:40,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:26:40,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:26:40,272 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-06 04:26:40,277 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-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-02-06 04:26:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:26:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:26:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:26:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:26:40,294 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:26:40,497 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:26:40,499 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:26:40,729 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:26:40,730 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:26:40,883 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:26:40,883 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:26:40,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:26:40 BoogieIcfgContainer [2025-02-06 04:26:40,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:26:40,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:26:40,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:26:40,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:26:40,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:26:39" (1/3) ... [2025-02-06 04:26:40,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a610a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:26:40, skipping insertion in model container [2025-02-06 04:26:40,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:40" (2/3) ... [2025-02-06 04:26:40,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a610a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:26:40, skipping insertion in model container [2025-02-06 04:26:40,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:26:40" (3/3) ... [2025-02-06 04:26:40,892 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2025-02-06 04:26:40,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:26:40,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_4-container_of.i that has 2 procedures, 47 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-06 04:26:40,905 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:26:40,954 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:26:40,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 138 flow [2025-02-06 04:26:41,001 INFO L124 PetriNetUnfolderBase]: 8/81 cut-off events. [2025-02-06 04:26:41,005 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:26:41,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 8/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 226 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2025-02-06 04:26:41,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 62 transitions, 138 flow [2025-02-06 04:26:41,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 122 flow [2025-02-06 04:26:41,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:26:41,022 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=LoopHeads, 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;@748e4983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:26:41,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 04:26:41,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:26:41,029 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-02-06 04:26:41,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:26:41,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:41,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:41,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:41,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1009847432, now seen corresponding path program 1 times [2025-02-06 04:26:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646934620] [2025-02-06 04:26:41,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:41,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:26:41,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:26:41,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:41,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:41,496 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-06 04:26:41,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646934620] [2025-02-06 04:26:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646934620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:41,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:41,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:26:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187518600] [2025-02-06 04:26:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:41,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:26:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:41,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:26:41,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:26:41,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-02-06 04:26:41,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06 04:26:41,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:41,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-02-06 04:26:41,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:41,940 INFO L124 PetriNetUnfolderBase]: 1534/2552 cut-off events. [2025-02-06 04:26:41,940 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 04:26:41,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5068 conditions, 2552 events. 1534/2552 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13176 event pairs, 1309 based on Foata normal form. 2/2407 useless extension candidates. Maximal degree in co-relation 4939. Up to 2130 conditions per place. [2025-02-06 04:26:41,961 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 52 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-02-06 04:26:41,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 256 flow [2025-02-06 04:26:41,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:26:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:26:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-02-06 04:26:41,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2025-02-06 04:26:41,975 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 3 states and 91 transitions. [2025-02-06 04:26:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 256 flow [2025-02-06 04:26:41,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:26:41,987 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 116 flow [2025-02-06 04:26:41,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-02-06 04:26:41,993 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2025-02-06 04:26:41,993 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 116 flow [2025-02-06 04:26:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06 04:26:41,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:41,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:41,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:26:41,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:41,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1009873539, now seen corresponding path program 1 times [2025-02-06 04:26:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:41,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611707699] [2025-02-06 04:26:41,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:26:42,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:26:42,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:42,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:42,128 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-06 04:26:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611707699] [2025-02-06 04:26:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611707699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:26:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189991005] [2025-02-06 04:26:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:26:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:42,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:26:42,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:26:42,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-06 04:26:42,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:42,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:42,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-06 04:26:42,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:42,452 INFO L124 PetriNetUnfolderBase]: 1309/2210 cut-off events. [2025-02-06 04:26:42,453 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-02-06 04:26:42,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 2210 events. 1309/2210 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11449 event pairs, 1309 based on Foata normal form. 1/2076 useless extension candidates. Maximal degree in co-relation 3567. Up to 2119 conditions per place. [2025-02-06 04:26:42,466 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-02-06 04:26:42,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 208 flow [2025-02-06 04:26:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:26:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:26:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-06 04:26:42,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2025-02-06 04:26:42,468 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 116 flow. Second operand 4 states and 114 transitions. [2025-02-06 04:26:42,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 208 flow [2025-02-06 04:26:42,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:26:42,472 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 117 flow [2025-02-06 04:26:42,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-02-06 04:26:42,473 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2025-02-06 04:26:42,473 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 117 flow [2025-02-06 04:26:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:42,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:42,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:26:42,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -199181831, now seen corresponding path program 1 times [2025-02-06 04:26:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045829516] [2025-02-06 04:26:42,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:42,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:26:42,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:26:42,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:42,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:42,709 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-06 04:26:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045829516] [2025-02-06 04:26:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045829516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:42,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:42,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:26:42,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799366499] [2025-02-06 04:26:42,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:42,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:26:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:42,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:26:42,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:26:42,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-02-06 04:26:42,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 117 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-06 04:26:42,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:42,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-02-06 04:26:42,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:43,003 INFO L124 PetriNetUnfolderBase]: 1781/3024 cut-off events. [2025-02-06 04:26:43,004 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-02-06 04:26:43,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6108 conditions, 3024 events. 1781/3024 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16745 event pairs, 1209 based on Foata normal form. 121/3009 useless extension candidates. Maximal degree in co-relation 6089. Up to 2067 conditions per place. [2025-02-06 04:26:43,022 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 62 selfloop transitions, 8 changer transitions 5/81 dead transitions. [2025-02-06 04:26:43,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 327 flow [2025-02-06 04:26:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:26:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:26:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-06 04:26:43,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-02-06 04:26:43,024 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 117 flow. Second operand 4 states and 116 transitions. [2025-02-06 04:26:43,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 327 flow [2025-02-06 04:26:43,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:26:43,027 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 150 flow [2025-02-06 04:26:43,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-02-06 04:26:43,027 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-02-06 04:26:43,028 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 150 flow [2025-02-06 04:26:43,028 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-06 04:26:43,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:43,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:43,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:26:43,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2055717915, now seen corresponding path program 1 times [2025-02-06 04:26:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976009862] [2025-02-06 04:26:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:26:43,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:26:43,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:43,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:43,219 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-06 04:26:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976009862] [2025-02-06 04:26:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976009862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:26:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077009882] [2025-02-06 04:26:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:43,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:26:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:43,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:26:43,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:26:43,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-06 04:26:43,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06 04:26:43,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:43,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-06 04:26:43,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:43,482 INFO L124 PetriNetUnfolderBase]: 1768/3072 cut-off events. [2025-02-06 04:26:43,482 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2025-02-06 04:26:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7004 conditions, 3072 events. 1768/3072 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17927 event pairs, 926 based on Foata normal form. 0/2892 useless extension candidates. Maximal degree in co-relation 5915. Up to 2102 conditions per place. [2025-02-06 04:26:43,499 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 55 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2025-02-06 04:26:43,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 328 flow [2025-02-06 04:26:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:26:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:26:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-02-06 04:26:43,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2025-02-06 04:26:43,501 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 150 flow. Second operand 3 states and 113 transitions. [2025-02-06 04:26:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 328 flow [2025-02-06 04:26:43,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 311 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 04:26:43,508 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 195 flow [2025-02-06 04:26:43,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2025-02-06 04:26:43,509 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2025-02-06 04:26:43,509 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 195 flow [2025-02-06 04:26:43,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06 04:26:43,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:43,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:43,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:26:43,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:43,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 697254480, now seen corresponding path program 1 times [2025-02-06 04:26:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901671842] [2025-02-06 04:26:43,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:43,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:26:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:26:43,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:43,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:43,663 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-06 04:26:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901671842] [2025-02-06 04:26:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901671842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:26:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692915886] [2025-02-06 04:26:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:26:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:43,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:26:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:26:43,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-02-06 04:26:43,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:43,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:43,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-02-06 04:26:43,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:43,935 INFO L124 PetriNetUnfolderBase]: 2086/3618 cut-off events. [2025-02-06 04:26:43,936 INFO L125 PetriNetUnfolderBase]: For 2170/2170 co-relation queries the response was YES. [2025-02-06 04:26:43,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9247 conditions, 3618 events. 2086/3618 cut-off events. For 2170/2170 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21573 event pairs, 1176 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 3014. Up to 2485 conditions per place. [2025-02-06 04:26:43,954 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 59 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2025-02-06 04:26:43,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 437 flow [2025-02-06 04:26:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:26:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:26:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-06 04:26:43,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-02-06 04:26:43,956 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 195 flow. Second operand 3 states and 112 transitions. [2025-02-06 04:26:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 437 flow [2025-02-06 04:26:43,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 397 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 04:26:43,963 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 289 flow [2025-02-06 04:26:43,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2025-02-06 04:26:43,963 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-06 04:26:43,963 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 289 flow [2025-02-06 04:26:43,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:43,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:43,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:43,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:26:43,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1945161825, now seen corresponding path program 1 times [2025-02-06 04:26:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105841870] [2025-02-06 04:26:43,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:43,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:26:44,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:26:44,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:44,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:26:44,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:26:44,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:26:44,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:26:44,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:44,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:26:44,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:26:44,048 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:26:44,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-02-06 04:26:44,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-02-06 04:26:44,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-02-06 04:26:44,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-02-06 04:26:44,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-02-06 04:26:44,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-02-06 04:26:44,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-02-06 04:26:44,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-02-06 04:26:44,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:26:44,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 04:26:44,082 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:26:44,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:26:44,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:26:44 BasicIcfg [2025-02-06 04:26:44,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:26:44,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:26:44,087 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:26:44,087 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:26:44,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:26:40" (3/4) ... [2025-02-06 04:26:44,089 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:26:44,135 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-02-06 04:26:44,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:26:44,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:26:44,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:26:44,178 INFO L158 Benchmark]: Toolchain (without parser) took 4387.56ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 102.9MB in the beginning and 275.5MB in the end (delta: -172.7MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-02-06 04:26:44,178 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:44,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.35ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 71.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:26:44,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.66ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 69.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:44,180 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 65.3MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:26:44,180 INFO L158 Benchmark]: IcfgBuilder took 643.59ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 93.6MB in the end (delta: -28.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-02-06 04:26:44,180 INFO L158 Benchmark]: TraceAbstraction took 3200.92ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 92.9MB in the beginning and 287.6MB in the end (delta: -194.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:44,180 INFO L158 Benchmark]: Witness Printer took 89.72ms. Allocated memory is still 343.9MB. Free memory was 287.6MB in the beginning and 275.5MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:26:44,181 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.35ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 71.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.66ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 69.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 65.3MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 643.59ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 93.6MB in the end (delta: -28.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3200.92ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 92.9MB in the beginning and 287.6MB in the end (delta: -194.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 89.72ms. Allocated memory is still 343.9MB. Free memory was 287.6MB in the beginning and 275.5MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:24}, \old(data)={6:0}, d={6:24}, data={6:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:24}, \old(data)={6:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, res=0, t1=-1, t2=0] [L3931] 0 return 0; VAL [\old(arg)={6:24}, \old(data)={6:0}, \result=0, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, res=0, t1=-1, t2=0] [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={6:24}, \old(data)={6:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, status={5:0}, t1=-1, t2=0] [L3940] 0 data->shared.a = 3 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3943] 0 data->shared.b = 3 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3946] EXPR 0 data->shared.a [L3946] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\old(arg)={6:24}, \old(expression)=0, arg={6:24}, data={6:0}, dev={6:24}, expression=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 67 locations, 8 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.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 11 mSDtfsCounter, 532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 0.9s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:26:44,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE