./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/popl20-more-mts.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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e'] 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/popl20-more-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:45:01,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:45:01,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:45:01,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:45:01,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:45:01,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:45:01,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:45:01,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:45:01,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:45:01,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:45:01,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:45:01,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:45:01,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:45:01,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:45:01,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:45:01,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:45:01,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:45:01,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:45:01,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:45:01,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:45:01,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:45:01,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:45:01,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:45:01,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:45:01,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:45:01,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:45:01,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:45:01,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:45:01,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:45:01,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:45:01,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:45:01,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:45:01,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:45:01,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:45:01,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:45:01,770 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-11-07 15:45:02,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:45:02,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:45:02,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:45:02,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:45:02,080 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:45:02,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-07 15:45:03,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:45:03,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:45:03,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-07 15:45:03,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/536102218/c89903b8ea36478c8316f2d2bf9590b9/FLAG673e0d484 [2024-11-07 15:45:03,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/536102218/c89903b8ea36478c8316f2d2bf9590b9 [2024-11-07 15:45:03,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:45:03,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:45:03,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:45:03,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:45:03,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:45:03,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e18056c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03, skipping insertion in model container [2024-11-07 15:45:03,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:45:03,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:45:03,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:45:03,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:45:03,960 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:45:03,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03 WrapperNode [2024-11-07 15:45:03,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:45:03,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:45:03,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:45:03,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:45:03,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,024 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 354 [2024-11-07 15:45:04,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:45:04,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:45:04,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:45:04,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:45:04,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:45:04,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:45:04,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:45:04,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:45:04,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:45:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:45:04,148 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) [2024-11-07 15:45:04,152 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 [2024-11-07 15:45:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:45:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:45:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:45:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:45:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:45:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 15:45:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 15:45:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:45:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:45:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 15:45:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 15:45:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:45:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:45:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:45:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:45:04,181 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:45:04,313 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:45:04,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:45:05,008 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:45:05,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:45:05,315 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:45:05,315 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 15:45:05,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:05 BoogieIcfgContainer [2024-11-07 15:45:05,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:45:05,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:45:05,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:45:05,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:45:05,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:45:03" (1/3) ... [2024-11-07 15:45:05,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439e8e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:45:05, skipping insertion in model container [2024-11-07 15:45:05,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (2/3) ... [2024-11-07 15:45:05,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439e8e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:45:05, skipping insertion in model container [2024-11-07 15:45:05,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:05" (3/3) ... [2024-11-07 15:45:05,327 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-11-07 15:45:05,342 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:45:05,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-07 15:45:05,344 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:45:05,459 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:45:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 360 places, 370 transitions, 761 flow [2024-11-07 15:45:05,694 INFO L124 PetriNetUnfolderBase]: 20/367 cut-off events. [2024-11-07 15:45:05,696 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:45:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 367 events. 20/367 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 876 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2024-11-07 15:45:05,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 360 places, 370 transitions, 761 flow [2024-11-07 15:45:05,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 346 transitions, 710 flow [2024-11-07 15:45:05,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:45:05,743 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;@2035b876, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:45:05,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-11-07 15:45:05,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:45:05,752 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-07 15:45:05,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:45:05,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:05,753 INFO L204 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] [2024-11-07 15:45:05,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -163906003, now seen corresponding path program 1 times [2024-11-07 15:45:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389976173] [2024-11-07 15:45:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389976173] [2024-11-07 15:45:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389976173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412075914] [2024-11-07 15:45:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:05,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:05,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:05,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 370 [2024-11-07 15:45:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 346 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2024-11-07 15:45:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 370 [2024-11-07 15:45:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,219 INFO L124 PetriNetUnfolderBase]: 32/689 cut-off events. [2024-11-07 15:45:06,219 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-07 15:45:06,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 689 events. 32/689 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3093 event pairs, 12 based on Foata normal form. 30/611 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-11-07 15:45:06,235 INFO L140 encePairwiseOnDemand]: 345/370 looper letters, 14 selfloop transitions, 2 changer transitions 3/323 dead transitions. [2024-11-07 15:45:06,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 323 transitions, 696 flow [2024-11-07 15:45:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-11-07 15:45:06,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216216216216216 [2024-11-07 15:45:06,259 INFO L175 Difference]: Start difference. First operand has 338 places, 346 transitions, 710 flow. Second operand 3 states and 1023 transitions. [2024-11-07 15:45:06,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 323 transitions, 696 flow [2024-11-07 15:45:06,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 684 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 15:45:06,309 INFO L231 Difference]: Finished difference. Result has 322 places, 320 transitions, 650 flow [2024-11-07 15:45:06,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=322, PETRI_TRANSITIONS=320} [2024-11-07 15:45:06,318 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -16 predicate places. [2024-11-07 15:45:06,318 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 320 transitions, 650 flow [2024-11-07 15:45:06,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2024-11-07 15:45:06,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,320 INFO L204 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] [2024-11-07 15:45:06,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:45:06,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash 6455061, now seen corresponding path program 1 times [2024-11-07 15:45:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729508109] [2024-11-07 15:45:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729508109] [2024-11-07 15:45:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729508109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458285306] [2024-11-07 15:45:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:06,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 370 [2024-11-07 15:45:06,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 320 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2024-11-07 15:45:06,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 370 [2024-11-07 15:45:06,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,571 INFO L124 PetriNetUnfolderBase]: 23/635 cut-off events. [2024-11-07 15:45:06,571 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:45:06,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 635 events. 23/635 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2755 event pairs, 8 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 649. Up to 35 conditions per place. [2024-11-07 15:45:06,581 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 14 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2024-11-07 15:45:06,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 680 flow [2024-11-07 15:45:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-11-07 15:45:06,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018018018018018 [2024-11-07 15:45:06,585 INFO L175 Difference]: Start difference. First operand has 322 places, 320 transitions, 650 flow. Second operand 3 states and 1001 transitions. [2024-11-07 15:45:06,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 680 flow [2024-11-07 15:45:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:06,596 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 648 flow [2024-11-07 15:45:06,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2024-11-07 15:45:06,598 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2024-11-07 15:45:06,598 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 648 flow [2024-11-07 15:45:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2024-11-07 15:45:06,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,599 INFO L204 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] [2024-11-07 15:45:06,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:45:06,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash -478338, now seen corresponding path program 1 times [2024-11-07 15:45:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208184740] [2024-11-07 15:45:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208184740] [2024-11-07 15:45:06,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208184740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911598600] [2024-11-07 15:45:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:06,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:06,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-11-07 15:45:06,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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) [2024-11-07 15:45:06,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-11-07 15:45:06,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,862 INFO L124 PetriNetUnfolderBase]: 35/596 cut-off events. [2024-11-07 15:45:06,863 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 15:45:06,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 596 events. 35/596 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2514 event pairs, 16 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 625. Up to 56 conditions per place. [2024-11-07 15:45:06,871 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2024-11-07 15:45:06,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 672 flow [2024-11-07 15:45:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2024-11-07 15:45:06,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8990990990990991 [2024-11-07 15:45:06,875 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 648 flow. Second operand 3 states and 998 transitions. [2024-11-07 15:45:06,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 672 flow [2024-11-07 15:45:06,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:06,883 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 638 flow [2024-11-07 15:45:06,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2024-11-07 15:45:06,884 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -24 predicate places. [2024-11-07 15:45:06,884 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 638 flow [2024-11-07 15:45:06,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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) [2024-11-07 15:45:06,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,885 INFO L204 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] [2024-11-07 15:45:06,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:45:06,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:06,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1722877668, now seen corresponding path program 1 times [2024-11-07 15:45:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248956192] [2024-11-07 15:45:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:07,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:07,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248956192] [2024-11-07 15:45:07,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248956192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:07,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:07,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:07,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183914254] [2024-11-07 15:45:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:07,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:07,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:07,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:07,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 370 [2024-11-07 15:45:07,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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) [2024-11-07 15:45:07,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:07,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 370 [2024-11-07 15:45:07,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:08,419 INFO L124 PetriNetUnfolderBase]: 541/3451 cut-off events. [2024-11-07 15:45:08,420 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-07 15:45:08,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 3451 events. 541/3451 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28454 event pairs, 386 based on Foata normal form. 0/2889 useless extension candidates. Maximal degree in co-relation 4297. Up to 786 conditions per place. [2024-11-07 15:45:08,452 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 31 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2024-11-07 15:45:08,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 314 transitions, 708 flow [2024-11-07 15:45:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1891 transitions. [2024-11-07 15:45:08,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8518018018018018 [2024-11-07 15:45:08,458 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 638 flow. Second operand 6 states and 1891 transitions. [2024-11-07 15:45:08,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 314 transitions, 708 flow [2024-11-07 15:45:08,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:08,463 INFO L231 Difference]: Finished difference. Result has 317 places, 314 transitions, 645 flow [2024-11-07 15:45:08,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=645, PETRI_PLACES=317, PETRI_TRANSITIONS=314} [2024-11-07 15:45:08,464 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2024-11-07 15:45:08,464 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 314 transitions, 645 flow [2024-11-07 15:45:08,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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) [2024-11-07 15:45:08,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:08,466 INFO L204 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] [2024-11-07 15:45:08,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:45:08,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1916769558, now seen corresponding path program 1 times [2024-11-07 15:45:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067688008] [2024-11-07 15:45:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067688008] [2024-11-07 15:45:08,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067688008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:08,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:08,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683362138] [2024-11-07 15:45:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:08,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 370 [2024-11-07 15:45:08,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 314 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2024-11-07 15:45:08,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:08,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 370 [2024-11-07 15:45:08,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:08,678 INFO L124 PetriNetUnfolderBase]: 57/675 cut-off events. [2024-11-07 15:45:08,678 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:45:08,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 675 events. 57/675 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3235 event pairs, 38 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 761. Up to 81 conditions per place. [2024-11-07 15:45:08,685 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 14 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-11-07 15:45:08,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 675 flow [2024-11-07 15:45:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-11-07 15:45:08,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018018018018018 [2024-11-07 15:45:08,688 INFO L175 Difference]: Start difference. First operand has 317 places, 314 transitions, 645 flow. Second operand 3 states and 1001 transitions. [2024-11-07 15:45:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 675 flow [2024-11-07 15:45:08,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 313 transitions, 665 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:45:08,694 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 637 flow [2024-11-07 15:45:08,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2024-11-07 15:45:08,697 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2024-11-07 15:45:08,697 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 637 flow [2024-11-07 15:45:08,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2024-11-07 15:45:08,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:08,698 INFO L204 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] [2024-11-07 15:45:08,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:45:08,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1904622188, now seen corresponding path program 1 times [2024-11-07 15:45:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783605869] [2024-11-07 15:45:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:08,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783605869] [2024-11-07 15:45:08,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783605869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:08,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515218226] [2024-11-07 15:45:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:08,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:08,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:08,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-11-07 15:45:08,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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) [2024-11-07 15:45:08,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:08,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-11-07 15:45:08,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:08,869 INFO L124 PetriNetUnfolderBase]: 52/649 cut-off events. [2024-11-07 15:45:08,870 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-07 15:45:08,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 649 events. 52/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2864 event pairs, 28 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 694. Up to 73 conditions per place. [2024-11-07 15:45:08,878 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2024-11-07 15:45:08,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 309 transitions, 661 flow [2024-11-07 15:45:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2024-11-07 15:45:08,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8990990990990991 [2024-11-07 15:45:08,882 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 637 flow. Second operand 3 states and 998 transitions. [2024-11-07 15:45:08,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 309 transitions, 661 flow [2024-11-07 15:45:08,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 309 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:08,887 INFO L231 Difference]: Finished difference. Result has 309 places, 309 transitions, 627 flow [2024-11-07 15:45:08,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=309, PETRI_TRANSITIONS=309} [2024-11-07 15:45:08,889 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2024-11-07 15:45:08,889 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 309 transitions, 627 flow [2024-11-07 15:45:08,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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) [2024-11-07 15:45:08,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:08,891 INFO L204 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] [2024-11-07 15:45:08,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:45:08,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:08,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash 323218000, now seen corresponding path program 1 times [2024-11-07 15:45:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:08,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042212094] [2024-11-07 15:45:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042212094] [2024-11-07 15:45:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042212094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113952475] [2024-11-07 15:45:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:08,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:08,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 370 [2024-11-07 15:45:08,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 309 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 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) [2024-11-07 15:45:08,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:08,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 370 [2024-11-07 15:45:08,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:09,059 INFO L124 PetriNetUnfolderBase]: 30/587 cut-off events. [2024-11-07 15:45:09,059 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:45:09,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 587 events. 30/587 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2273 event pairs, 5 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 614. Up to 30 conditions per place. [2024-11-07 15:45:09,065 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 14 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2024-11-07 15:45:09,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 663 flow [2024-11-07 15:45:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2024-11-07 15:45:09,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072072072072072 [2024-11-07 15:45:09,068 INFO L175 Difference]: Start difference. First operand has 309 places, 309 transitions, 627 flow. Second operand 3 states and 1007 transitions. [2024-11-07 15:45:09,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 663 flow [2024-11-07 15:45:09,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:09,073 INFO L231 Difference]: Finished difference. Result has 307 places, 306 transitions, 626 flow [2024-11-07 15:45:09,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=307, PETRI_TRANSITIONS=306} [2024-11-07 15:45:09,073 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -31 predicate places. [2024-11-07 15:45:09,074 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 306 transitions, 626 flow [2024-11-07 15:45:09,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 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) [2024-11-07 15:45:09,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:09,075 INFO L204 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] [2024-11-07 15:45:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:45:09,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1374889682, now seen corresponding path program 1 times [2024-11-07 15:45:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002606030] [2024-11-07 15:45:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:09,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002606030] [2024-11-07 15:45:09,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002606030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:09,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362928770] [2024-11-07 15:45:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:09,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:09,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-11-07 15:45:09,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 306 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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) [2024-11-07 15:45:09,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:09,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-11-07 15:45:09,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:09,404 INFO L124 PetriNetUnfolderBase]: 236/2175 cut-off events. [2024-11-07 15:45:09,404 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-07 15:45:09,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 2175 events. 236/2175 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15599 event pairs, 61 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 2513. Up to 305 conditions per place. [2024-11-07 15:45:09,424 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2024-11-07 15:45:09,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 310 transitions, 687 flow [2024-11-07 15:45:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2024-11-07 15:45:09,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9063063063063063 [2024-11-07 15:45:09,428 INFO L175 Difference]: Start difference. First operand has 307 places, 306 transitions, 626 flow. Second operand 3 states and 1006 transitions. [2024-11-07 15:45:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 310 transitions, 687 flow [2024-11-07 15:45:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 310 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:09,436 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 633 flow [2024-11-07 15:45:09,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2024-11-07 15:45:09,437 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -34 predicate places. [2024-11-07 15:45:09,437 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 633 flow [2024-11-07 15:45:09,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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) [2024-11-07 15:45:09,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:09,438 INFO L204 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] [2024-11-07 15:45:09,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:45:09,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -88337490, now seen corresponding path program 1 times [2024-11-07 15:45:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:09,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363361531] [2024-11-07 15:45:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363361531] [2024-11-07 15:45:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363361531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689555829] [2024-11-07 15:45:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:09,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:09,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-11-07 15:45:09,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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) [2024-11-07 15:45:09,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:09,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-11-07 15:45:09,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:09,681 INFO L124 PetriNetUnfolderBase]: 120/903 cut-off events. [2024-11-07 15:45:09,681 INFO L125 PetriNetUnfolderBase]: For 80/88 co-relation queries the response was YES. [2024-11-07 15:45:09,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 903 events. 120/903 cut-off events. For 80/88 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4925 event pairs, 7 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1130. Up to 116 conditions per place. [2024-11-07 15:45:09,692 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 18 selfloop transitions, 3 changer transitions 0/305 dead transitions. [2024-11-07 15:45:09,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 305 transitions, 682 flow [2024-11-07 15:45:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-11-07 15:45:09,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018018018018018 [2024-11-07 15:45:09,696 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 633 flow. Second operand 3 states and 1001 transitions. [2024-11-07 15:45:09,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 305 transitions, 682 flow [2024-11-07 15:45:09,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 305 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:45:09,702 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 631 flow [2024-11-07 15:45:09,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-11-07 15:45:09,703 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -36 predicate places. [2024-11-07 15:45:09,703 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 631 flow [2024-11-07 15:45:09,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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) [2024-11-07 15:45:09,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:09,704 INFO L204 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] [2024-11-07 15:45:09,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:45:09,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:09,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1561843702, now seen corresponding path program 1 times [2024-11-07 15:45:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:09,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539406577] [2024-11-07 15:45:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539406577] [2024-11-07 15:45:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539406577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:45:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110889745] [2024-11-07 15:45:09,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:45:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:09,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:45:09,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:45:10,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 370 [2024-11-07 15:45:10,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 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) [2024-11-07 15:45:10,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:10,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 370 [2024-11-07 15:45:10,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:10,461 INFO L124 PetriNetUnfolderBase]: 115/1253 cut-off events. [2024-11-07 15:45:10,462 INFO L125 PetriNetUnfolderBase]: For 68/108 co-relation queries the response was YES. [2024-11-07 15:45:10,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 1253 events. 115/1253 cut-off events. For 68/108 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7421 event pairs, 30 based on Foata normal form. 6/1141 useless extension candidates. Maximal degree in co-relation 1527. Up to 106 conditions per place. [2024-11-07 15:45:10,476 INFO L140 encePairwiseOnDemand]: 357/370 looper letters, 28 selfloop transitions, 14 changer transitions 0/320 dead transitions. [2024-11-07 15:45:10,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 320 transitions, 771 flow [2024-11-07 15:45:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:45:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 15:45:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3280 transitions. [2024-11-07 15:45:10,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8864864864864865 [2024-11-07 15:45:10,484 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 631 flow. Second operand 10 states and 3280 transitions. [2024-11-07 15:45:10,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 320 transitions, 771 flow [2024-11-07 15:45:10,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 320 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:10,490 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 691 flow [2024-11-07 15:45:10,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2024-11-07 15:45:10,492 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2024-11-07 15:45:10,492 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 691 flow [2024-11-07 15:45:10,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 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) [2024-11-07 15:45:10,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:10,494 INFO L204 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] [2024-11-07 15:45:10,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:45:10,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1054403412, now seen corresponding path program 1 times [2024-11-07 15:45:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:10,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329390448] [2024-11-07 15:45:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329390448] [2024-11-07 15:45:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329390448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:10,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:10,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464410178] [2024-11-07 15:45:10,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:45:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:45:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:45:10,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 370 [2024-11-07 15:45:10,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 691 flow. Second operand has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 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) [2024-11-07 15:45:10,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:10,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 370 [2024-11-07 15:45:10,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:10,974 INFO L124 PetriNetUnfolderBase]: 222/1940 cut-off events. [2024-11-07 15:45:10,974 INFO L125 PetriNetUnfolderBase]: For 191/200 co-relation queries the response was YES. [2024-11-07 15:45:10,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1940 events. 222/1940 cut-off events. For 191/200 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13203 event pairs, 75 based on Foata normal form. 12/1773 useless extension candidates. Maximal degree in co-relation 2499. Up to 218 conditions per place. [2024-11-07 15:45:10,994 INFO L140 encePairwiseOnDemand]: 364/370 looper letters, 30 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2024-11-07 15:45:10,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 323 transitions, 809 flow [2024-11-07 15:45:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:45:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 15:45:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1663 transitions. [2024-11-07 15:45:10,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898918918918919 [2024-11-07 15:45:10,998 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 691 flow. Second operand 5 states and 1663 transitions. [2024-11-07 15:45:10,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 323 transitions, 809 flow [2024-11-07 15:45:11,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 323 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:11,004 INFO L231 Difference]: Finished difference. Result has 318 places, 310 transitions, 712 flow [2024-11-07 15:45:11,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=318, PETRI_TRANSITIONS=310} [2024-11-07 15:45:11,006 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2024-11-07 15:45:11,007 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 310 transitions, 712 flow [2024-11-07 15:45:11,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 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) [2024-11-07 15:45:11,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:11,008 INFO L204 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] [2024-11-07 15:45:11,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:45:11,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 88694419, now seen corresponding path program 1 times [2024-11-07 15:45:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140423616] [2024-11-07 15:45:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140423616] [2024-11-07 15:45:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140423616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649742015] [2024-11-07 15:45:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:11,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:11,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 370 [2024-11-07 15:45:11,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 310 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 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) [2024-11-07 15:45:11,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:11,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 370 [2024-11-07 15:45:11,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:12,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1297] L64-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse9 (+ .cse13 v_~A~0.offset_222))) (let ((.cse10 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse9))) (let ((.cse3 (+ v_~mts3~0_159 .cse10))) (let ((.cse12 (<= .cse3 2147483647)) (.cse6 (select |v_#race_453| v_~A~0.base_222)) (.cse8 (+ .cse13 v_~A~0.offset_222 1)) (.cse7 (+ .cse13 v_~A~0.offset_222 2)) (.cse1 (+ .cse13 v_~A~0.offset_222 3)) (.cse11 (<= 0 (+ v_~mts3~0_159 2147483648 .cse10))) (.cse0 (select |v_#race_441| v_~A~0.base_222))) (and (= (select .cse0 .cse1) 0) (let ((.cse2 (= |v_#race~A~0_277| 0)) (.cse4 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse9 0) .cse8 0) .cse7 0) .cse1 0)))) (.cse5 (= |v_#race~mts3~0_254| 0))) (or (and .cse2 (= v_~mts3~0_158 0) (< .cse3 0) .cse4 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_180|) .cse5) (and (= (select .cse6 .cse7) 0) (<= 0 .cse3) .cse2 (= (select .cse6 .cse8) 0) .cse4 (= (select .cse6 .cse1) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse5 (= (select .cse6 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse10)))) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse8) 0) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648)) (<= v_~sum~0_94 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) .cse11 (<= v_~sum~0_93 2147483647) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= .cse10 0) .cse12) 1 0) 0)) (= (select .cse0 .cse7) 0) .cse12 (= (+ v_~sum~0_94 .cse10) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse6 .cse9 0) .cse8 0) .cse7 0) .cse1 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_94)) 1 0) 0)) (not (= (ite (or .cse11 (<= 0 .cse10)) 1 0) 0)) (= (select .cse0 .cse9) 0) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{#race=|v_#race_441|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, #race~sum~0=|v_#race~sum~0_123|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][178], [Black: 418#(<= (+ ~M~0 1) 0), 83#L59true, Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 387#true, 383#(= |#race~M~0| 0), 422#true, 208#L48-3true, 194#L67true, 389#(= |#race~A~0| 0), 206#L86-4true, Black: 406#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 371#(= |#race~N~0| 0), 415#true, Black: 400#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 404#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 399#(<= ~N~0 0)]) [2024-11-07 15:45:12,035 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-07 15:45:12,035 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-07 15:45:12,035 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-07 15:45:12,035 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-07 15:45:12,093 INFO L124 PetriNetUnfolderBase]: 406/2433 cut-off events. [2024-11-07 15:45:12,094 INFO L125 PetriNetUnfolderBase]: For 450/464 co-relation queries the response was YES. [2024-11-07 15:45:12,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 2433 events. 406/2433 cut-off events. For 450/464 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 18120 event pairs, 71 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 3468. Up to 281 conditions per place. [2024-11-07 15:45:12,114 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 36 selfloop transitions, 5 changer transitions 0/320 dead transitions. [2024-11-07 15:45:12,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 830 flow [2024-11-07 15:45:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2024-11-07 15:45:12,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774774774774775 [2024-11-07 15:45:12,119 INFO L175 Difference]: Start difference. First operand has 318 places, 310 transitions, 712 flow. Second operand 6 states and 1948 transitions. [2024-11-07 15:45:12,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 830 flow [2024-11-07 15:45:12,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:12,127 INFO L231 Difference]: Finished difference. Result has 319 places, 308 transitions, 713 flow [2024-11-07 15:45:12,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=319, PETRI_TRANSITIONS=308} [2024-11-07 15:45:12,129 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -19 predicate places. [2024-11-07 15:45:12,130 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 308 transitions, 713 flow [2024-11-07 15:45:12,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 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) [2024-11-07 15:45:12,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:12,131 INFO L204 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] [2024-11-07 15:45:12,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:45:12,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1262275170, now seen corresponding path program 1 times [2024-11-07 15:45:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677098616] [2024-11-07 15:45:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:45:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677098616] [2024-11-07 15:45:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677098616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:12,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984453703] [2024-11-07 15:45:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:12,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 370 [2024-11-07 15:45:12,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 308 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 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) [2024-11-07 15:45:12,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:12,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 370 [2024-11-07 15:45:12,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:13,115 INFO L124 PetriNetUnfolderBase]: 251/1801 cut-off events. [2024-11-07 15:45:13,116 INFO L125 PetriNetUnfolderBase]: For 239/319 co-relation queries the response was YES. [2024-11-07 15:45:13,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1801 events. 251/1801 cut-off events. For 239/319 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12920 event pairs, 50 based on Foata normal form. 4/1680 useless extension candidates. Maximal degree in co-relation 2617. Up to 221 conditions per place. [2024-11-07 15:45:13,134 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 36 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2024-11-07 15:45:13,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 318 transitions, 831 flow [2024-11-07 15:45:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2024-11-07 15:45:13,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774774774774775 [2024-11-07 15:45:13,139 INFO L175 Difference]: Start difference. First operand has 319 places, 308 transitions, 713 flow. Second operand 6 states and 1948 transitions. [2024-11-07 15:45:13,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 318 transitions, 831 flow [2024-11-07 15:45:13,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 821 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:45:13,147 INFO L231 Difference]: Finished difference. Result has 317 places, 306 transitions, 709 flow [2024-11-07 15:45:13,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=317, PETRI_TRANSITIONS=306} [2024-11-07 15:45:13,148 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2024-11-07 15:45:13,148 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 306 transitions, 709 flow [2024-11-07 15:45:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 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) [2024-11-07 15:45:13,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:13,150 INFO L204 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] [2024-11-07 15:45:13,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:45:13,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:13,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash 17984448, now seen corresponding path program 1 times [2024-11-07 15:45:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441183445] [2024-11-07 15:45:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:13,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441183445] [2024-11-07 15:45:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441183445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934853802] [2024-11-07 15:45:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:13,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:13,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 370 [2024-11-07 15:45:13,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 306 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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) [2024-11-07 15:45:13,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:13,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 370 [2024-11-07 15:45:13,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:13,357 INFO L124 PetriNetUnfolderBase]: 73/1183 cut-off events. [2024-11-07 15:45:13,357 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2024-11-07 15:45:13,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1183 events. 73/1183 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6780 event pairs, 11 based on Foata normal form. 8/1126 useless extension candidates. Maximal degree in co-relation 1459. Up to 99 conditions per place. [2024-11-07 15:45:13,367 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 9 selfloop transitions, 1 changer transitions 2/304 dead transitions. [2024-11-07 15:45:13,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 304 transitions, 727 flow [2024-11-07 15:45:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-11-07 15:45:13,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108108108108108 [2024-11-07 15:45:13,371 INFO L175 Difference]: Start difference. First operand has 317 places, 306 transitions, 709 flow. Second operand 3 states and 1011 transitions. [2024-11-07 15:45:13,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 304 transitions, 727 flow [2024-11-07 15:45:13,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:45:13,376 INFO L231 Difference]: Finished difference. Result has 312 places, 302 transitions, 693 flow [2024-11-07 15:45:13,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=312, PETRI_TRANSITIONS=302} [2024-11-07 15:45:13,377 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -26 predicate places. [2024-11-07 15:45:13,377 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 302 transitions, 693 flow [2024-11-07 15:45:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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) [2024-11-07 15:45:13,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:13,378 INFO L204 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] [2024-11-07 15:45:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:45:13,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1772614929, now seen corresponding path program 1 times [2024-11-07 15:45:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105174707] [2024-11-07 15:45:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:13,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:13,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105174707] [2024-11-07 15:45:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105174707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:13,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882663513] [2024-11-07 15:45:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:13,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 370 [2024-11-07 15:45:13,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 302 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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) [2024-11-07 15:45:13,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:13,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 370 [2024-11-07 15:45:13,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:13,566 INFO L124 PetriNetUnfolderBase]: 73/1151 cut-off events. [2024-11-07 15:45:13,567 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2024-11-07 15:45:13,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1151 events. 73/1151 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6456 event pairs, 11 based on Foata normal form. 8/1110 useless extension candidates. Maximal degree in co-relation 1405. Up to 99 conditions per place. [2024-11-07 15:45:13,576 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 6 selfloop transitions, 0 changer transitions 14/300 dead transitions. [2024-11-07 15:45:13,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 300 transitions, 711 flow [2024-11-07 15:45:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-11-07 15:45:13,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108108108108108 [2024-11-07 15:45:13,579 INFO L175 Difference]: Start difference. First operand has 312 places, 302 transitions, 693 flow. Second operand 3 states and 1011 transitions. [2024-11-07 15:45:13,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 300 transitions, 711 flow [2024-11-07 15:45:13,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 300 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:13,584 INFO L231 Difference]: Finished difference. Result has 309 places, 286 transitions, 657 flow [2024-11-07 15:45:13,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=309, PETRI_TRANSITIONS=286} [2024-11-07 15:45:13,585 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2024-11-07 15:45:13,585 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 286 transitions, 657 flow [2024-11-07 15:45:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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) [2024-11-07 15:45:13,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:13,586 INFO L204 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] [2024-11-07 15:45:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:45:13,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 215320777, now seen corresponding path program 1 times [2024-11-07 15:45:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360768514] [2024-11-07 15:45:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360768514] [2024-11-07 15:45:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360768514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:13,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694482206] [2024-11-07 15:45:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:13,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:13,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 370 [2024-11-07 15:45:13,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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) [2024-11-07 15:45:13,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:13,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 370 [2024-11-07 15:45:13,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:13,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1297] L64-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse9 (+ .cse13 v_~A~0.offset_222))) (let ((.cse10 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse9))) (let ((.cse3 (+ v_~mts3~0_159 .cse10))) (let ((.cse12 (<= .cse3 2147483647)) (.cse6 (select |v_#race_453| v_~A~0.base_222)) (.cse8 (+ .cse13 v_~A~0.offset_222 1)) (.cse7 (+ .cse13 v_~A~0.offset_222 2)) (.cse1 (+ .cse13 v_~A~0.offset_222 3)) (.cse11 (<= 0 (+ v_~mts3~0_159 2147483648 .cse10))) (.cse0 (select |v_#race_441| v_~A~0.base_222))) (and (= (select .cse0 .cse1) 0) (let ((.cse2 (= |v_#race~A~0_277| 0)) (.cse4 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse9 0) .cse8 0) .cse7 0) .cse1 0)))) (.cse5 (= |v_#race~mts3~0_254| 0))) (or (and .cse2 (= v_~mts3~0_158 0) (< .cse3 0) .cse4 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_180|) .cse5) (and (= (select .cse6 .cse7) 0) (<= 0 .cse3) .cse2 (= (select .cse6 .cse8) 0) .cse4 (= (select .cse6 .cse1) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse5 (= (select .cse6 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse10)))) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse8) 0) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648)) (<= v_~sum~0_94 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) .cse11 (<= v_~sum~0_93 2147483647) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= .cse10 0) .cse12) 1 0) 0)) (= (select .cse0 .cse7) 0) .cse12 (= (+ v_~sum~0_94 .cse10) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse6 .cse9 0) .cse8 0) .cse7 0) .cse1 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_94)) 1 0) 0)) (not (= (ite (or .cse11 (<= 0 .cse10)) 1 0) 0)) (= (select .cse0 .cse9) 0) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{#race=|v_#race_441|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, #race~sum~0=|v_#race~sum~0_123|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][175], [437#true, Black: 418#(<= (+ ~M~0 1) 0), Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 387#true, 383#(= |#race~M~0| 0), 440#true, 208#L48-3true, 194#L67true, 389#(= |#race~A~0| 0), 206#L86-4true, 371#(= |#race~N~0| 0), Black: 406#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 400#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 404#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 399#(<= ~N~0 0), 270#L56-1true]) [2024-11-07 15:45:13,849 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-07 15:45:13,850 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-07 15:45:13,850 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-07 15:45:13,850 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-07 15:45:13,901 INFO L124 PetriNetUnfolderBase]: 205/1866 cut-off events. [2024-11-07 15:45:13,901 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2024-11-07 15:45:13,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1866 events. 205/1866 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12093 event pairs, 54 based on Foata normal form. 0/1744 useless extension candidates. Maximal degree in co-relation 2405. Up to 200 conditions per place. [2024-11-07 15:45:13,918 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 12 selfloop transitions, 2 changer transitions 7/288 dead transitions. [2024-11-07 15:45:13,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 695 flow [2024-11-07 15:45:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2024-11-07 15:45:13,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2024-11-07 15:45:13,921 INFO L175 Difference]: Start difference. First operand has 309 places, 286 transitions, 657 flow. Second operand 3 states and 1005 transitions. [2024-11-07 15:45:13,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 695 flow [2024-11-07 15:45:13,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 695 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:45:13,926 INFO L231 Difference]: Finished difference. Result has 294 places, 279 transitions, 627 flow [2024-11-07 15:45:13,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=294, PETRI_TRANSITIONS=279} [2024-11-07 15:45:13,927 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -44 predicate places. [2024-11-07 15:45:13,927 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 279 transitions, 627 flow [2024-11-07 15:45:13,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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) [2024-11-07 15:45:13,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:13,928 INFO L204 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] [2024-11-07 15:45:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:45:13,928 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-07 15:45:13,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 55616852, now seen corresponding path program 1 times [2024-11-07 15:45:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396248883] [2024-11-07 15:45:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:45:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396248883] [2024-11-07 15:45:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396248883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32299523] [2024-11-07 15:45:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:13,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 370 [2024-11-07 15:45:13,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 279 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 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) [2024-11-07 15:45:13,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:13,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 370 [2024-11-07 15:45:13,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:14,217 INFO L124 PetriNetUnfolderBase]: 125/1615 cut-off events. [2024-11-07 15:45:14,218 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-07 15:45:14,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1615 events. 125/1615 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9783 event pairs, 37 based on Foata normal form. 0/1522 useless extension candidates. Maximal degree in co-relation 2004. Up to 131 conditions per place. [2024-11-07 15:45:14,228 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2024-11-07 15:45:14,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 281 transitions, 665 flow [2024-11-07 15:45:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2024-11-07 15:45:14,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081081081081082 [2024-11-07 15:45:14,232 INFO L175 Difference]: Start difference. First operand has 294 places, 279 transitions, 627 flow. Second operand 3 states and 1008 transitions. [2024-11-07 15:45:14,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 281 transitions, 665 flow [2024-11-07 15:45:14,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 641 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-07 15:45:14,237 INFO L231 Difference]: Finished difference. Result has 283 places, 0 transitions, 0 flow [2024-11-07 15:45:14,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=283, PETRI_TRANSITIONS=0} [2024-11-07 15:45:14,238 INFO L277 CegarLoopForPetriNet]: 338 programPoint places, -55 predicate places. [2024-11-07 15:45:14,238 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 0 transitions, 0 flow [2024-11-07 15:45:14,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 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) [2024-11-07 15:45:14,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 76 remaining) [2024-11-07 15:45:14,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 76 remaining) [2024-11-07 15:45:14,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (66 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 76 remaining) [2024-11-07 15:45:14,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 76 remaining) [2024-11-07 15:45:14,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (47 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 76 remaining) [2024-11-07 15:45:14,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 76 remaining) [2024-11-07 15:45:14,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (33 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (32 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 76 remaining) [2024-11-07 15:45:14,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 76 remaining) [2024-11-07 15:45:14,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (12 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (9 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (8 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 76 remaining) [2024-11-07 15:45:14,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 76 remaining) [2024-11-07 15:45:14,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 76 remaining) [2024-11-07 15:45:14,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 76 remaining) [2024-11-07 15:45:14,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 76 remaining) [2024-11-07 15:45:14,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 76 remaining) [2024-11-07 15:45:14,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 76 remaining) [2024-11-07 15:45:14,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 76 remaining) [2024-11-07 15:45:14,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:45:14,250 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:14,255 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:45:14,255 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:45:14,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:45:14 BasicIcfg [2024-11-07 15:45:14,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:45:14,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:45:14,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:45:14,261 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:45:14,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:05" (3/4) ... [2024-11-07 15:45:14,263 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:45:14,265 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:45:14,265 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:45:14,265 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-07 15:45:14,271 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-07 15:45:14,271 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 15:45:14,272 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:45:14,272 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:45:14,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:45:14,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:45:14,359 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:45:14,360 INFO L158 Benchmark]: Toolchain (without parser) took 10699.74ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 92.2MB in the beginning and 330.2MB in the end (delta: -238.0MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-07 15:45:14,362 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:45:14,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.44ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:45:14,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.72ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 76.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:45:14,363 INFO L158 Benchmark]: Boogie Preprocessor took 76.60ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:45:14,363 INFO L158 Benchmark]: RCFGBuilder took 1209.14ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 73.5MB in the beginning and 79.8MB in the end (delta: -6.3MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-11-07 15:45:14,363 INFO L158 Benchmark]: TraceAbstraction took 8940.29ms. Allocated memory was 159.4MB in the beginning and 436.2MB in the end (delta: 276.8MB). Free memory was 79.3MB in the beginning and 334.1MB in the end (delta: -254.8MB). Peak memory consumption was 188.7MB. Max. memory is 16.1GB. [2024-11-07 15:45:14,363 INFO L158 Benchmark]: Witness Printer took 98.55ms. Allocated memory is still 436.2MB. Free memory was 334.1MB in the beginning and 330.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:45:14,366 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.44ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.72ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 76.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.60ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1209.14ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 73.5MB in the beginning and 79.8MB in the end (delta: -6.3MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8940.29ms. Allocated memory was 159.4MB in the beginning and 436.2MB in the end (delta: 276.8MB). Free memory was 79.3MB in the beginning and 334.1MB in the end (delta: -254.8MB). Peak memory consumption was 188.7MB. Max. memory is 16.1GB. * Witness Printer took 98.55ms. Allocated memory is still 436.2MB. Free memory was 334.1MB in the beginning and 330.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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 7 procedures, 534 locations, 76 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: 8.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 195 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=12, InterpolantAutomatonStates: 69, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1538 NumberOfCodeBlocks, 1538 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 2112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 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 - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:45:14,400 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