./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.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/array-eq-symm.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', '6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d'] 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/array-eq-symm.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 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:41:15,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:41:15,954 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:41:15,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:41:15,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:41:15,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:41:15,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:41:15,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:41:15,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:41:15,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:41:15,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:41:15,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:41:15,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:41:15,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:41:15,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:41:15,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:41:15,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:41:15,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:41:15,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:41:15,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:41:15,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:41:15,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:41:15,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:41:15,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:41:15,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:41:15,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:41:15,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:41:15,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:41:15,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:41:15,998 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 -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2024-11-07 15:41:16,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:41:16,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:41:16,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:41:16,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:41:16,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:41:16,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-07 15:41:17,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:41:17,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:41:17,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-07 15:41:17,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49445c21c/09ea3c2635714e57b6e301b4cb56bc6d/FLAG4813eac4e [2024-11-07 15:41:17,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49445c21c/09ea3c2635714e57b6e301b4cb56bc6d [2024-11-07 15:41:17,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:41:17,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:41:17,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:41:17,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:41:17,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:41:17,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:41:17" (1/1) ... [2024-11-07 15:41:17,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c43a3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:17, skipping insertion in model container [2024-11-07 15:41:17,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:41:17" (1/1) ... [2024-11-07 15:41:17,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:41:18,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:41:18,136 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:41:18,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:41:18,174 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:41:18,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18 WrapperNode [2024-11-07 15:41:18,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:41:18,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:41:18,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:41:18,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:41:18,181 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:41:18" (1/1) ... [2024-11-07 15:41:18,190 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:41:18" (1/1) ... [2024-11-07 15:41:18,223 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 145 [2024-11-07 15:41:18,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:41:18,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:41:18,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:41:18,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:41:18,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:41:18,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:41:18,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:41:18,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:41:18,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (1/1) ... [2024-11-07 15:41:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:41:18,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:41:18,313 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:41:18,321 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:41:18,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:41:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:41:18,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:41:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:41:18,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:41:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:41:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:41:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:41:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:41:18,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:41:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:41:18,347 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:41:18,466 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:41:18,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:41:18,934 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:41:18,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:41:18,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:41:18,962 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 15:41:18,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:41:18 BoogieIcfgContainer [2024-11-07 15:41:18,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:41:18,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:41:18,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:41:18,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:41:18,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:41:17" (1/3) ... [2024-11-07 15:41:18,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3698d4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:41:18, skipping insertion in model container [2024-11-07 15:41:18,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:41:18" (2/3) ... [2024-11-07 15:41:18,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3698d4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:41:18, skipping insertion in model container [2024-11-07 15:41:18,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:41:18" (3/3) ... [2024-11-07 15:41:18,971 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2024-11-07 15:41:18,986 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:41:18,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-07 15:41:18,988 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:41:19,100 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:41:19,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 320 transitions, 654 flow [2024-11-07 15:41:19,275 INFO L124 PetriNetUnfolderBase]: 17/318 cut-off events. [2024-11-07 15:41:19,277 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:41:19,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 318 events. 17/318 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 537 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 226. Up to 3 conditions per place. [2024-11-07 15:41:19,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 320 transitions, 654 flow [2024-11-07 15:41:19,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 301 transitions, 614 flow [2024-11-07 15:41:19,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:41:19,346 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;@27d5893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:41:19,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-07 15:41:19,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:41:19,354 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-07 15:41:19,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:41:19,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:19,355 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] [2024-11-07 15:41:19,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:19,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -729778242, now seen corresponding path program 1 times [2024-11-07 15:41:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851734174] [2024-11-07 15:41:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:19,535 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:41:19,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851734174] [2024-11-07 15:41:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851734174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356766986] [2024-11-07 15:41:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:19,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:19,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-07 15:41:19,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:41:19,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:19,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-07 15:41:19,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:19,744 INFO L124 PetriNetUnfolderBase]: 17/428 cut-off events. [2024-11-07 15:41:19,744 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-07 15:41:19,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 428 events. 17/428 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1193 event pairs, 3 based on Foata normal form. 14/366 useless extension candidates. Maximal degree in co-relation 287. Up to 19 conditions per place. [2024-11-07 15:41:19,752 INFO L140 encePairwiseOnDemand]: 309/320 looper letters, 10 selfloop transitions, 2 changer transitions 4/292 dead transitions. [2024-11-07 15:41:19,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 620 flow [2024-11-07 15:41:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2024-11-07 15:41:19,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946875 [2024-11-07 15:41:19,773 INFO L175 Difference]: Start difference. First operand has 292 places, 301 transitions, 614 flow. Second operand 3 states and 909 transitions. [2024-11-07 15:41:19,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 620 flow [2024-11-07 15:41:19,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 292 transitions, 612 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 15:41:19,792 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 584 flow [2024-11-07 15:41:19,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2024-11-07 15:41:19,800 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -3 predicate places. [2024-11-07 15:41:19,800 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 584 flow [2024-11-07 15:41:19,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:41:19,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:19,801 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] [2024-11-07 15:41:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:41:19,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1256530651, now seen corresponding path program 1 times [2024-11-07 15:41:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100703382] [2024-11-07 15:41:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:19,876 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:41:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:19,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100703382] [2024-11-07 15:41:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100703382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:19,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:19,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736654519] [2024-11-07 15:41:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:19,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-07 15:41:19,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:41:19,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:19,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-07 15:41:19,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:19,997 INFO L124 PetriNetUnfolderBase]: 17/425 cut-off events. [2024-11-07 15:41:19,997 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-07 15:41:20,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 425 events. 17/425 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1139 event pairs, 3 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 422. Up to 18 conditions per place. [2024-11-07 15:41:20,005 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-07 15:41:20,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 287 transitions, 606 flow [2024-11-07 15:41:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2024-11-07 15:41:20,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385416666666667 [2024-11-07 15:41:20,010 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 584 flow. Second operand 3 states and 901 transitions. [2024-11-07 15:41:20,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 287 transitions, 606 flow [2024-11-07 15:41:20,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:20,018 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 582 flow [2024-11-07 15:41:20,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2024-11-07 15:41:20,021 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -8 predicate places. [2024-11-07 15:41:20,021 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 582 flow [2024-11-07 15:41:20,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:41:20,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:20,022 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] [2024-11-07 15:41:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:41:20,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:20,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1013617658, now seen corresponding path program 1 times [2024-11-07 15:41:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011929069] [2024-11-07 15:41:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:20,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:20,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:41:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011929069] [2024-11-07 15:41:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011929069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52682334] [2024-11-07 15:41:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:20,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-07 15:41:20,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:41:20,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:20,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-07 15:41:20,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:20,229 INFO L124 PetriNetUnfolderBase]: 33/617 cut-off events. [2024-11-07 15:41:20,230 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:41:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 617 events. 33/617 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2319 event pairs, 8 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 622. Up to 33 conditions per place. [2024-11-07 15:41:20,235 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-11-07 15:41:20,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 598 flow [2024-11-07 15:41:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2024-11-07 15:41:20,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395833333333333 [2024-11-07 15:41:20,239 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 582 flow. Second operand 3 states and 902 transitions. [2024-11-07 15:41:20,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 598 flow [2024-11-07 15:41:20,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:20,244 INFO L231 Difference]: Finished difference. Result has 281 places, 284 transitions, 574 flow [2024-11-07 15:41:20,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=284} [2024-11-07 15:41:20,246 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2024-11-07 15:41:20,246 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 284 transitions, 574 flow [2024-11-07 15:41:20,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:41:20,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:20,248 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] [2024-11-07 15:41:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:41:20,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:20,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash 105830857, now seen corresponding path program 1 times [2024-11-07 15:41:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139117923] [2024-11-07 15:41:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:20,936 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:41:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139117923] [2024-11-07 15:41:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139117923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:20,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:20,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:41:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985261499] [2024-11-07 15:41:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:20,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:41:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:41:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:41:21,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 320 [2024-11-07 15:41:21,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 284 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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:41:21,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:21,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 320 [2024-11-07 15:41:21,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:21,502 INFO L124 PetriNetUnfolderBase]: 146/1249 cut-off events. [2024-11-07 15:41:21,503 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-11-07 15:41:21,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1249 events. 146/1249 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7405 event pairs, 80 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1459. Up to 224 conditions per place. [2024-11-07 15:41:21,540 INFO L140 encePairwiseOnDemand]: 308/320 looper letters, 36 selfloop transitions, 10 changer transitions 0/282 dead transitions. [2024-11-07 15:41:21,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 662 flow [2024-11-07 15:41:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:41:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:41:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1620 transitions. [2024-11-07 15:41:21,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-11-07 15:41:21,546 INFO L175 Difference]: Start difference. First operand has 281 places, 284 transitions, 574 flow. Second operand 6 states and 1620 transitions. [2024-11-07 15:41:21,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 662 flow [2024-11-07 15:41:21,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:41:21,551 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 589 flow [2024-11-07 15:41:21,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-11-07 15:41:21,552 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2024-11-07 15:41:21,552 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 589 flow [2024-11-07 15:41:21,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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:41:21,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:21,553 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] [2024-11-07 15:41:21,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:41:21,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1814160356, now seen corresponding path program 1 times [2024-11-07 15:41:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202921175] [2024-11-07 15:41:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:21,603 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:41:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:21,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202921175] [2024-11-07 15:41:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202921175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:21,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901267311] [2024-11-07 15:41:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:21,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:21,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 320 [2024-11-07 15:41:21,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:41:21,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:21,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 320 [2024-11-07 15:41:21,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:21,688 INFO L124 PetriNetUnfolderBase]: 14/353 cut-off events. [2024-11-07 15:41:21,689 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-07 15:41:21,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 353 events. 14/353 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 851 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2024-11-07 15:41:21,692 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-07 15:41:21,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 281 transitions, 609 flow [2024-11-07 15:41:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2024-11-07 15:41:21,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.940625 [2024-11-07 15:41:21,696 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 589 flow. Second operand 3 states and 903 transitions. [2024-11-07 15:41:21,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 281 transitions, 609 flow [2024-11-07 15:41:21,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:41:21,701 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 571 flow [2024-11-07 15:41:21,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2024-11-07 15:41:21,702 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2024-11-07 15:41:21,702 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 571 flow [2024-11-07 15:41:21,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:41:21,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:21,703 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] [2024-11-07 15:41:21,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:41:21,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2916052, now seen corresponding path program 1 times [2024-11-07 15:41:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367677698] [2024-11-07 15:41:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:21,736 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:41:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367677698] [2024-11-07 15:41:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367677698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:21,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:21,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69846094] [2024-11-07 15:41:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:21,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:21,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:21,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-07 15:41:21,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:41:21,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:21,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-07 15:41:21,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:21,850 INFO L124 PetriNetUnfolderBase]: 35/610 cut-off events. [2024-11-07 15:41:21,850 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-07 15:41:21,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 610 events. 35/610 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2457 event pairs, 8 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 617. Up to 34 conditions per place. [2024-11-07 15:41:21,855 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2024-11-07 15:41:21,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 278 transitions, 587 flow [2024-11-07 15:41:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2024-11-07 15:41:21,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395833333333333 [2024-11-07 15:41:21,858 INFO L175 Difference]: Start difference. First operand has 279 places, 281 transitions, 571 flow. Second operand 3 states and 902 transitions. [2024-11-07 15:41:21,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 278 transitions, 587 flow [2024-11-07 15:41:21,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:21,862 INFO L231 Difference]: Finished difference. Result has 276 places, 278 transitions, 563 flow [2024-11-07 15:41:21,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=276, PETRI_TRANSITIONS=278} [2024-11-07 15:41:21,864 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2024-11-07 15:41:21,864 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 278 transitions, 563 flow [2024-11-07 15:41:21,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:41:21,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:21,865 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:41:21,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:41:21,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1117541342, now seen corresponding path program 1 times [2024-11-07 15:41:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377556683] [2024-11-07 15:41:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:21,934 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:41:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:21,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377556683] [2024-11-07 15:41:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377556683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101257254] [2024-11-07 15:41:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:21,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:21,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 320 [2024-11-07 15:41:21,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:41:21,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:21,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 320 [2024-11-07 15:41:21,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,004 INFO L124 PetriNetUnfolderBase]: 14/348 cut-off events. [2024-11-07 15:41:22,005 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-07 15:41:22,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 348 events. 14/348 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 738 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 335. Up to 16 conditions per place. [2024-11-07 15:41:22,008 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 9 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-11-07 15:41:22,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 277 transitions, 583 flow [2024-11-07 15:41:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2024-11-07 15:41:22,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.940625 [2024-11-07 15:41:22,011 INFO L175 Difference]: Start difference. First operand has 276 places, 278 transitions, 563 flow. Second operand 3 states and 903 transitions. [2024-11-07 15:41:22,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 277 transitions, 583 flow [2024-11-07 15:41:22,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:41:22,016 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 564 flow [2024-11-07 15:41:22,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2024-11-07 15:41:22,017 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2024-11-07 15:41:22,018 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 564 flow [2024-11-07 15:41:22,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:41:22,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,019 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] [2024-11-07 15:41:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:41:22,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash 226025314, now seen corresponding path program 1 times [2024-11-07 15:41:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447238981] [2024-11-07 15:41:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:22,094 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:41:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447238981] [2024-11-07 15:41:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447238981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:22,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:22,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:22,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800844998] [2024-11-07 15:41:22,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:22,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:22,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:22,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:22,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 320 [2024-11-07 15:41:22,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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:41:22,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:22,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 320 [2024-11-07 15:41:22,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,171 INFO L124 PetriNetUnfolderBase]: 22/341 cut-off events. [2024-11-07 15:41:22,171 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:41:22,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 341 events. 22/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 867 event pairs, 1 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 364. Up to 35 conditions per place. [2024-11-07 15:41:22,174 INFO L140 encePairwiseOnDemand]: 312/320 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-11-07 15:41:22,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 272 transitions, 591 flow [2024-11-07 15:41:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2024-11-07 15:41:22,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.921875 [2024-11-07 15:41:22,177 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 564 flow. Second operand 3 states and 885 transitions. [2024-11-07 15:41:22,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 272 transitions, 591 flow [2024-11-07 15:41:22,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 272 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:22,182 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 552 flow [2024-11-07 15:41:22,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2024-11-07 15:41:22,183 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -22 predicate places. [2024-11-07 15:41:22,183 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 552 flow [2024-11-07 15:41:22,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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:41:22,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,184 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:41:22,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:41:22,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash -242011099, now seen corresponding path program 1 times [2024-11-07 15:41:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989424207] [2024-11-07 15:41:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:22,238 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:41:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:22,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989424207] [2024-11-07 15:41:22,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989424207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:22,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:22,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93403524] [2024-11-07 15:41:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:22,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:22,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:22,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 320 [2024-11-07 15:41:22,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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:41:22,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:22,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 320 [2024-11-07 15:41:22,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,320 INFO L124 PetriNetUnfolderBase]: 22/335 cut-off events. [2024-11-07 15:41:22,320 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-07 15:41:22,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 335 events. 22/335 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 885 event pairs, 1 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 346. Up to 33 conditions per place. [2024-11-07 15:41:22,323 INFO L140 encePairwiseOnDemand]: 312/320 looper letters, 13 selfloop transitions, 2 changer transitions 4/266 dead transitions. [2024-11-07 15:41:22,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 266 transitions, 577 flow [2024-11-07 15:41:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-07 15:41:22,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9208333333333333 [2024-11-07 15:41:22,325 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 552 flow. Second operand 3 states and 884 transitions. [2024-11-07 15:41:22,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 266 transitions, 577 flow [2024-11-07 15:41:22,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 266 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:22,330 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 531 flow [2024-11-07 15:41:22,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2024-11-07 15:41:22,331 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2024-11-07 15:41:22,331 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 531 flow [2024-11-07 15:41:22,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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:41:22,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,332 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] [2024-11-07 15:41:22,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:41:22,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash -161525969, now seen corresponding path program 1 times [2024-11-07 15:41:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766900184] [2024-11-07 15:41:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:22,379 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:41:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766900184] [2024-11-07 15:41:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766900184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:41:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399576034] [2024-11-07 15:41:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:22,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 320 [2024-11-07 15:41:22,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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:41:22,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:22,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 320 [2024-11-07 15:41:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,433 INFO L124 PetriNetUnfolderBase]: 22/391 cut-off events. [2024-11-07 15:41:22,434 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:41:22,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 391 events. 22/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1024 event pairs, 6 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 403. Up to 23 conditions per place. [2024-11-07 15:41:22,436 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2024-11-07 15:41:22,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 562 flow [2024-11-07 15:41:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-07 15:41:22,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9458333333333333 [2024-11-07 15:41:22,439 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 531 flow. Second operand 3 states and 908 transitions. [2024-11-07 15:41:22,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 562 flow [2024-11-07 15:41:22,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 263 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:22,446 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 545 flow [2024-11-07 15:41:22,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2024-11-07 15:41:22,447 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -30 predicate places. [2024-11-07 15:41:22,448 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 545 flow [2024-11-07 15:41:22,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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:41:22,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,449 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] [2024-11-07 15:41:22,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:41:22,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1390540956, now seen corresponding path program 1 times [2024-11-07 15:41:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958277436] [2024-11-07 15:41:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:22,492 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:41:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958277436] [2024-11-07 15:41:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958277436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:22,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202077880] [2024-11-07 15:41:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:22,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:22,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:22,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:22,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 320 [2024-11-07 15:41:22,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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:41:22,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:22,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 320 [2024-11-07 15:41:22,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,574 INFO L124 PetriNetUnfolderBase]: 37/614 cut-off events. [2024-11-07 15:41:22,574 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-07 15:41:22,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 614 events. 37/614 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2196 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 654. Up to 32 conditions per place. [2024-11-07 15:41:22,579 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-07 15:41:22,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 264 transitions, 575 flow [2024-11-07 15:41:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2024-11-07 15:41:22,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9489583333333333 [2024-11-07 15:41:22,582 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 545 flow. Second operand 3 states and 911 transitions. [2024-11-07 15:41:22,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 264 transitions, 575 flow [2024-11-07 15:41:22,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:22,588 INFO L231 Difference]: Finished difference. Result has 261 places, 262 transitions, 549 flow [2024-11-07 15:41:22,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=261, PETRI_TRANSITIONS=262} [2024-11-07 15:41:22,589 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -31 predicate places. [2024-11-07 15:41:22,589 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 262 transitions, 549 flow [2024-11-07 15:41:22,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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:41:22,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,590 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] [2024-11-07 15:41:22,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:41:22,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash 56279666, now seen corresponding path program 1 times [2024-11-07 15:41:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365652904] [2024-11-07 15:41:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:22,646 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:41:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365652904] [2024-11-07 15:41:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365652904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:41:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364484756] [2024-11-07 15:41:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:22,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:22,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 320 [2024-11-07 15:41:22,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 262 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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:41:22,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:22,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 320 [2024-11-07 15:41:22,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,718 INFO L124 PetriNetUnfolderBase]: 50/492 cut-off events. [2024-11-07 15:41:22,718 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-07 15:41:22,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 492 events. 50/492 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1497 event pairs, 11 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 565. Up to 58 conditions per place. [2024-11-07 15:41:22,723 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 9 selfloop transitions, 3 changer transitions 1/264 dead transitions. [2024-11-07 15:41:22,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 580 flow [2024-11-07 15:41:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-07 15:41:22,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9458333333333333 [2024-11-07 15:41:22,726 INFO L175 Difference]: Start difference. First operand has 261 places, 262 transitions, 549 flow. Second operand 3 states and 908 transitions. [2024-11-07 15:41:22,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 264 transitions, 580 flow [2024-11-07 15:41:22,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:41:22,731 INFO L231 Difference]: Finished difference. Result has 265 places, 263 transitions, 567 flow [2024-11-07 15:41:22,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=265, PETRI_TRANSITIONS=263} [2024-11-07 15:41:22,733 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -27 predicate places. [2024-11-07 15:41:22,733 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 263 transitions, 567 flow [2024-11-07 15:41:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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:41:22,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,735 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] [2024-11-07 15:41:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:41:22,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -566577476, now seen corresponding path program 1 times [2024-11-07 15:41:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485867894] [2024-11-07 15:41:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:22,785 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:41:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485867894] [2024-11-07 15:41:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485867894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894770809] [2024-11-07 15:41:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:22,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:22,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 320 [2024-11-07 15:41:22,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 263 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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:41:22,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:22,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 320 [2024-11-07 15:41:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:22,875 INFO L124 PetriNetUnfolderBase]: 45/676 cut-off events. [2024-11-07 15:41:22,876 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-07 15:41:22,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 676 events. 45/676 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2660 event pairs, 3 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 771. Up to 38 conditions per place. [2024-11-07 15:41:22,882 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-07 15:41:22,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 597 flow [2024-11-07 15:41:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2024-11-07 15:41:22,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9489583333333333 [2024-11-07 15:41:22,885 INFO L175 Difference]: Start difference. First operand has 265 places, 263 transitions, 567 flow. Second operand 3 states and 911 transitions. [2024-11-07 15:41:22,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 597 flow [2024-11-07 15:41:22,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:22,890 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 571 flow [2024-11-07 15:41:22,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2024-11-07 15:41:22,891 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2024-11-07 15:41:22,891 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 571 flow [2024-11-07 15:41:22,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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:41:22,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:22,892 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] [2024-11-07 15:41:22,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:41:22,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash -741705406, now seen corresponding path program 1 times [2024-11-07 15:41:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819079661] [2024-11-07 15:41:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:23,172 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:41:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819079661] [2024-11-07 15:41:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819079661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:41:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007711317] [2024-11-07 15:41:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:23,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:41:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:41:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:41:23,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-07 15:41:23,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 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:41:23,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:23,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-07 15:41:23,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:23,790 INFO L124 PetriNetUnfolderBase]: 64/1040 cut-off events. [2024-11-07 15:41:23,790 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 15:41:23,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1040 events. 64/1040 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4300 event pairs, 8 based on Foata normal form. 2/977 useless extension candidates. Maximal degree in co-relation 1288. Up to 45 conditions per place. [2024-11-07 15:41:23,799 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 50 selfloop transitions, 19 changer transitions 0/298 dead transitions. [2024-11-07 15:41:23,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 298 transitions, 802 flow [2024-11-07 15:41:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:41:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:41:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3381 transitions. [2024-11-07 15:41:23,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.88046875 [2024-11-07 15:41:23,808 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 571 flow. Second operand 12 states and 3381 transitions. [2024-11-07 15:41:23,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 298 transitions, 802 flow [2024-11-07 15:41:23,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 298 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:41:23,815 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 678 flow [2024-11-07 15:41:23,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=678, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2024-11-07 15:41:23,817 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2024-11-07 15:41:23,817 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 678 flow [2024-11-07 15:41:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 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:41:23,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:23,818 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:41:23,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:41:23,819 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:23,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1483188450, now seen corresponding path program 1 times [2024-11-07 15:41:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409906573] [2024-11-07 15:41:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:24,049 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:41:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409906573] [2024-11-07 15:41:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409906573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:24,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:24,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:41:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239699012] [2024-11-07 15:41:24,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:41:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:41:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:41:24,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-07 15:41:24,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:41:24,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:24,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-07 15:41:24,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:24,672 INFO L124 PetriNetUnfolderBase]: 106/1071 cut-off events. [2024-11-07 15:41:24,672 INFO L125 PetriNetUnfolderBase]: For 91/95 co-relation queries the response was YES. [2024-11-07 15:41:24,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1071 events. 106/1071 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5202 event pairs, 25 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1422. Up to 86 conditions per place. [2024-11-07 15:41:24,680 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 33 selfloop transitions, 13 changer transitions 27/306 dead transitions. [2024-11-07 15:41:24,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 306 transitions, 908 flow [2024-11-07 15:41:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:41:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:41:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3382 transitions. [2024-11-07 15:41:24,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8807291666666667 [2024-11-07 15:41:24,689 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 678 flow. Second operand 12 states and 3382 transitions. [2024-11-07 15:41:24,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 306 transitions, 908 flow [2024-11-07 15:41:24,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 306 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:41:24,697 INFO L231 Difference]: Finished difference. Result has 295 places, 272 transitions, 714 flow [2024-11-07 15:41:24,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=714, PETRI_PLACES=295, PETRI_TRANSITIONS=272} [2024-11-07 15:41:24,699 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2024-11-07 15:41:24,699 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 272 transitions, 714 flow [2024-11-07 15:41:24,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:41:24,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:24,702 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, 1, 1] [2024-11-07 15:41:24,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:41:24,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:24,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash -399579792, now seen corresponding path program 1 times [2024-11-07 15:41:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523920940] [2024-11-07 15:41:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:24,968 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:41:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523920940] [2024-11-07 15:41:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523920940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:41:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767944190] [2024-11-07 15:41:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:24,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:41:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:41:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:41:25,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-07 15:41:25,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 272 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:41:25,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:25,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-07 15:41:25,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:25,605 INFO L124 PetriNetUnfolderBase]: 72/1239 cut-off events. [2024-11-07 15:41:25,606 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-11-07 15:41:25,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1239 events. 72/1239 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5481 event pairs, 14 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 1683. Up to 57 conditions per place. [2024-11-07 15:41:25,619 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 44 selfloop transitions, 20 changer transitions 0/297 dead transitions. [2024-11-07 15:41:25,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 928 flow [2024-11-07 15:41:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:41:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:41:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3374 transitions. [2024-11-07 15:41:25,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8786458333333333 [2024-11-07 15:41:25,627 INFO L175 Difference]: Start difference. First operand has 295 places, 272 transitions, 714 flow. Second operand 12 states and 3374 transitions. [2024-11-07 15:41:25,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 928 flow [2024-11-07 15:41:25,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 878 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-07 15:41:25,637 INFO L231 Difference]: Finished difference. Result has 290 places, 281 transitions, 780 flow [2024-11-07 15:41:25,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=290, PETRI_TRANSITIONS=281} [2024-11-07 15:41:25,638 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -2 predicate places. [2024-11-07 15:41:25,638 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 281 transitions, 780 flow [2024-11-07 15:41:25,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:41:25,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:25,639 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:41:25,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:41:25,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:25,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash 875149968, now seen corresponding path program 1 times [2024-11-07 15:41:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091055771] [2024-11-07 15:41:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:25,887 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:41:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091055771] [2024-11-07 15:41:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091055771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:41:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779213278] [2024-11-07 15:41:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:25,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:41:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:41:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:41:26,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-07 15:41:26,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 281 transitions, 780 flow. Second operand has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 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:41:26,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:26,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-07 15:41:26,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:26,603 INFO L124 PetriNetUnfolderBase]: 102/1027 cut-off events. [2024-11-07 15:41:26,603 INFO L125 PetriNetUnfolderBase]: For 192/196 co-relation queries the response was YES. [2024-11-07 15:41:26,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1027 events. 102/1027 cut-off events. For 192/196 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4945 event pairs, 24 based on Foata normal form. 2/955 useless extension candidates. Maximal degree in co-relation 1444. Up to 86 conditions per place. [2024-11-07 15:41:26,614 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 34 selfloop transitions, 13 changer transitions 17/297 dead transitions. [2024-11-07 15:41:26,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 297 transitions, 956 flow [2024-11-07 15:41:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:41:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:41:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3371 transitions. [2024-11-07 15:41:26,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778645833333333 [2024-11-07 15:41:26,622 INFO L175 Difference]: Start difference. First operand has 290 places, 281 transitions, 780 flow. Second operand 12 states and 3371 transitions. [2024-11-07 15:41:26,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 297 transitions, 956 flow [2024-11-07 15:41:26,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 297 transitions, 954 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:41:26,629 INFO L231 Difference]: Finished difference. Result has 302 places, 273 transitions, 753 flow [2024-11-07 15:41:26,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=753, PETRI_PLACES=302, PETRI_TRANSITIONS=273} [2024-11-07 15:41:26,631 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 10 predicate places. [2024-11-07 15:41:26,631 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 273 transitions, 753 flow [2024-11-07 15:41:26,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 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:41:26,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:26,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:41:26,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:41:26,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1529152956, now seen corresponding path program 1 times [2024-11-07 15:41:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697542449] [2024-11-07 15:41:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:41:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697542449] [2024-11-07 15:41:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697542449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:41:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867138646] [2024-11-07 15:41:27,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:41:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:41:27,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:41:27,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-07 15:41:27,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 273 transitions, 753 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:41:27,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:27,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-07 15:41:27,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:27,572 INFO L124 PetriNetUnfolderBase]: 42/812 cut-off events. [2024-11-07 15:41:27,573 INFO L125 PetriNetUnfolderBase]: For 113/115 co-relation queries the response was YES. [2024-11-07 15:41:27,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 812 events. 42/812 cut-off events. For 113/115 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2604 event pairs, 6 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1066. Up to 35 conditions per place. [2024-11-07 15:41:27,581 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 20 selfloop transitions, 6 changer transitions 0/277 dead transitions. [2024-11-07 15:41:27,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 277 transitions, 818 flow [2024-11-07 15:41:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:41:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:41:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2024-11-07 15:41:27,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9135416666666667 [2024-11-07 15:41:27,586 INFO L175 Difference]: Start difference. First operand has 302 places, 273 transitions, 753 flow. Second operand 6 states and 1754 transitions. [2024-11-07 15:41:27,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 277 transitions, 818 flow [2024-11-07 15:41:27,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 277 transitions, 765 flow, removed 5 selfloop flow, removed 16 redundant places. [2024-11-07 15:41:27,592 INFO L231 Difference]: Finished difference. Result has 282 places, 272 transitions, 710 flow [2024-11-07 15:41:27,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=282, PETRI_TRANSITIONS=272} [2024-11-07 15:41:27,593 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -10 predicate places. [2024-11-07 15:41:27,593 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 272 transitions, 710 flow [2024-11-07 15:41:27,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:41:27,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:27,594 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, 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:41:27,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:41:27,595 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:27,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1960845212, now seen corresponding path program 1 times [2024-11-07 15:41:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520565103] [2024-11-07 15:41:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:41:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520565103] [2024-11-07 15:41:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520565103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:28,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:28,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:41:28,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316084494] [2024-11-07 15:41:28,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:28,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:41:28,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:41:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:41:28,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-07 15:41:28,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 272 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:41:28,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:28,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-07 15:41:28,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:28,525 INFO L124 PetriNetUnfolderBase]: 79/1071 cut-off events. [2024-11-07 15:41:28,526 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-07 15:41:28,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1071 events. 79/1071 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4761 event pairs, 12 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1381. Up to 54 conditions per place. [2024-11-07 15:41:28,535 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 19 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2024-11-07 15:41:28,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 275 transitions, 770 flow [2024-11-07 15:41:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:41:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:41:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2024-11-07 15:41:28,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130208333333333 [2024-11-07 15:41:28,541 INFO L175 Difference]: Start difference. First operand has 282 places, 272 transitions, 710 flow. Second operand 6 states and 1753 transitions. [2024-11-07 15:41:28,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 275 transitions, 770 flow [2024-11-07 15:41:28,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 758 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:41:28,547 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 708 flow [2024-11-07 15:41:28,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2024-11-07 15:41:28,548 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2024-11-07 15:41:28,548 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 708 flow [2024-11-07 15:41:28,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:41:28,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:28,549 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, 1, 1, 1, 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:41:28,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:41:28,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:28,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1379084268, now seen corresponding path program 1 times [2024-11-07 15:41:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908541023] [2024-11-07 15:41:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:41:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908541023] [2024-11-07 15:41:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908541023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:41:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954240612] [2024-11-07 15:41:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:28,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:41:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:41:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:41:29,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-07 15:41:29,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 271 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:41:29,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:29,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-07 15:41:29,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:29,420 INFO L124 PetriNetUnfolderBase]: 39/787 cut-off events. [2024-11-07 15:41:29,420 INFO L125 PetriNetUnfolderBase]: For 89/91 co-relation queries the response was YES. [2024-11-07 15:41:29,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 787 events. 39/787 cut-off events. For 89/91 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2468 event pairs, 6 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1022. Up to 35 conditions per place. [2024-11-07 15:41:29,433 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 20 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2024-11-07 15:41:29,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 275 transitions, 773 flow [2024-11-07 15:41:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:41:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:41:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2024-11-07 15:41:29,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9135416666666667 [2024-11-07 15:41:29,441 INFO L175 Difference]: Start difference. First operand has 281 places, 271 transitions, 708 flow. Second operand 6 states and 1754 transitions. [2024-11-07 15:41:29,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 275 transitions, 773 flow [2024-11-07 15:41:29,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 275 transitions, 761 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:41:29,448 INFO L231 Difference]: Finished difference. Result has 280 places, 270 transitions, 706 flow [2024-11-07 15:41:29,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=280, PETRI_TRANSITIONS=270} [2024-11-07 15:41:29,450 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2024-11-07 15:41:29,450 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 270 transitions, 706 flow [2024-11-07 15:41:29,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:41:29,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:29,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:41:29,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2078466068, now seen corresponding path program 1 times [2024-11-07 15:41:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517449399] [2024-11-07 15:41:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:41:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517449399] [2024-11-07 15:41:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517449399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:41:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030130895] [2024-11-07 15:41:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:29,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:41:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:41:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:41:30,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-07 15:41:30,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 270 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:41:30,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:30,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-07 15:41:30,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:30,269 INFO L124 PetriNetUnfolderBase]: 79/971 cut-off events. [2024-11-07 15:41:30,270 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-07 15:41:30,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 971 events. 79/971 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4540 event pairs, 12 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1295. Up to 54 conditions per place. [2024-11-07 15:41:30,284 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 19 selfloop transitions, 6 changer transitions 0/273 dead transitions. [2024-11-07 15:41:30,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 273 transitions, 766 flow [2024-11-07 15:41:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:41:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:41:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2024-11-07 15:41:30,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130208333333333 [2024-11-07 15:41:30,293 INFO L175 Difference]: Start difference. First operand has 280 places, 270 transitions, 706 flow. Second operand 6 states and 1753 transitions. [2024-11-07 15:41:30,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 273 transitions, 766 flow [2024-11-07 15:41:30,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 273 transitions, 754 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:41:30,301 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 704 flow [2024-11-07 15:41:30,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2024-11-07 15:41:30,302 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2024-11-07 15:41:30,302 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 704 flow [2024-11-07 15:41:30,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:41:30,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:30,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:41:30,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:30,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1214540652, now seen corresponding path program 1 times [2024-11-07 15:41:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127437486] [2024-11-07 15:41:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:41:30,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:30,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127437486] [2024-11-07 15:41:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127437486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:30,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:30,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251789531] [2024-11-07 15:41:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:30,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:30,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 320 [2024-11-07 15:41:30,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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:41:30,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:30,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 320 [2024-11-07 15:41:30,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:30,502 INFO L124 PetriNetUnfolderBase]: 46/820 cut-off events. [2024-11-07 15:41:30,503 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-07 15:41:30,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 820 events. 46/820 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2622 event pairs, 17 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1079. Up to 64 conditions per place. [2024-11-07 15:41:30,511 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 11 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-07 15:41:30,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 269 transitions, 731 flow [2024-11-07 15:41:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-07 15:41:30,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364583333333333 [2024-11-07 15:41:30,514 INFO L175 Difference]: Start difference. First operand has 279 places, 269 transitions, 704 flow. Second operand 3 states and 899 transitions. [2024-11-07 15:41:30,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 269 transitions, 731 flow [2024-11-07 15:41:30,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 269 transitions, 719 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:41:30,519 INFO L231 Difference]: Finished difference. Result has 275 places, 268 transitions, 694 flow [2024-11-07 15:41:30,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=275, PETRI_TRANSITIONS=268} [2024-11-07 15:41:30,520 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -17 predicate places. [2024-11-07 15:41:30,520 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 268 transitions, 694 flow [2024-11-07 15:41:30,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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:41:30,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:41:30,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:41:30,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-07 15:41:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:41:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 585483892, now seen corresponding path program 1 times [2024-11-07 15:41:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:41:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516504248] [2024-11-07 15:41:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:41:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:41:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:41:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:41:30,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:41:30,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516504248] [2024-11-07 15:41:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516504248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:41:30,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:41:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:41:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465134227] [2024-11-07 15:41:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:41:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:41:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:41:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:41:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:41:30,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 320 [2024-11-07 15:41:30,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 268 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:41:30,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:41:30,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 320 [2024-11-07 15:41:30,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:41:30,728 INFO L124 PetriNetUnfolderBase]: 89/968 cut-off events. [2024-11-07 15:41:30,729 INFO L125 PetriNetUnfolderBase]: For 138/141 co-relation queries the response was YES. [2024-11-07 15:41:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 968 events. 89/968 cut-off events. For 138/141 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4260 event pairs, 33 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1261. Up to 102 conditions per place. [2024-11-07 15:41:30,736 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 0 selfloop transitions, 0 changer transitions 268/268 dead transitions. [2024-11-07 15:41:30,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 268 transitions, 721 flow [2024-11-07 15:41:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:41:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:41:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-07 15:41:30,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364583333333333 [2024-11-07 15:41:30,738 INFO L175 Difference]: Start difference. First operand has 275 places, 268 transitions, 694 flow. Second operand 3 states and 899 transitions. [2024-11-07 15:41:30,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 268 transitions, 721 flow [2024-11-07 15:41:30,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 268 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:41:30,742 INFO L231 Difference]: Finished difference. Result has 274 places, 0 transitions, 0 flow [2024-11-07 15:41:30,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=274, PETRI_TRANSITIONS=0} [2024-11-07 15:41:30,743 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -18 predicate places. [2024-11-07 15:41:30,744 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 0 transitions, 0 flow [2024-11-07 15:41:30,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:41:30,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2024-11-07 15:41:30,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2024-11-07 15:41:30,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2024-11-07 15:41:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2024-11-07 15:41:30,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2024-11-07 15:41:30,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2024-11-07 15:41:30,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2024-11-07 15:41:30,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2024-11-07 15:41:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:41:30,754 INFO L407 BasicCegarLoop]: Path program histogram: [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:41:30,761 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:41:30,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:41:30,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:41:30 BasicIcfg [2024-11-07 15:41:30,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:41:30,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:41:30,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:41:30,770 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:41:30,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:41:18" (3/4) ... [2024-11-07 15:41:30,772 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:41:30,774 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:41:30,775 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:41:30,779 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-07 15:41:30,779 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 15:41:30,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:41:30,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:41:30,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:41:30,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:41:30,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:41:30,868 INFO L158 Benchmark]: Toolchain (without parser) took 12954.42ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 117.4MB in the beginning and 146.1MB in the end (delta: -28.8MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2024-11-07 15:41:30,868 INFO L158 Benchmark]: CDTParser took 0.27ms. 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:41:30,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.00ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 105.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:41:30,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 103.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:41:30,869 INFO L158 Benchmark]: Boogie Preprocessor took 43.07ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:41:30,869 INFO L158 Benchmark]: RCFGBuilder took 694.83ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 75.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 15:41:30,869 INFO L158 Benchmark]: TraceAbstraction took 11803.63ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 75.4MB in the beginning and 150.7MB in the end (delta: -75.3MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2024-11-07 15:41:30,869 INFO L158 Benchmark]: Witness Printer took 98.45ms. Allocated memory is still 335.5MB. Free memory was 150.7MB in the beginning and 146.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:41:30,870 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.00ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 105.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 103.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.07ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 694.83ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 75.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11803.63ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 75.4MB in the beginning and 150.7MB in the end (delta: -75.3MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. * Witness Printer took 98.45ms. Allocated memory is still 335.5MB. Free memory was 150.7MB in the beginning and 146.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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 5 procedures, 434 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2619 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1733 mSDsluCounter, 1830 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4105 IncrementalHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 342 mSolverCounterUnsat, 175 mSDtfsCounter, 4105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=16, InterpolantAutomatonStates: 120, 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.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 14/14 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:41:30,903 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