./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.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/goblint-regression/28-race_reach_70-funloop_racefree.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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:30:23,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:30:23,485 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:30:23,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:30:23,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:30:23,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:30:23,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:30:23,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:30:23,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:30:23,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:30:23,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:30:23,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:30:23,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:30:23,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:30:23,514 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:30:23,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:30:23,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:30:23,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:30:23,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:30:23,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:30:23,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:30:23,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:30:23,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:30:23,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:30:23,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:30:23,517 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-02-06 04:30:23,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:30:23,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:30:23,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:30:23,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:30:23,749 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:30:23,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-02-06 04:30:24,878 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/362be4674/f0585e0efdce4f61aa161a15f23b72d9/FLAGd0f22b75a [2025-02-06 04:30:25,181 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:30:25,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-02-06 04:30:25,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/362be4674/f0585e0efdce4f61aa161a15f23b72d9/FLAGd0f22b75a [2025-02-06 04:30:25,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/362be4674/f0585e0efdce4f61aa161a15f23b72d9 [2025-02-06 04:30:25,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:30:25,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:30:25,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:30:25,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:30:25,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:30:25,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c60e3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25, skipping insertion in model container [2025-02-06 04:30:25,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:30:25,817 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/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-02-06 04:30:25,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:30:25,859 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:30:25,890 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/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-02-06 04:30:25,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:30:25,939 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:30:25,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25 WrapperNode [2025-02-06 04:30:25,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:30:25,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:30:25,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:30:25,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:30:25,944 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:30:25" (1/1) ... [2025-02-06 04:30:25,953 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:30:25" (1/1) ... [2025-02-06 04:30:25,967 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 252 [2025-02-06 04:30:25,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:30:25,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:30:25,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:30:25,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:30:25,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,988 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-02-06 04:30:25,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:30:25,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:30:25,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:30:25,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:30:25,999 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:26,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:30:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:26,025 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:30:26,029 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:30:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:30:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 04:30:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:30:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:30:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:30:26,047 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:30:26,157 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:30:26,159 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:30:26,401 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 04:30:26,401 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 04:30:26,476 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:30:26,477 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:30:26,786 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:30:26,787 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:30:26,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:30:26 BoogieIcfgContainer [2025-02-06 04:30:26,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:30:26,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:30:26,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:30:26,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:30:26,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:30:25" (1/3) ... [2025-02-06 04:30:26,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d3f48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:30:26, skipping insertion in model container [2025-02-06 04:30:26,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25" (2/3) ... [2025-02-06 04:30:26,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d3f48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:30:26, skipping insertion in model container [2025-02-06 04:30:26,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:30:26" (3/3) ... [2025-02-06 04:30:26,794 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-02-06 04:30:26,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:30:26,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 75 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-02-06 04:30:26,807 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:30:26,845 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 04:30:26,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 103 transitions, 213 flow [2025-02-06 04:30:26,919 INFO L124 PetriNetUnfolderBase]: 41/152 cut-off events. [2025-02-06 04:30:26,922 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:30:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 152 events. 41/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 588 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 96. Up to 8 conditions per place. [2025-02-06 04:30:26,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 103 transitions, 213 flow [2025-02-06 04:30:26,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 101 transitions, 206 flow [2025-02-06 04:30:26,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:26,949 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;@353b3d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:26,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:30:26,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:26,959 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-02-06 04:30:26,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:26,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:26,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 04:30:26,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:30:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash 320103984, now seen corresponding path program 1 times [2025-02-06 04:30:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070717192] [2025-02-06 04:30:26,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:27,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 04:30:27,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 04:30:27,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:27,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:27,177 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:30:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070717192] [2025-02-06 04:30:27,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070717192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:27,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:27,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792610418] [2025-02-06 04:30:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:27,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:27,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:27,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:27,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 103 [2025-02-06 04:30:27,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 101 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:30:27,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:27,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 103 [2025-02-06 04:30:27,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:27,474 INFO L124 PetriNetUnfolderBase]: 483/1407 cut-off events. [2025-02-06 04:30:27,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:27,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 1407 events. 483/1407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9309 event pairs, 396 based on Foata normal form. 423/1657 useless extension candidates. Maximal degree in co-relation 2244. Up to 909 conditions per place. [2025-02-06 04:30:27,488 INFO L140 encePairwiseOnDemand]: 78/103 looper letters, 45 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2025-02-06 04:30:27,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 258 flow [2025-02-06 04:30:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:30:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:30:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-02-06 04:30:27,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469255663430421 [2025-02-06 04:30:27,499 INFO L175 Difference]: Start difference. First operand has 77 places, 101 transitions, 206 flow. Second operand 3 states and 169 transitions. [2025-02-06 04:30:27,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 258 flow [2025-02-06 04:30:27,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 80 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:30:27,508 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 174 flow [2025-02-06 04:30:27,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2025-02-06 04:30:27,514 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-06 04:30:27,515 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 174 flow [2025-02-06 04:30:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:30:27,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:27,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:27,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:30:27,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:30:27,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 89723315, now seen corresponding path program 1 times [2025-02-06 04:30:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437722301] [2025-02-06 04:30:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:27,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:30:27,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:30:27,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:27,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:27,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437722301] [2025-02-06 04:30:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437722301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036963202] [2025-02-06 04:30:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:27,617 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-06 04:30:27,619 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-06 04:30:27,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:30:27,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:30:27,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:27,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:27,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:30:27,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:27,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036963202] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:27,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:30:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264065532] [2025-02-06 04:30:27,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:27,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:30:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:27,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:30:27,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:30:27,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 103 [2025-02-06 04:30:27,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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:30:27,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:27,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 103 [2025-02-06 04:30:27,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:28,004 INFO L124 PetriNetUnfolderBase]: 483/1410 cut-off events. [2025-02-06 04:30:28,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:28,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 1410 events. 483/1410 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9299 event pairs, 396 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 2325. Up to 909 conditions per place. [2025-02-06 04:30:28,012 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 45 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2025-02-06 04:30:28,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 286 flow [2025-02-06 04:30:28,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:30:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:30:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 251 transitions. [2025-02-06 04:30:28,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40614886731391586 [2025-02-06 04:30:28,014 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 174 flow. Second operand 6 states and 251 transitions. [2025-02-06 04:30:28,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 286 flow [2025-02-06 04:30:28,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 282 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:28,016 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 206 flow [2025-02-06 04:30:28,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2025-02-06 04:30:28,017 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 10 predicate places. [2025-02-06 04:30:28,017 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 206 flow [2025-02-06 04:30:28,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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:30:28,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:28,018 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:28,025 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-06 04:30:28,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:28,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:30:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash -727404816, now seen corresponding path program 2 times [2025-02-06 04:30:28,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:28,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634752732] [2025-02-06 04:30:28,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:28,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:30:28,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:28,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634752732] [2025-02-06 04:30:28,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634752732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958087946] [2025-02-06 04:30:28,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:28,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:28,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:28,369 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-06 04:30:28,371 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-06 04:30:28,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:30:28,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:28,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:28,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:28,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:30:28,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958087946] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:28,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:28,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:30:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015602531] [2025-02-06 04:30:28,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:28,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:30:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:30:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:30:28,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 103 [2025-02-06 04:30:28,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 206 flow. Second operand has 13 states, 13 states have (on average 34.30769230769231) internal successors, (446), 13 states have internal predecessors, (446), 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:30:28,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:28,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 103 [2025-02-06 04:30:28,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:28,756 INFO L124 PetriNetUnfolderBase]: 483/1416 cut-off events. [2025-02-06 04:30:28,756 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 04:30:28,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 1416 events. 483/1416 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9280 event pairs, 396 based on Foata normal form. 6/1250 useless extension candidates. Maximal degree in co-relation 2316. Up to 909 conditions per place. [2025-02-06 04:30:28,765 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 45 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2025-02-06 04:30:28,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 354 flow [2025-02-06 04:30:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:30:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:30:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 458 transitions. [2025-02-06 04:30:28,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3705501618122977 [2025-02-06 04:30:28,769 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 206 flow. Second operand 12 states and 458 transitions. [2025-02-06 04:30:28,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 89 transitions, 354 flow [2025-02-06 04:30:28,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 89 transitions, 340 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:28,774 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 276 flow [2025-02-06 04:30:28,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=276, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2025-02-06 04:30:28,774 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 26 predicate places. [2025-02-06 04:30:28,774 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 276 flow [2025-02-06 04:30:28,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.30769230769231) internal successors, (446), 13 states have internal predecessors, (446), 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:30:28,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:28,775 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:28,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:30:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:28,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:30:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1120819184, now seen corresponding path program 3 times [2025-02-06 04:30:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175842586] [2025-02-06 04:30:28,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:29,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-02-06 04:30:29,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:30:29,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 04:30:29,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:29,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:30:29,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:30:29,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:30:29,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:29,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:29,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:30:29,090 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:30:29,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-06 04:30:29,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-06 04:30:29,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-06 04:30:29,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-06 04:30:29,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:30:29,093 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:30:29,095 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:30:29,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:30:29,130 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:30:29,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 151 transitions, 318 flow [2025-02-06 04:30:29,152 INFO L124 PetriNetUnfolderBase]: 69/256 cut-off events. [2025-02-06 04:30:29,152 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 04:30:29,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 256 events. 69/256 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1231 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 154. Up to 12 conditions per place. [2025-02-06 04:30:29,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 151 transitions, 318 flow [2025-02-06 04:30:29,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 151 transitions, 318 flow [2025-02-06 04:30:29,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:29,157 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;@353b3d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:29,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:30:29,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:29,165 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2025-02-06 04:30:29,165 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:30:29,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:29,165 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:29,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:29,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash -471073629, now seen corresponding path program 1 times [2025-02-06 04:30:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796382080] [2025-02-06 04:30:29,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:30:29,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:30:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:29,211 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:30:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796382080] [2025-02-06 04:30:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796382080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805428945] [2025-02-06 04:30:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:29,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:29,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:29,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:29,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:29,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-02-06 04:30:29,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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:30:29,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:29,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-02-06 04:30:29,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:31,730 INFO L124 PetriNetUnfolderBase]: 18464/37669 cut-off events. [2025-02-06 04:30:31,730 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-06 04:30:31,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64300 conditions, 37669 events. 18464/37669 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 369422 event pairs, 15876 based on Foata normal form. 12597/45496 useless extension candidates. Maximal degree in co-relation 52133. Up to 26528 conditions per place. [2025-02-06 04:30:32,036 INFO L140 encePairwiseOnDemand]: 115/151 looper letters, 68 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2025-02-06 04:30:32,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 394 flow [2025-02-06 04:30:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:30:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:30:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-02-06 04:30:32,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5540838852097131 [2025-02-06 04:30:32,039 INFO L175 Difference]: Start difference. First operand has 114 places, 151 transitions, 318 flow. Second operand 3 states and 251 transitions. [2025-02-06 04:30:32,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 394 flow [2025-02-06 04:30:32,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 119 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:30:32,044 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 264 flow [2025-02-06 04:30:32,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2025-02-06 04:30:32,045 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2025-02-06 04:30:32,046 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 264 flow [2025-02-06 04:30:32,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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:30:32,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:32,047 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:32,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:30:32,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:32,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1140560361, now seen corresponding path program 1 times [2025-02-06 04:30:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321085939] [2025-02-06 04:30:32,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:32,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321085939] [2025-02-06 04:30:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321085939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235413158] [2025-02-06 04:30:32,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:32,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:32,117 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-06 04:30:32,118 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-06 04:30:32,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:32,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:32,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:32,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:32,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:30:32,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:32,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235413158] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:32,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:30:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858960439] [2025-02-06 04:30:32,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:32,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:30:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:32,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:30:32,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:30:32,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-02-06 04:30:32,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 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:30:32,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:32,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-02-06 04:30:32,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:34,060 INFO L124 PetriNetUnfolderBase]: 18464/37672 cut-off events. [2025-02-06 04:30:34,060 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-06 04:30:34,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64316 conditions, 37672 events. 18464/37672 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 369331 event pairs, 15876 based on Foata normal form. 0/32902 useless extension candidates. Maximal degree in co-relation 64303. Up to 26528 conditions per place. [2025-02-06 04:30:34,281 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 68 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2025-02-06 04:30:34,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 422 flow [2025-02-06 04:30:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:30:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:30:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-02-06 04:30:34,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4083885209713024 [2025-02-06 04:30:34,283 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 264 flow. Second operand 6 states and 370 transitions. [2025-02-06 04:30:34,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 422 flow [2025-02-06 04:30:34,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 418 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:34,286 INFO L231 Difference]: Finished difference. Result has 124 places, 122 transitions, 296 flow [2025-02-06 04:30:34,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=124, PETRI_TRANSITIONS=122} [2025-02-06 04:30:34,287 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 10 predicate places. [2025-02-06 04:30:34,287 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 122 transitions, 296 flow [2025-02-06 04:30:34,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 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:30:34,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:34,287 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:34,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:30:34,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:34,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:34,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1597421987, now seen corresponding path program 2 times [2025-02-06 04:30:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82914324] [2025-02-06 04:30:34,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:34,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:30:34,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:30:34,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:34,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:34,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:34,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82914324] [2025-02-06 04:30:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82914324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:34,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289875025] [2025-02-06 04:30:34,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:34,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:34,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:34,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:30:34,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:30:34,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:30:34,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:30:34,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:34,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:30:34,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:34,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:34,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289875025] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:34,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:34,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:30:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501500605] [2025-02-06 04:30:34,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:34,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:30:34,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:34,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:30:34,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:30:34,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-02-06 04:30:34,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 122 transitions, 296 flow. Second operand has 13 states, 13 states have (on average 50.38461538461539) internal successors, (655), 13 states have internal predecessors, (655), 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:30:34,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:34,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-02-06 04:30:34,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:36,899 INFO L124 PetriNetUnfolderBase]: 18464/37678 cut-off events. [2025-02-06 04:30:36,900 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-02-06 04:30:36,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64353 conditions, 37678 events. 18464/37678 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 369466 event pairs, 15876 based on Foata normal form. 6/32915 useless extension candidates. Maximal degree in co-relation 64294. Up to 26528 conditions per place. [2025-02-06 04:30:37,069 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 68 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2025-02-06 04:30:37,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 490 flow [2025-02-06 04:30:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:30:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:30:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 673 transitions. [2025-02-06 04:30:37,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37141280353200884 [2025-02-06 04:30:37,074 INFO L175 Difference]: Start difference. First operand has 124 places, 122 transitions, 296 flow. Second operand 12 states and 673 transitions. [2025-02-06 04:30:37,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 490 flow [2025-02-06 04:30:37,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 128 transitions, 476 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:37,077 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 366 flow [2025-02-06 04:30:37,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=366, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2025-02-06 04:30:37,077 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2025-02-06 04:30:37,077 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 366 flow [2025-02-06 04:30:37,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.38461538461539) internal successors, (655), 13 states have internal predecessors, (655), 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:30:37,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:37,078 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:37,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:30:37,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 04:30:37,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:37,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 269657379, now seen corresponding path program 3 times [2025-02-06 04:30:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:37,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745057369] [2025-02-06 04:30:37,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:37,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-02-06 04:30:37,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:30:37,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 04:30:37,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:37,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:30:37,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:30:37,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:30:37,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:37,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:37,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:30:37,358 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:30:37,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:30:37,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:30:37,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-06 04:30:37,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:30:37,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:30:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:30:37,359 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:30:37,359 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:30:37,359 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 04:30:37,388 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:30:37,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 199 transitions, 425 flow [2025-02-06 04:30:37,409 INFO L124 PetriNetUnfolderBase]: 100/371 cut-off events. [2025-02-06 04:30:37,410 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 04:30:37,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 371 events. 100/371 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1991 event pairs, 1 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 265. Up to 16 conditions per place. [2025-02-06 04:30:37,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 199 transitions, 425 flow [2025-02-06 04:30:37,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 199 transitions, 425 flow [2025-02-06 04:30:37,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:37,416 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;@353b3d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:37,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:30:37,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:37,420 INFO L124 PetriNetUnfolderBase]: 17/105 cut-off events. [2025-02-06 04:30:37,420 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 04:30:37,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:37,420 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:37,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-06 04:30:37,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1856482381, now seen corresponding path program 1 times [2025-02-06 04:30:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748549528] [2025-02-06 04:30:37,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:37,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:30:37,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:30:37,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:37,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:37,448 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:30:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748549528] [2025-02-06 04:30:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748549528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:37,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593162575] [2025-02-06 04:30:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:37,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:37,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:37,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 199 [2025-02-06 04:30:37,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 199 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:30:37,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:37,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 199 [2025-02-06 04:30:37,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand