./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:34:27,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:34:27,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:34:27,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:34:27,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:34:27,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:34:27,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:34:27,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:34:27,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:34:27,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:34:27,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:34:27,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:34:27,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:34:27,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:34:27,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:34:27,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:34:27,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:34:27,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:34:27,612 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 ! data-race) ) 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-02-08 05:34:27,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:34:27,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:34:27,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:34:27,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:34:27,866 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:34:27,867 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_19-callback_racing.i [2025-02-08 05:34:29,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8e073c5/245aaccdec744e3385b52927b474b711/FLAG99e8b4314 [2025-02-08 05:34:29,373 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:34:29,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-02-08 05:34:29,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8e073c5/245aaccdec744e3385b52927b474b711/FLAG99e8b4314 [2025-02-08 05:34:29,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8e073c5/245aaccdec744e3385b52927b474b711 [2025-02-08 05:34:29,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:34:29,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:34:29,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:34:29,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:34:29,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:34:29,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557354a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29, skipping insertion in model container [2025-02-08 05:34:29,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:34:29,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:34:29,677 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:34:29,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:34:29,754 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:34:29,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29 WrapperNode [2025-02-08 05:34:29,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:34:29,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:34:29,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:34:29,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:34:29,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,789 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 161 [2025-02-08 05:34:29,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:34:29,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:34:29,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:34:29,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:34:29,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:34:29,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:34:29,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:34:29,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:34:29,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (1/1) ... [2025-02-08 05:34:29,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:34:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:34:29,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:34:29,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:34:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:34:29,862 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:34:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:34:29,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:34:29,863 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:34:29,969 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:34:29,971 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:34:30,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume { :end_inline_##fun~~TO~int } true;assume -2147483648 <= foo_#t~ret4#1 && foo_#t~ret4#1 <= 2147483647; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: havoc ##fun~~TO~int_#t~ret27#1; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: havoc ##fun~~TO~int_#in~#fp#1.base, ##fun~~TO~int_#in~#fp#1.offset; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: ##fun~~TO~int_#res#1 := ##fun~~TO~int_#t~ret27#1; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: havoc ##fun~~TO~int_#t~ret27#1; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume { :end_inline_bar } true;assume -2147483648 <= ##fun~~TO~int_#t~ret27#1 && ##fun~~TO~int_#t~ret27#1 <= 2147483647; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: foo_#t~ret4#1 := ##fun~~TO~int_#res#1; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: havoc bar_#t~ret6#1, bar_#t~ret7#1, bar_#t~post8#1, bar_#t~nondet9#1, bar_#t~ret10#1, bar_#t~ret11#1, bar_#t~post12#1, bar_#t~nondet13#1, bar_#t~ret14#1, bar_#t~ret15#1; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-6: ##fun~~TO~int_#t~ret27#1 := bar_#res#1; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:34:30,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:34:30,266 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:34:30,266 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:34:30,298 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:34:30,299 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:34:30,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:34:30 BoogieIcfgContainer [2025-02-08 05:34:30,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:34:30,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:34:30,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:34:30,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:34:30,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:34:29" (1/3) ... [2025-02-08 05:34:30,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d39d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:34:30, skipping insertion in model container [2025-02-08 05:34:30,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:34:29" (2/3) ... [2025-02-08 05:34:30,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d39d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:34:30, skipping insertion in model container [2025-02-08 05:34:30,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:34:30" (3/3) ... [2025-02-08 05:34:30,307 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-02-08 05:34:30,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:34:30,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 160 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-02-08 05:34:30,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:34:30,386 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:34:30,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 172 transitions, 351 flow [2025-02-08 05:34:30,518 INFO L124 PetriNetUnfolderBase]: 19/272 cut-off events. [2025-02-08 05:34:30,523 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:34:30,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 272 events. 19/272 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 887 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 134. Up to 6 conditions per place. [2025-02-08 05:34:30,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 172 transitions, 351 flow [2025-02-08 05:34:30,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 172 transitions, 351 flow [2025-02-08 05:34:30,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:30,558 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;@43d678d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:30,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:34:30,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:30,569 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:34:30,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:30,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:30,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:30,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 79014752, now seen corresponding path program 1 times [2025-02-08 05:34:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941542728] [2025-02-08 05:34:30,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:30,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:34:30,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:34:30,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:30,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941542728] [2025-02-08 05:34:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941542728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:31,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577105680] [2025-02-08 05:34:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:31,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:31,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:31,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:31,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 172 [2025-02-08 05:34:31,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 172 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:31,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:31,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 172 [2025-02-08 05:34:31,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:31,667 INFO L124 PetriNetUnfolderBase]: 87/752 cut-off events. [2025-02-08 05:34:31,670 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:34:31,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 752 events. 87/752 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4342 event pairs, 8 based on Foata normal form. 116/806 useless extension candidates. Maximal degree in co-relation 805. Up to 154 conditions per place. [2025-02-08 05:34:31,680 INFO L140 encePairwiseOnDemand]: 156/172 looper letters, 40 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2025-02-08 05:34:31,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 175 transitions, 447 flow [2025-02-08 05:34:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2025-02-08 05:34:31,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8313953488372093 [2025-02-08 05:34:31,708 INFO L175 Difference]: Start difference. First operand has 163 places, 172 transitions, 351 flow. Second operand 6 states and 858 transitions. [2025-02-08 05:34:31,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 175 transitions, 447 flow [2025-02-08 05:34:31,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:31,719 INFO L231 Difference]: Finished difference. Result has 165 places, 159 transitions, 335 flow [2025-02-08 05:34:31,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=165, PETRI_TRANSITIONS=159} [2025-02-08 05:34:31,723 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2025-02-08 05:34:31,723 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 159 transitions, 335 flow [2025-02-08 05:34:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:31,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:31,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:31,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:34:31,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1315802591, now seen corresponding path program 1 times [2025-02-08 05:34:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155362937] [2025-02-08 05:34:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:31,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:34:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:34:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155362937] [2025-02-08 05:34:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155362937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531445734] [2025-02-08 05:34:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:31,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:31,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:31,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:31,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 172 [2025-02-08 05:34:31,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 159 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:31,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:31,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 172 [2025-02-08 05:34:31,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:31,850 INFO L124 PetriNetUnfolderBase]: 42/531 cut-off events. [2025-02-08 05:34:31,851 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:34:31,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 531 events. 42/531 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2578 event pairs, 27 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 573. Up to 94 conditions per place. [2025-02-08 05:34:31,853 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 20 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-02-08 05:34:31,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 387 flow [2025-02-08 05:34:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-02-08 05:34:31,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-02-08 05:34:31,855 INFO L175 Difference]: Start difference. First operand has 165 places, 159 transitions, 335 flow. Second operand 3 states and 452 transitions. [2025-02-08 05:34:31,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 387 flow [2025-02-08 05:34:31,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 163 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:31,858 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 333 flow [2025-02-08 05:34:31,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2025-02-08 05:34:31,859 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 0 predicate places. [2025-02-08 05:34:31,859 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 333 flow [2025-02-08 05:34:31,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:31,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:31,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:31,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:34:31,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:31,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2040766604, now seen corresponding path program 1 times [2025-02-08 05:34:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284451895] [2025-02-08 05:34:31,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:31,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:34:31,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:34:31,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:31,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284451895] [2025-02-08 05:34:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284451895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291675588] [2025-02-08 05:34:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:31,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:31,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:31,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:31,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172 [2025-02-08 05:34:31,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:31,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:31,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172 [2025-02-08 05:34:31,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:32,020 INFO L124 PetriNetUnfolderBase]: 92/620 cut-off events. [2025-02-08 05:34:32,020 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:34:32,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 620 events. 92/620 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3219 event pairs, 32 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 791. Up to 125 conditions per place. [2025-02-08 05:34:32,022 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 27 selfloop transitions, 6 changer transitions 10/171 dead transitions. [2025-02-08 05:34:32,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 427 flow [2025-02-08 05:34:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-02-08 05:34:32,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-02-08 05:34:32,023 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 333 flow. Second operand 3 states and 452 transitions. [2025-02-08 05:34:32,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 427 flow [2025-02-08 05:34:32,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:32,026 INFO L231 Difference]: Finished difference. Result has 163 places, 153 transitions, 351 flow [2025-02-08 05:34:32,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=163, PETRI_TRANSITIONS=153} [2025-02-08 05:34:32,027 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 0 predicate places. [2025-02-08 05:34:32,027 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 351 flow [2025-02-08 05:34:32,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:32,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:32,027 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:32,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:34:32,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:34:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -279966599, now seen corresponding path program 1 times [2025-02-08 05:34:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830867] [2025-02-08 05:34:32,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:32,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:34:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:34:32,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:32,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:32,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:32,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:34:32,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:34:32,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:32,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:32,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:32,073 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:32,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 05:34:32,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:34:32,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:34:32,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:34:32,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-08 05:34:32,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-08 05:34:32,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-08 05:34:32,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:34:32,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:34:32,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:34:32,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:34:32,078 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:32,078 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:34:32,093 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:34:32,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 205 transitions, 426 flow [2025-02-08 05:34:32,124 INFO L124 PetriNetUnfolderBase]: 32/432 cut-off events. [2025-02-08 05:34:32,125 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:34:32,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 432 events. 32/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1702 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 274. Up to 9 conditions per place. [2025-02-08 05:34:32,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 205 transitions, 426 flow [2025-02-08 05:34:32,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 205 transitions, 426 flow [2025-02-08 05:34:32,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:32,130 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;@43d678d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:32,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:34:32,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:32,133 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:34:32,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:32,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:32,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:32,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:32,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash -123767424, now seen corresponding path program 1 times [2025-02-08 05:34:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:32,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196576816] [2025-02-08 05:34:32,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:32,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:34:32,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:34:32,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:32,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196576816] [2025-02-08 05:34:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196576816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682672282] [2025-02-08 05:34:32,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:32,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:32,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:32,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:32,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 205 [2025-02-08 05:34:32,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 205 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:32,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:32,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 205 [2025-02-08 05:34:32,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:32,872 INFO L124 PetriNetUnfolderBase]: 970/4439 cut-off events. [2025-02-08 05:34:32,872 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 05:34:32,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6098 conditions, 4439 events. 970/4439 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 41813 event pairs, 108 based on Foata normal form. 1102/5194 useless extension candidates. Maximal degree in co-relation 1036. Up to 1202 conditions per place. [2025-02-08 05:34:32,890 INFO L140 encePairwiseOnDemand]: 185/205 looper letters, 62 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2025-02-08 05:34:32,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 218 transitions, 586 flow [2025-02-08 05:34:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1032 transitions. [2025-02-08 05:34:32,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8390243902439024 [2025-02-08 05:34:32,892 INFO L175 Difference]: Start difference. First operand has 193 places, 205 transitions, 426 flow. Second operand 6 states and 1032 transitions. [2025-02-08 05:34:32,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 218 transitions, 586 flow [2025-02-08 05:34:32,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 218 transitions, 586 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:32,896 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 398 flow [2025-02-08 05:34:32,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2025-02-08 05:34:32,901 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, 0 predicate places. [2025-02-08 05:34:32,901 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 398 flow [2025-02-08 05:34:32,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:32,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:32,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:34:32,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 701043393, now seen corresponding path program 1 times [2025-02-08 05:34:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709204373] [2025-02-08 05:34:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:32,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:34:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:34:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:32,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709204373] [2025-02-08 05:34:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709204373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:32,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673852416] [2025-02-08 05:34:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:32,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:32,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:32,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:32,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 205 [2025-02-08 05:34:32,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:32,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:32,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 205 [2025-02-08 05:34:32,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:33,197 INFO L124 PetriNetUnfolderBase]: 483/2857 cut-off events. [2025-02-08 05:34:33,198 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 05:34:33,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 2857 events. 483/2857 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 24855 event pairs, 403 based on Foata normal form. 1/2572 useless extension candidates. Maximal degree in co-relation 2384. Up to 821 conditions per place. [2025-02-08 05:34:33,209 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 27 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2025-02-08 05:34:33,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 191 transitions, 468 flow [2025-02-08 05:34:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-02-08 05:34:33,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8536585365853658 [2025-02-08 05:34:33,211 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 398 flow. Second operand 3 states and 525 transitions. [2025-02-08 05:34:33,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 191 transitions, 468 flow [2025-02-08 05:34:33,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 191 transitions, 456 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:33,216 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 400 flow [2025-02-08 05:34:33,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2025-02-08 05:34:33,218 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -2 predicate places. [2025-02-08 05:34:33,219 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 400 flow [2025-02-08 05:34:33,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:33,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:33,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:33,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:34:33,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 155403456, now seen corresponding path program 1 times [2025-02-08 05:34:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:33,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753062826] [2025-02-08 05:34:33,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:33,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:34:33,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:34:33,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:33,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753062826] [2025-02-08 05:34:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753062826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:33,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124940121] [2025-02-08 05:34:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:33,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:33,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:33,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 205 [2025-02-08 05:34:33,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:33,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:33,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 205 [2025-02-08 05:34:33,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:33,727 INFO L124 PetriNetUnfolderBase]: 1719/6231 cut-off events. [2025-02-08 05:34:33,727 INFO L125 PetriNetUnfolderBase]: For 76/145 co-relation queries the response was YES. [2025-02-08 05:34:33,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 6231 events. 1719/6231 cut-off events. For 76/145 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 61376 event pairs, 743 based on Foata normal form. 0/5682 useless extension candidates. Maximal degree in co-relation 9127. Up to 1903 conditions per place. [2025-02-08 05:34:33,752 INFO L140 encePairwiseOnDemand]: 193/205 looper letters, 43 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2025-02-08 05:34:33,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 206 transitions, 545 flow [2025-02-08 05:34:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-08 05:34:33,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8552845528455284 [2025-02-08 05:34:33,755 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 400 flow. Second operand 3 states and 526 transitions. [2025-02-08 05:34:33,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 206 transitions, 545 flow [2025-02-08 05:34:33,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 206 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:33,758 INFO L231 Difference]: Finished difference. Result has 192 places, 191 transitions, 454 flow [2025-02-08 05:34:33,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=192, PETRI_TRANSITIONS=191} [2025-02-08 05:34:33,759 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -1 predicate places. [2025-02-08 05:34:33,761 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 191 transitions, 454 flow [2025-02-08 05:34:33,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:33,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:33,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:33,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:34:33,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 404272245, now seen corresponding path program 1 times [2025-02-08 05:34:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:33,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6656611] [2025-02-08 05:34:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:33,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:34:33,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:34:33,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:33,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:34:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6656611] [2025-02-08 05:34:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6656611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42757008] [2025-02-08 05:34:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:33,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:34:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:33,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:34:33,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:34:33,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 205 [2025-02-08 05:34:33,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 191 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:33,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:33,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 205 [2025-02-08 05:34:33,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:34,522 INFO L124 PetriNetUnfolderBase]: 1046/5655 cut-off events. [2025-02-08 05:34:34,524 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2025-02-08 05:34:34,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8043 conditions, 5655 events. 1046/5655 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 57586 event pairs, 414 based on Foata normal form. 5/5220 useless extension candidates. Maximal degree in co-relation 3592. Up to 1330 conditions per place. [2025-02-08 05:34:34,547 INFO L140 encePairwiseOnDemand]: 200/205 looper letters, 44 selfloop transitions, 5 changer transitions 0/213 dead transitions. [2025-02-08 05:34:34,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 213 transitions, 596 flow [2025-02-08 05:34:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1028 transitions. [2025-02-08 05:34:34,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8357723577235773 [2025-02-08 05:34:34,550 INFO L175 Difference]: Start difference. First operand has 192 places, 191 transitions, 454 flow. Second operand 6 states and 1028 transitions. [2025-02-08 05:34:34,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 213 transitions, 596 flow [2025-02-08 05:34:34,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 213 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:34,560 INFO L231 Difference]: Finished difference. Result has 198 places, 193 transitions, 464 flow [2025-02-08 05:34:34,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=198, PETRI_TRANSITIONS=193} [2025-02-08 05:34:34,561 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, 5 predicate places. [2025-02-08 05:34:34,561 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 193 transitions, 464 flow [2025-02-08 05:34:34,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:34,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:34,561 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:34:34,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:34:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1791202257, now seen corresponding path program 1 times [2025-02-08 05:34:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652717711] [2025-02-08 05:34:34,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:34:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:34:34,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:34,594 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:34,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:34:34,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:34:34,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:34,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:34,609 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:34,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:34:34,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:34:34,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:34:34,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:34:34,610 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:34:34,611 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:34,611 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:34:34,630 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:34:34,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 238 transitions, 503 flow [2025-02-08 05:34:34,669 INFO L124 PetriNetUnfolderBase]: 48/635 cut-off events. [2025-02-08 05:34:34,669 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:34:34,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 635 events. 48/635 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2785 event pairs, 1 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 440. Up to 12 conditions per place. [2025-02-08 05:34:34,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 238 transitions, 503 flow [2025-02-08 05:34:34,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 238 transitions, 503 flow [2025-02-08 05:34:34,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:34,676 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;@43d678d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:34,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 05:34:34,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:34,679 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:34:34,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:34,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:34,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:34,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:34,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash -820115904, now seen corresponding path program 1 times [2025-02-08 05:34:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:34,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128178695] [2025-02-08 05:34:34,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:34,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:34:34,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:34:34,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:34,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128178695] [2025-02-08 05:34:34,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128178695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:34,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941033737] [2025-02-08 05:34:34,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:34,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:34,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:34,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:34,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 238 [2025-02-08 05:34:34,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 238 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 176.5) internal successors, (1059), 6 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:34,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:34,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 238 [2025-02-08 05:34:34,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:37,200 INFO L124 PetriNetUnfolderBase]: 7964/26053 cut-off events. [2025-02-08 05:34:37,200 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-02-08 05:34:37,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37788 conditions, 26053 events. 7964/26053 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 314558 event pairs, 913 based on Foata normal form. 8600/32821 useless extension candidates. Maximal degree in co-relation 6089. Up to 8631 conditions per place. [2025-02-08 05:34:37,323 INFO L140 encePairwiseOnDemand]: 214/238 looper letters, 84 selfloop transitions, 5 changer transitions 0/261 dead transitions. [2025-02-08 05:34:37,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 261 transitions, 727 flow [2025-02-08 05:34:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-02-08 05:34:37,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445378151260504 [2025-02-08 05:34:37,326 INFO L175 Difference]: Start difference. First operand has 223 places, 238 transitions, 503 flow. Second operand 6 states and 1206 transitions. [2025-02-08 05:34:37,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 261 transitions, 727 flow [2025-02-08 05:34:37,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 261 transitions, 727 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:34:37,330 INFO L231 Difference]: Finished difference. Result has 221 places, 213 transitions, 463 flow [2025-02-08 05:34:37,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=221, PETRI_TRANSITIONS=213} [2025-02-08 05:34:37,330 INFO L279 CegarLoopForPetriNet]: 223 programPoint places, -2 predicate places. [2025-02-08 05:34:37,331 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 213 transitions, 463 flow [2025-02-08 05:34:37,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.5) internal successors, (1059), 6 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:37,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:37,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:37,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:34:37,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:37,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1189561727, now seen corresponding path program 1 times [2025-02-08 05:34:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534055808] [2025-02-08 05:34:37,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:34:37,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:34:37,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:37,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:37,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:37,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534055808] [2025-02-08 05:34:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534055808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:37,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:37,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773358437] [2025-02-08 05:34:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:37,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:37,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:37,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:37,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 238 [2025-02-08 05:34:37,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 213 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:37,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:37,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 238 [2025-02-08 05:34:37,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:38,607 INFO L124 PetriNetUnfolderBase]: 3951/15899 cut-off events. [2025-02-08 05:34:38,608 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2025-02-08 05:34:38,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22143 conditions, 15899 events. 3951/15899 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 187263 event pairs, 2461 based on Foata normal form. 1/14423 useless extension candidates. Maximal degree in co-relation 3860. Up to 5780 conditions per place. [2025-02-08 05:34:38,681 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 33 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2025-02-08 05:34:38,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 218 transitions, 545 flow [2025-02-08 05:34:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2025-02-08 05:34:38,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8361344537815126 [2025-02-08 05:34:38,683 INFO L175 Difference]: Start difference. First operand has 221 places, 213 transitions, 463 flow. Second operand 3 states and 597 transitions. [2025-02-08 05:34:38,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 218 transitions, 545 flow [2025-02-08 05:34:38,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 533 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:34:38,686 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 465 flow [2025-02-08 05:34:38,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2025-02-08 05:34:38,687 INFO L279 CegarLoopForPetriNet]: 223 programPoint places, -4 predicate places. [2025-02-08 05:34:38,687 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 465 flow [2025-02-08 05:34:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:38,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:38,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:38,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:34:38,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:38,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1110407667, now seen corresponding path program 1 times [2025-02-08 05:34:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11847854] [2025-02-08 05:34:38,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:38,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:34:38,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:34:38,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:38,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11847854] [2025-02-08 05:34:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11847854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:38,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:38,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657896114] [2025-02-08 05:34:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:38,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:38,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:38,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:38,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 238 [2025-02-08 05:34:38,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:38,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:38,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 238 [2025-02-08 05:34:38,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:43,342 INFO L124 PetriNetUnfolderBase]: 21928/57919 cut-off events. [2025-02-08 05:34:43,342 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2025-02-08 05:34:43,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90121 conditions, 57919 events. 21928/57919 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 737789 event pairs, 9011 based on Foata normal form. 0/52838 useless extension candidates. Maximal degree in co-relation 90063. Up to 21877 conditions per place. [2025-02-08 05:34:43,816 INFO L140 encePairwiseOnDemand]: 223/238 looper letters, 57 selfloop transitions, 10 changer transitions 0/240 dead transitions. [2025-02-08 05:34:43,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 240 transitions, 663 flow [2025-02-08 05:34:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:34:43,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403361344537815 [2025-02-08 05:34:43,818 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 465 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:34:43,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 240 transitions, 663 flow [2025-02-08 05:34:43,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 240 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:43,825 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 537 flow [2025-02-08 05:34:43,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2025-02-08 05:34:43,826 INFO L279 CegarLoopForPetriNet]: 223 programPoint places, -3 predicate places. [2025-02-08 05:34:43,826 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 537 flow [2025-02-08 05:34:43,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:43,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:43,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:43,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:34:43,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1460337226, now seen corresponding path program 1 times [2025-02-08 05:34:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:43,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320961072] [2025-02-08 05:34:43,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:34:43,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:34:43,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:43,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:43,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:43,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320961072] [2025-02-08 05:34:43,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320961072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:43,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:43,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82500757] [2025-02-08 05:34:43,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:43,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:34:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:43,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:34:43,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:34:43,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 238 [2025-02-08 05:34:43,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 186.6) internal successors, (933), 5 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:43,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:43,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 238 [2025-02-08 05:34:43,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:48,614 INFO L124 PetriNetUnfolderBase]: 12993/53529 cut-off events. [2025-02-08 05:34:48,614 INFO L125 PetriNetUnfolderBase]: For 2974/2986 co-relation queries the response was YES. [2025-02-08 05:34:48,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77446 conditions, 53529 events. 12993/53529 cut-off events. For 2974/2986 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 769298 event pairs, 7205 based on Foata normal form. 5/48634 useless extension candidates. Maximal degree in co-relation 27796. Up to 15612 conditions per place. [2025-02-08 05:34:48,926 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 52 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2025-02-08 05:34:48,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 244 transitions, 701 flow [2025-02-08 05:34:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1168 transitions. [2025-02-08 05:34:48,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8179271708683473 [2025-02-08 05:34:48,929 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 537 flow. Second operand 6 states and 1168 transitions. [2025-02-08 05:34:48,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 244 transitions, 701 flow [2025-02-08 05:34:48,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 244 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:48,944 INFO L231 Difference]: Finished difference. Result has 226 places, 223 transitions, 549 flow [2025-02-08 05:34:48,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=549, PETRI_PLACES=226, PETRI_TRANSITIONS=223} [2025-02-08 05:34:48,944 INFO L279 CegarLoopForPetriNet]: 223 programPoint places, 3 predicate places. [2025-02-08 05:34:48,945 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 223 transitions, 549 flow [2025-02-08 05:34:48,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 186.6) internal successors, (933), 5 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:48,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:48,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:34:48,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:48,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 283429578, now seen corresponding path program 1 times [2025-02-08 05:34:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:48,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97272092] [2025-02-08 05:34:48,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:48,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:48,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:34:48,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:34:48,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:48,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97272092] [2025-02-08 05:34:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97272092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:48,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:34:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878462140] [2025-02-08 05:34:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:48,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:48,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:48,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:49,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 238 [2025-02-08 05:34:49,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 223 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:49,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:49,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 238 [2025-02-08 05:34:49,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:56,477 INFO L124 PetriNetUnfolderBase]: 21470/84390 cut-off events. [2025-02-08 05:34:56,478 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-02-08 05:34:56,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120206 conditions, 84390 events. 21470/84390 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 1296635 event pairs, 12307 based on Foata normal form. 242/76327 useless extension candidates. Maximal degree in co-relation 120068. Up to 14319 conditions per place. [2025-02-08 05:34:57,122 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 47 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2025-02-08 05:34:57,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 242 transitions, 685 flow [2025-02-08 05:34:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:34:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:34:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2025-02-08 05:34:57,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8557422969187675 [2025-02-08 05:34:57,124 INFO L175 Difference]: Start difference. First operand has 226 places, 223 transitions, 549 flow. Second operand 3 states and 611 transitions. [2025-02-08 05:34:57,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 242 transitions, 685 flow [2025-02-08 05:34:57,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 242 transitions, 679 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 05:34:57,128 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 555 flow [2025-02-08 05:34:57,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-02-08 05:34:57,129 INFO L279 CegarLoopForPetriNet]: 223 programPoint places, 4 predicate places. [2025-02-08 05:34:57,129 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 555 flow [2025-02-08 05:34:57,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:57,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:57,129 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:57,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:34:57,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:34:57,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 423234505, now seen corresponding path program 1 times [2025-02-08 05:34:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661926966] [2025-02-08 05:34:57,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:34:57,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:34:57,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:57,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:57,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:34:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:34:57,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:34:57,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:34:57,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:34:57,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-08 05:34:57,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-08 05:34:57,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:34:57,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:34:57,180 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:34:57,180 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:34:57,206 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:34:57,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 271 transitions, 582 flow [2025-02-08 05:34:57,264 INFO L124 PetriNetUnfolderBase]: 72/926 cut-off events. [2025-02-08 05:34:57,265 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:34:57,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 926 events. 72/926 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4378 event pairs, 6 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 655. Up to 32 conditions per place. [2025-02-08 05:34:57,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 271 transitions, 582 flow [2025-02-08 05:34:57,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 271 transitions, 582 flow [2025-02-08 05:34:57,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:34:57,276 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;@43d678d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:34:57,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:34:57,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:34:57,279 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:34:57,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:34:57,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:57,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:57,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:34:57,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2010030688, now seen corresponding path program 1 times [2025-02-08 05:34:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807299332] [2025-02-08 05:34:57,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:57,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:34:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:34:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:57,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807299332] [2025-02-08 05:34:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807299332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:34:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775253045] [2025-02-08 05:34:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:34:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:57,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:34:57,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:34:57,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 271 [2025-02-08 05:34:57,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 271 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:57,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:57,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 271 [2025-02-08 05:34:57,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand