./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/weaver/parallel-parallel-sum-1-dsl.wvr.c -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 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:18,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:18,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:18,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:18,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:18,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:18,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:18,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:18,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:18,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:18,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:18,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:18,382 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:18,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:18,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:18,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:18,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:18,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:18,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:18,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:18,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:18,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:18,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:18,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:18,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:18,388 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 -> 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c [2025-01-09 21:32:18,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:18,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:18,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:18,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:18,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:18,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-01-09 21:32:19,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbbe50de2/9883bba6499241bdaf1750dcf03cb793/FLAG23edb809f [2025-01-09 21:32:20,103 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:20,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-01-09 21:32:20,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbbe50de2/9883bba6499241bdaf1750dcf03cb793/FLAG23edb809f [2025-01-09 21:32:20,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbbe50de2/9883bba6499241bdaf1750dcf03cb793 [2025-01-09 21:32:20,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:20,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:20,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:20,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:20,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:20,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b429eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20, skipping insertion in model container [2025-01-09 21:32:20,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:20,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:20,648 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:20,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:20,716 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:20,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20 WrapperNode [2025-01-09 21:32:20,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:20,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:20,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:20,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:20,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,774 INFO L138 Inliner]: procedures = 28, calls = 66, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 489 [2025-01-09 21:32:20,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:20,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:20,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:20,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:20,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:20,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:20,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:20,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:20,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (1/1) ... [2025-01-09 21:32:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:20,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:20,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-01-09 21:32:20,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-01-09 21:32:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 21:32:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 21:32:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-09 21:32:20,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-09 21:32:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:32:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:32:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:20,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:20,879 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:20,963 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:20,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:21,543 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:21,543 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:21,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:21,838 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:32:21,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:21 BoogieIcfgContainer [2025-01-09 21:32:21,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:21,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:21,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:21,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:21,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:20" (1/3) ... [2025-01-09 21:32:21,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3643b5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:21, skipping insertion in model container [2025-01-09 21:32:21,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:20" (2/3) ... [2025-01-09 21:32:21,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3643b5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:21, skipping insertion in model container [2025-01-09 21:32:21,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:21" (3/3) ... [2025-01-09 21:32:21,844 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2025-01-09 21:32:21,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:21,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1-dsl.wvr.c that has 7 procedures, 346 locations, 1 initial locations, 5 loop locations, and 71 error locations. [2025-01-09 21:32:21,856 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:21,930 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-09 21:32:21,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 370 transitions, 806 flow [2025-01-09 21:32:22,040 INFO L124 PetriNetUnfolderBase]: 17/356 cut-off events. [2025-01-09 21:32:22,043 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:32:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 356 events. 17/356 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 695 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 313. Up to 3 conditions per place. [2025-01-09 21:32:22,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 372 places, 370 transitions, 806 flow [2025-01-09 21:32:22,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 339 transitions, 726 flow [2025-01-09 21:32:22,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:22,070 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;@5d66d4c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:22,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2025-01-09 21:32:22,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:22,076 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:32:22,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:22,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:22,076 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] [2025-01-09 21:32:22,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:22,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1652415629, now seen corresponding path program 1 times [2025-01-09 21:32:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301445119] [2025-01-09 21:32:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:22,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:32:22,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:32:22,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:22,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:22,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301445119] [2025-01-09 21:32:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301445119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496843350] [2025-01-09 21:32:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:22,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:22,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:22,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:22,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 374 [2025-01-09 21:32:22,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-01-09 21:32:22,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:22,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 374 [2025-01-09 21:32:22,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:23,746 INFO L124 PetriNetUnfolderBase]: 2800/6296 cut-off events. [2025-01-09 21:32:23,747 INFO L125 PetriNetUnfolderBase]: For 1095/1095 co-relation queries the response was YES. [2025-01-09 21:32:23,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10982 conditions, 6296 events. 2800/6296 cut-off events. For 1095/1095 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49271 event pairs, 1446 based on Foata normal form. 1046/6411 useless extension candidates. Maximal degree in co-relation 10547. Up to 3551 conditions per place. [2025-01-09 21:32:23,828 INFO L140 encePairwiseOnDemand]: 308/374 looper letters, 35 selfloop transitions, 2 changer transitions 3/275 dead transitions. [2025-01-09 21:32:23,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 275 transitions, 672 flow [2025-01-09 21:32:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2025-01-09 21:32:23,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7905525846702317 [2025-01-09 21:32:23,849 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 726 flow. Second operand 3 states and 887 transitions. [2025-01-09 21:32:23,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 275 transitions, 672 flow [2025-01-09 21:32:23,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 640 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-09 21:32:23,866 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 564 flow [2025-01-09 21:32:23,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2025-01-09 21:32:23,872 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -67 predicate places. [2025-01-09 21:32:23,873 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 564 flow [2025-01-09 21:32:23,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-01-09 21:32:23,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:23,873 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] [2025-01-09 21:32:23,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:23,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:23,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash 90546190, now seen corresponding path program 1 times [2025-01-09 21:32:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935289871] [2025-01-09 21:32:23,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:23,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:32:23,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:32:23,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:23,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935289871] [2025-01-09 21:32:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935289871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260970367] [2025-01-09 21:32:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:23,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:23,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:23,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 374 [2025-01-09 21:32:23,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-01-09 21:32:23,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:23,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 374 [2025-01-09 21:32:23,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:24,838 INFO L124 PetriNetUnfolderBase]: 2800/6292 cut-off events. [2025-01-09 21:32:24,838 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:24,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10126 conditions, 6292 events. 2800/6292 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49251 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10092. Up to 3550 conditions per place. [2025-01-09 21:32:24,873 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 34 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-01-09 21:32:24,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 271 transitions, 634 flow [2025-01-09 21:32:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2025-01-09 21:32:24,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361853832442068 [2025-01-09 21:32:24,875 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 564 flow. Second operand 3 states and 826 transitions. [2025-01-09 21:32:24,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 271 transitions, 634 flow [2025-01-09 21:32:24,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:24,883 INFO L231 Difference]: Finished difference. Result has 271 places, 271 transitions, 562 flow [2025-01-09 21:32:24,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=271, PETRI_TRANSITIONS=271} [2025-01-09 21:32:24,884 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -71 predicate places. [2025-01-09 21:32:24,884 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 271 transitions, 562 flow [2025-01-09 21:32:24,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-01-09 21:32:24,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:24,886 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-01-09 21:32:24,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:24,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:24,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -420940712, now seen corresponding path program 1 times [2025-01-09 21:32:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324477476] [2025-01-09 21:32:24,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:32:24,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:32:24,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:24,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324477476] [2025-01-09 21:32:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324477476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:24,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:24,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:24,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394166806] [2025-01-09 21:32:24,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:24,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:24,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:24,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:24,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:24,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 271 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:24,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:24,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:24,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:25,665 INFO L124 PetriNetUnfolderBase]: 2800/6291 cut-off events. [2025-01-09 21:32:25,665 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:25,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10124 conditions, 6291 events. 2800/6291 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49343 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10082. Up to 3549 conditions per place. [2025-01-09 21:32:25,706 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-01-09 21:32:25,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 270 transitions, 630 flow [2025-01-09 21:32:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:25,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:25,709 INFO L175 Difference]: Start difference. First operand has 271 places, 271 transitions, 562 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:25,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 270 transitions, 630 flow [2025-01-09 21:32:25,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 270 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:25,712 INFO L231 Difference]: Finished difference. Result has 270 places, 270 transitions, 560 flow [2025-01-09 21:32:25,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=270, PETRI_TRANSITIONS=270} [2025-01-09 21:32:25,713 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -72 predicate places. [2025-01-09 21:32:25,713 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 270 transitions, 560 flow [2025-01-09 21:32:25,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:25,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:25,714 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-01-09 21:32:25,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:25,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -584269274, now seen corresponding path program 1 times [2025-01-09 21:32:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896620958] [2025-01-09 21:32:25,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:25,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:32:25,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:32:25,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:25,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896620958] [2025-01-09 21:32:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896620958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:25,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:25,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:25,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739846557] [2025-01-09 21:32:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:25,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:25,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:25,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:25,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:25,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 270 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:25,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:25,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:25,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:26,510 INFO L124 PetriNetUnfolderBase]: 2800/6290 cut-off events. [2025-01-09 21:32:26,510 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:26,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10123 conditions, 6290 events. 2800/6290 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49256 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10073. Up to 3549 conditions per place. [2025-01-09 21:32:26,565 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-01-09 21:32:26,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 269 transitions, 628 flow [2025-01-09 21:32:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:26,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:26,568 INFO L175 Difference]: Start difference. First operand has 270 places, 270 transitions, 560 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:26,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 269 transitions, 628 flow [2025-01-09 21:32:26,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 269 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:26,572 INFO L231 Difference]: Finished difference. Result has 269 places, 269 transitions, 558 flow [2025-01-09 21:32:26,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=269, PETRI_TRANSITIONS=269} [2025-01-09 21:32:26,573 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -73 predicate places. [2025-01-09 21:32:26,573 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 269 transitions, 558 flow [2025-01-09 21:32:26,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:26,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,574 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] [2025-01-09 21:32:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:26,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:26,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1303765934, now seen corresponding path program 1 times [2025-01-09 21:32:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419710012] [2025-01-09 21:32:26,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:32:26,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:32:26,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419710012] [2025-01-09 21:32:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419710012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:26,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091946584] [2025-01-09 21:32:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:26,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:26,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:26,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:26,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 269 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:26,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:26,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:26,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,372 INFO L124 PetriNetUnfolderBase]: 2800/6289 cut-off events. [2025-01-09 21:32:27,372 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:27,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 6289 events. 2800/6289 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49324 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10064. Up to 3549 conditions per place. [2025-01-09 21:32:27,406 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-01-09 21:32:27,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 626 flow [2025-01-09 21:32:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:27,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:27,408 INFO L175 Difference]: Start difference. First operand has 269 places, 269 transitions, 558 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 626 flow [2025-01-09 21:32:27,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 268 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,411 INFO L231 Difference]: Finished difference. Result has 268 places, 268 transitions, 556 flow [2025-01-09 21:32:27,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=268, PETRI_TRANSITIONS=268} [2025-01-09 21:32:27,412 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -74 predicate places. [2025-01-09 21:32:27,412 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 268 transitions, 556 flow [2025-01-09 21:32:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:27,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,413 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, 1, 1] [2025-01-09 21:32:27,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:27,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash -843312985, now seen corresponding path program 1 times [2025-01-09 21:32:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103121239] [2025-01-09 21:32:27,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:32:27,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:32:27,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103121239] [2025-01-09 21:32:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103121239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693606731] [2025-01-09 21:32:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 374 [2025-01-09 21:32:27,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 268 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-01-09 21:32:27,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 374 [2025-01-09 21:32:27,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,942 INFO L124 PetriNetUnfolderBase]: 2800/6288 cut-off events. [2025-01-09 21:32:27,942 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:27,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 6288 events. 2800/6288 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49262 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10056. Up to 3550 conditions per place. [2025-01-09 21:32:28,067 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 34 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-01-09 21:32:28,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 267 transitions, 626 flow [2025-01-09 21:32:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2025-01-09 21:32:28,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361853832442068 [2025-01-09 21:32:28,069 INFO L175 Difference]: Start difference. First operand has 268 places, 268 transitions, 556 flow. Second operand 3 states and 826 transitions. [2025-01-09 21:32:28,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 267 transitions, 626 flow [2025-01-09 21:32:28,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 267 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:28,072 INFO L231 Difference]: Finished difference. Result has 267 places, 267 transitions, 554 flow [2025-01-09 21:32:28,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=267, PETRI_TRANSITIONS=267} [2025-01-09 21:32:28,073 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -75 predicate places. [2025-01-09 21:32:28,073 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 267 transitions, 554 flow [2025-01-09 21:32:28,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-01-09 21:32:28,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:28,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:28,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:28,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1787830874, now seen corresponding path program 1 times [2025-01-09 21:32:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017862805] [2025-01-09 21:32:28,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:28,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:32:28,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:32:28,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:28,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017862805] [2025-01-09 21:32:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017862805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:28,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963522751] [2025-01-09 21:32:28,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:28,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:28,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:28,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:28,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 267 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:28,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:28,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:28,592 INFO L124 PetriNetUnfolderBase]: 2800/6287 cut-off events. [2025-01-09 21:32:28,592 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:28,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10120 conditions, 6287 events. 2800/6287 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49204 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10046. Up to 3549 conditions per place. [2025-01-09 21:32:28,633 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-01-09 21:32:28,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 622 flow [2025-01-09 21:32:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:28,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:28,635 INFO L175 Difference]: Start difference. First operand has 267 places, 267 transitions, 554 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:28,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 622 flow [2025-01-09 21:32:28,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 266 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:28,638 INFO L231 Difference]: Finished difference. Result has 266 places, 266 transitions, 552 flow [2025-01-09 21:32:28,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=266, PETRI_TRANSITIONS=266} [2025-01-09 21:32:28,639 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -76 predicate places. [2025-01-09 21:32:28,639 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 266 transitions, 552 flow [2025-01-09 21:32:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:28,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:28,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:28,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:28,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash 38937063, now seen corresponding path program 1 times [2025-01-09 21:32:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911754425] [2025-01-09 21:32:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:28,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:32:28,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:32:28,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:28,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911754425] [2025-01-09 21:32:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911754425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:28,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433576750] [2025-01-09 21:32:28,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:28,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:28,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:28,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:28,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:28,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:28,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:28,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,146 INFO L124 PetriNetUnfolderBase]: 2800/6286 cut-off events. [2025-01-09 21:32:29,146 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:29,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10119 conditions, 6286 events. 2800/6286 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49299 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10037. Up to 3549 conditions per place. [2025-01-09 21:32:29,180 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-01-09 21:32:29,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 265 transitions, 620 flow [2025-01-09 21:32:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:29,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:29,183 INFO L175 Difference]: Start difference. First operand has 266 places, 266 transitions, 552 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:29,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 265 transitions, 620 flow [2025-01-09 21:32:29,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 265 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,185 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-01-09 21:32:29,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-01-09 21:32:29,186 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -77 predicate places. [2025-01-09 21:32:29,186 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-01-09 21:32:29,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:29,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,187 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, 1, 1, 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-01-09 21:32:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:29,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:29,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1110991207, now seen corresponding path program 1 times [2025-01-09 21:32:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387981144] [2025-01-09 21:32:29,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:32:29,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:32:29,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:29,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387981144] [2025-01-09 21:32:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387981144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962703890] [2025-01-09 21:32:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:29,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:29,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:29,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:29,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:29,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:29,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:29,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:29,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,789 INFO L124 PetriNetUnfolderBase]: 2800/6285 cut-off events. [2025-01-09 21:32:29,789 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:29,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 6285 events. 2800/6285 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49280 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10028. Up to 3549 conditions per place. [2025-01-09 21:32:29,821 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-01-09 21:32:29,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 264 transitions, 618 flow [2025-01-09 21:32:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:29,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:29,824 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:29,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 264 transitions, 618 flow [2025-01-09 21:32:29,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,827 INFO L231 Difference]: Finished difference. Result has 264 places, 264 transitions, 548 flow [2025-01-09 21:32:29,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=264} [2025-01-09 21:32:29,828 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -78 predicate places. [2025-01-09 21:32:29,828 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 264 transitions, 548 flow [2025-01-09 21:32:29,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:29,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,829 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, 1, 1, 1, 1, 1, 1, 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-01-09 21:32:29,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:29,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1074658348, now seen corresponding path program 1 times [2025-01-09 21:32:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187035978] [2025-01-09 21:32:29,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:32:29,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:32:29,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:29,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:29,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187035978] [2025-01-09 21:32:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187035978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294951403] [2025-01-09 21:32:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:29,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:29,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:29,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:29,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:29,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 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-01-09 21:32:29,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:29,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:30,604 INFO L124 PetriNetUnfolderBase]: 2800/6283 cut-off events. [2025-01-09 21:32:30,604 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:30,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 6283 events. 2800/6283 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49180 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10018. Up to 3549 conditions per place. [2025-01-09 21:32:30,648 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 34 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2025-01-09 21:32:30,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 262 transitions, 614 flow [2025-01-09 21:32:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-01-09 21:32:30,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7388591800356507 [2025-01-09 21:32:30,650 INFO L175 Difference]: Start difference. First operand has 264 places, 264 transitions, 548 flow. Second operand 3 states and 829 transitions. [2025-01-09 21:32:30,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 262 transitions, 614 flow [2025-01-09 21:32:30,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 262 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:30,654 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 542 flow [2025-01-09 21:32:30,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2025-01-09 21:32:30,655 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -80 predicate places. [2025-01-09 21:32:30,655 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 542 flow [2025-01-09 21:32:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 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-01-09 21:32:30,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:30,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:32:30,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:30,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:30,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1713699992, now seen corresponding path program 1 times [2025-01-09 21:32:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446559392] [2025-01-09 21:32:30,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:32:30,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:32:30,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:30,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446559392] [2025-01-09 21:32:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446559392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489489329] [2025-01-09 21:32:31,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:31,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:31,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 374 [2025-01-09 21:32:31,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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-01-09 21:32:31,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 374 [2025-01-09 21:32:31,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:31,846 INFO L124 PetriNetUnfolderBase]: 2800/6282 cut-off events. [2025-01-09 21:32:31,846 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:31,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 6282 events. 2800/6282 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49178 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10025. Up to 3554 conditions per place. [2025-01-09 21:32:31,881 INFO L140 encePairwiseOnDemand]: 368/374 looper letters, 38 selfloop transitions, 5 changer transitions 0/261 dead transitions. [2025-01-09 21:32:31,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 261 transitions, 626 flow [2025-01-09 21:32:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1586 transitions. [2025-01-09 21:32:31,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7067736185383244 [2025-01-09 21:32:31,884 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 542 flow. Second operand 6 states and 1586 transitions. [2025-01-09 21:32:31,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 261 transitions, 626 flow [2025-01-09 21:32:31,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 261 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:31,887 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 549 flow [2025-01-09 21:32:31,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=549, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2025-01-09 21:32:31,888 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -77 predicate places. [2025-01-09 21:32:31,888 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 549 flow [2025-01-09 21:32:31,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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-01-09 21:32:31,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:32:31,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:31,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1097833071, now seen corresponding path program 1 times [2025-01-09 21:32:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318912077] [2025-01-09 21:32:31,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:32:31,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:32:31,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318912077] [2025-01-09 21:32:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318912077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209671054] [2025-01-09 21:32:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-01-09 21:32:31,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:31,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-01-09 21:32:31,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,472 INFO L124 PetriNetUnfolderBase]: 2800/6281 cut-off events. [2025-01-09 21:32:32,474 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:32,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 6281 events. 2800/6281 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49269 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10100. Up to 3549 conditions per place. [2025-01-09 21:32:32,518 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2025-01-09 21:32:32,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 617 flow [2025-01-09 21:32:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-01-09 21:32:32,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-01-09 21:32:32,520 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 549 flow. Second operand 3 states and 828 transitions. [2025-01-09 21:32:32,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 617 flow [2025-01-09 21:32:32,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 260 transitions, 607 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:32,523 INFO L231 Difference]: Finished difference. Result has 261 places, 260 transitions, 541 flow [2025-01-09 21:32:32,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=261, PETRI_TRANSITIONS=260} [2025-01-09 21:32:32,524 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -81 predicate places. [2025-01-09 21:32:32,524 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 260 transitions, 541 flow [2025-01-09 21:32:32,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-01-09 21:32:32,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:32,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:32:32,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:32,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1814294597, now seen corresponding path program 1 times [2025-01-09 21:32:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:32,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-01-09 21:32:32,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:32,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:32:32,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:32:32,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:32,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:32,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-01-09 21:32:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339537256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:32,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:32,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942247468] [2025-01-09 21:32:32,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:32,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:32,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:32,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:32,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:32,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 374 [2025-01-09 21:32:32,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 260 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-01-09 21:32:32,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:32,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 374 [2025-01-09 21:32:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:33,189 INFO L124 PetriNetUnfolderBase]: 2800/6280 cut-off events. [2025-01-09 21:32:33,190 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:33,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 6280 events. 2800/6280 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49197 event pairs, 1446 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 10014. Up to 3547 conditions per place. [2025-01-09 21:32:33,221 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 32 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2025-01-09 21:32:33,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 259 transitions, 605 flow [2025-01-09 21:32:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2025-01-09 21:32:33,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7442067736185384 [2025-01-09 21:32:33,224 INFO L175 Difference]: Start difference. First operand has 261 places, 260 transitions, 541 flow. Second operand 3 states and 835 transitions. [2025-01-09 21:32:33,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 259 transitions, 605 flow [2025-01-09 21:32:33,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 259 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:33,226 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 537 flow [2025-01-09 21:32:33,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2025-01-09 21:32:33,227 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2025-01-09 21:32:33,227 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 537 flow [2025-01-09 21:32:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-01-09 21:32:33,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:33,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:32:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:33,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-01-09 21:32:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2027234968, now seen corresponding path program 1 times [2025-01-09 21:32:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498588107] [2025-01-09 21:32:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:33,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 21:32:33,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 21:32:33,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:33,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:33,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498588107] [2025-01-09 21:32:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498588107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:33,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:33,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038939581] [2025-01-09 21:32:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:33,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:33,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:33,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:33,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 374 [2025-01-09 21:32:33,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-01-09 21:32:33,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:33,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 374 [2025-01-09 21:32:33,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:33,817 INFO L124 PetriNetUnfolderBase]: 2800/6279 cut-off events. [2025-01-09 21:32:33,817 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:32:33,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10109 conditions, 6279 events. 2800/6279 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49205 event pairs, 1446 based on Foata normal form. 1/5365 useless extension candidates. Maximal degree in co-relation 10101. Up to 3547 conditions per place. [2025-01-09 21:32:33,845 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 0 selfloop transitions, 0 changer transitions 258/258 dead transitions. [2025-01-09 21:32:33,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 599 flow [2025-01-09 21:32:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-01-09 21:32:33,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7433155080213903 [2025-01-09 21:32:33,847 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 537 flow. Second operand 3 states and 834 transitions. [2025-01-09 21:32:33,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 258 transitions, 599 flow [2025-01-09 21:32:33,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 258 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:33,849 INFO L231 Difference]: Finished difference. Result has 260 places, 0 transitions, 0 flow [2025-01-09 21:32:33,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=260, PETRI_TRANSITIONS=0} [2025-01-09 21:32:33,850 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2025-01-09 21:32:33,850 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 0 transitions, 0 flow [2025-01-09 21:32:33,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-01-09 21:32:33,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2025-01-09 21:32:33,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2025-01-09 21:32:33,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (134 of 137 remaining) [2025-01-09 21:32:33,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (133 of 137 remaining) [2025-01-09 21:32:33,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2025-01-09 21:32:33,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2025-01-09 21:32:33,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 137 remaining) [2025-01-09 21:32:33,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2025-01-09 21:32:33,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork2Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork2Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2025-01-09 21:32:33,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2025-01-09 21:32:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2025-01-09 21:32:33,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2025-01-09 21:32:33,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2025-01-09 21:32:33,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:33,859 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:33,863 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:33,863 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:33,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:33 BasicIcfg [2025-01-09 21:32:33,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:33,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:33,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:33,868 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:33,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:21" (3/4) ... [2025-01-09 21:32:33,869 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:33,871 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:33,871 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:33,871 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:33,871 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:33,871 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-01-09 21:32:33,871 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-01-09 21:32:33,877 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 21:32:33,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:33,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:33,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:33,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:33,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:33,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:33,934 INFO L158 Benchmark]: Toolchain (without parser) took 13497.61ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 112.1MB in the beginning and 835.1MB in the end (delta: -723.0MB). Peak memory consumption was 870.6MB. Max. memory is 16.1GB. [2025-01-09 21:32:33,934 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:33,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.60ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:33,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.89ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:33,935 INFO L158 Benchmark]: Boogie Preprocessor took 31.45ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:33,935 INFO L158 Benchmark]: RCFGBuilder took 1027.06ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 102.1MB in the end (delta: -10.0MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:33,935 INFO L158 Benchmark]: TraceAbstraction took 12027.82ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 102.1MB in the beginning and 839.5MB in the end (delta: -737.4MB). Peak memory consumption was 854.9MB. Max. memory is 16.1GB. [2025-01-09 21:32:33,935 INFO L158 Benchmark]: Witness Printer took 65.93ms. Allocated memory is still 1.7GB. Free memory was 839.5MB in the beginning and 835.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:33,936 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.60ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.89ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.45ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1027.06ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 102.1MB in the end (delta: -10.0MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12027.82ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 102.1MB in the beginning and 839.5MB in the end (delta: -737.4MB). Peak memory consumption was 854.9MB. Max. memory is 16.1GB. * Witness Printer took 65.93ms. Allocated memory is still 1.7GB. Free memory was 839.5MB in the beginning and 835.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 502 locations, 137 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 56 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:33,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE