./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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', 'd79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:45:01,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:45:01,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:45:01,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:45:01,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:45:01,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:45:01,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:45:01,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:45:01,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:45:01,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:45:01,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:45:01,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:45:01,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:45:01,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:45:01,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:45:01,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:45:01,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:45:01,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:45:01,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:45:01,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:45:01,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:45:01,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:45:01,230 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2024-11-07 15:45:01,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:45:01,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:45:01,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:45:01,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:45:01,484 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:45:01,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2024-11-07 15:45:02,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:45:02,811 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:45:02,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2024-11-07 15:45:02,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2da44aca3/d7e7761c06d24982b7512096fd98842a/FLAG375d7a8bc [2024-11-07 15:45:03,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2da44aca3/d7e7761c06d24982b7512096fd98842a [2024-11-07 15:45:03,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:45:03,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:45:03,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:45:03,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:45:03,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:45:03,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3deb5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03, skipping insertion in model container [2024-11-07 15:45:03,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:45:03,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:45:03,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:45:03,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:45:03,348 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:45:03,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03 WrapperNode [2024-11-07 15:45:03,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:45:03,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:45:03,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:45:03,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:45:03,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,392 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 304 [2024-11-07 15:45:03,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:45:03,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:45:03,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:45:03,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:45:03,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:45:03,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:45:03,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:45:03,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:45:03,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (1/1) ... [2024-11-07 15:45:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:45:03,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:45:03,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:45:03,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:45:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:45:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:45:03,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:45:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:45:03,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 15:45:03,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:45:03,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:45:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:45:03,498 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:45:03,590 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:45:03,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:45:03,987 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:45:03,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:45:04,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:45:04,211 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 15:45:04,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:04 BoogieIcfgContainer [2024-11-07 15:45:04,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:45:04,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:45:04,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:45:04,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:45:04,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:45:03" (1/3) ... [2024-11-07 15:45:04,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fec27ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:45:04, skipping insertion in model container [2024-11-07 15:45:04,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:03" (2/3) ... [2024-11-07 15:45:04,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fec27ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:45:04, skipping insertion in model container [2024-11-07 15:45:04,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:04" (3/3) ... [2024-11-07 15:45:04,219 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2024-11-07 15:45:04,229 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:45:04,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-07 15:45:04,230 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:45:04,290 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:45:04,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 256 transitions, 533 flow [2024-11-07 15:45:04,394 INFO L124 PetriNetUnfolderBase]: 9/253 cut-off events. [2024-11-07 15:45:04,397 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:45:04,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 9/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 352 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 189. Up to 2 conditions per place. [2024-11-07 15:45:04,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 256 transitions, 533 flow [2024-11-07 15:45:04,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 236 transitions, 490 flow [2024-11-07 15:45:04,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:45:04,427 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;@7cc2b59e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:45:04,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-07 15:45:04,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:45:04,432 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-07 15:45:04,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:45:04,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:04,433 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] [2024-11-07 15:45:04,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1654981696, now seen corresponding path program 1 times [2024-11-07 15:45:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58629614] [2024-11-07 15:45:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58629614] [2024-11-07 15:45:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58629614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484972456] [2024-11-07 15:45:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:04,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:04,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 256 [2024-11-07 15:45:04,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 236 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:04,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:04,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 256 [2024-11-07 15:45:04,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:04,739 INFO L124 PetriNetUnfolderBase]: 96/510 cut-off events. [2024-11-07 15:45:04,739 INFO L125 PetriNetUnfolderBase]: For 54/74 co-relation queries the response was YES. [2024-11-07 15:45:04,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 510 events. 96/510 cut-off events. For 54/74 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2237 event pairs, 71 based on Foata normal form. 3/456 useless extension candidates. Maximal degree in co-relation 548. Up to 160 conditions per place. [2024-11-07 15:45:04,746 INFO L140 encePairwiseOnDemand]: 225/256 looper letters, 16 selfloop transitions, 2 changer transitions 2/207 dead transitions. [2024-11-07 15:45:04,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 207 transitions, 468 flow [2024-11-07 15:45:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2024-11-07 15:45:04,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8658854166666666 [2024-11-07 15:45:04,761 INFO L175 Difference]: Start difference. First operand has 238 places, 236 transitions, 490 flow. Second operand 3 states and 665 transitions. [2024-11-07 15:45:04,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 207 transitions, 468 flow [2024-11-07 15:45:04,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 207 transitions, 456 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 15:45:04,771 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 420 flow [2024-11-07 15:45:04,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2024-11-07 15:45:04,775 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2024-11-07 15:45:04,775 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 420 flow [2024-11-07 15:45:04,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:04,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:04,776 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:45:04,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:45:04,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1225850048, now seen corresponding path program 1 times [2024-11-07 15:45:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411135225] [2024-11-07 15:45:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:04,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411135225] [2024-11-07 15:45:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411135225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:04,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773221577] [2024-11-07 15:45:04,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:04,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:04,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-11-07 15:45:04,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:04,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:04,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-11-07 15:45:04,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:04,914 INFO L124 PetriNetUnfolderBase]: 43/728 cut-off events. [2024-11-07 15:45:04,914 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-07 15:45:04,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 728 events. 43/728 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3867 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 797. Up to 81 conditions per place. [2024-11-07 15:45:04,918 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 14 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2024-11-07 15:45:04,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 204 transitions, 450 flow [2024-11-07 15:45:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-11-07 15:45:04,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346354166666666 [2024-11-07 15:45:04,920 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 420 flow. Second operand 3 states and 641 transitions. [2024-11-07 15:45:04,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 204 transitions, 450 flow [2024-11-07 15:45:04,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:04,922 INFO L231 Difference]: Finished difference. Result has 207 places, 204 transitions, 418 flow [2024-11-07 15:45:04,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=207, PETRI_TRANSITIONS=204} [2024-11-07 15:45:04,923 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2024-11-07 15:45:04,923 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 204 transitions, 418 flow [2024-11-07 15:45:04,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:04,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:04,924 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] [2024-11-07 15:45:04,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:45:04,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:04,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1016754418, now seen corresponding path program 1 times [2024-11-07 15:45:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:04,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058993325] [2024-11-07 15:45:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:04,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:04,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058993325] [2024-11-07 15:45:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058993325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:04,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184828639] [2024-11-07 15:45:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:04,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 256 [2024-11-07 15:45:04,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 204 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:04,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:04,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 256 [2024-11-07 15:45:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:05,070 INFO L124 PetriNetUnfolderBase]: 43/727 cut-off events. [2024-11-07 15:45:05,070 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-07 15:45:05,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 727 events. 43/727 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3868 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 790. Up to 82 conditions per place. [2024-11-07 15:45:05,075 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 15 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-11-07 15:45:05,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 203 transitions, 450 flow [2024-11-07 15:45:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2024-11-07 15:45:05,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.83203125 [2024-11-07 15:45:05,077 INFO L175 Difference]: Start difference. First operand has 207 places, 204 transitions, 418 flow. Second operand 3 states and 639 transitions. [2024-11-07 15:45:05,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 203 transitions, 450 flow [2024-11-07 15:45:05,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:05,082 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 416 flow [2024-11-07 15:45:05,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2024-11-07 15:45:05,084 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-11-07 15:45:05,084 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 416 flow [2024-11-07 15:45:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:05,084 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] [2024-11-07 15:45:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:45:05,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 146855060, now seen corresponding path program 1 times [2024-11-07 15:45:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635262456] [2024-11-07 15:45:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635262456] [2024-11-07 15:45:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635262456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788445228] [2024-11-07 15:45:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:05,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 256 [2024-11-07 15:45:05,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:05,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 256 [2024-11-07 15:45:05,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:05,261 INFO L124 PetriNetUnfolderBase]: 79/764 cut-off events. [2024-11-07 15:45:05,261 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-07 15:45:05,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 764 events. 79/764 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4270 event pairs, 74 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 881. Up to 144 conditions per place. [2024-11-07 15:45:05,266 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 17 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-07 15:45:05,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 452 flow [2024-11-07 15:45:05,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2024-11-07 15:45:05,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8268229166666666 [2024-11-07 15:45:05,269 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 416 flow. Second operand 3 states and 635 transitions. [2024-11-07 15:45:05,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 452 flow [2024-11-07 15:45:05,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:05,273 INFO L231 Difference]: Finished difference. Result has 205 places, 202 transitions, 414 flow [2024-11-07 15:45:05,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=205, PETRI_TRANSITIONS=202} [2024-11-07 15:45:05,274 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2024-11-07 15:45:05,274 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 202 transitions, 414 flow [2024-11-07 15:45:05,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:05,275 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] [2024-11-07 15:45:05,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:45:05,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:05,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1571545145, now seen corresponding path program 1 times [2024-11-07 15:45:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:05,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559836370] [2024-11-07 15:45:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559836370] [2024-11-07 15:45:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559836370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509828465] [2024-11-07 15:45:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:05,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:05,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 256 [2024-11-07 15:45:05,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:05,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 256 [2024-11-07 15:45:05,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:05,404 INFO L124 PetriNetUnfolderBase]: 115/777 cut-off events. [2024-11-07 15:45:05,404 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-07 15:45:05,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 777 events. 115/777 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4380 event pairs, 110 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 945. Up to 203 conditions per place. [2024-11-07 15:45:05,409 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 17 selfloop transitions, 1 changer transitions 0/199 dead transitions. [2024-11-07 15:45:05,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 199 transitions, 444 flow [2024-11-07 15:45:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2024-11-07 15:45:05,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.828125 [2024-11-07 15:45:05,411 INFO L175 Difference]: Start difference. First operand has 205 places, 202 transitions, 414 flow. Second operand 3 states and 636 transitions. [2024-11-07 15:45:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 199 transitions, 444 flow [2024-11-07 15:45:05,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:05,413 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 406 flow [2024-11-07 15:45:05,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-11-07 15:45:05,414 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2024-11-07 15:45:05,415 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 406 flow [2024-11-07 15:45:05,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:05,415 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] [2024-11-07 15:45:05,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:45:05,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:05,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -377031059, now seen corresponding path program 1 times [2024-11-07 15:45:05,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:05,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926666525] [2024-11-07 15:45:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926666525] [2024-11-07 15:45:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926666525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:05,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:05,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:05,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211652736] [2024-11-07 15:45:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:05,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:05,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:05,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-11-07 15:45:05,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:05,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-11-07 15:45:05,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:05,546 INFO L124 PetriNetUnfolderBase]: 43/700 cut-off events. [2024-11-07 15:45:05,546 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-07 15:45:05,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 700 events. 43/700 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3645 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 745. Up to 81 conditions per place. [2024-11-07 15:45:05,549 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 14 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-11-07 15:45:05,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 436 flow [2024-11-07 15:45:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-11-07 15:45:05,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346354166666666 [2024-11-07 15:45:05,551 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 406 flow. Second operand 3 states and 641 transitions. [2024-11-07 15:45:05,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 436 flow [2024-11-07 15:45:05,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:05,553 INFO L231 Difference]: Finished difference. Result has 202 places, 198 transitions, 407 flow [2024-11-07 15:45:05,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=202, PETRI_TRANSITIONS=198} [2024-11-07 15:45:05,554 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2024-11-07 15:45:05,555 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 198 transitions, 407 flow [2024-11-07 15:45:05,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:05,556 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] [2024-11-07 15:45:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:45:05,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:05,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash -792030389, now seen corresponding path program 1 times [2024-11-07 15:45:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437445828] [2024-11-07 15:45:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437445828] [2024-11-07 15:45:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437445828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351250117] [2024-11-07 15:45:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:05,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:05,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-11-07 15:45:05,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:05,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-11-07 15:45:05,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:05,674 INFO L124 PetriNetUnfolderBase]: 43/699 cut-off events. [2024-11-07 15:45:05,674 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-07 15:45:05,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 699 events. 43/699 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3644 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 744. Up to 79 conditions per place. [2024-11-07 15:45:05,676 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 13 selfloop transitions, 1 changer transitions 0/197 dead transitions. [2024-11-07 15:45:05,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 197 transitions, 433 flow [2024-11-07 15:45:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-11-07 15:45:05,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-11-07 15:45:05,678 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 407 flow. Second operand 3 states and 648 transitions. [2024-11-07 15:45:05,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 197 transitions, 433 flow [2024-11-07 15:45:05,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 197 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:05,680 INFO L231 Difference]: Finished difference. Result has 201 places, 197 transitions, 403 flow [2024-11-07 15:45:05,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=201, PETRI_TRANSITIONS=197} [2024-11-07 15:45:05,681 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -37 predicate places. [2024-11-07 15:45:05,681 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 197 transitions, 403 flow [2024-11-07 15:45:05,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:05,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:05,681 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] [2024-11-07 15:45:05,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:45:05,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:05,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 240995789, now seen corresponding path program 1 times [2024-11-07 15:45:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:05,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642279121] [2024-11-07 15:45:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642279121] [2024-11-07 15:45:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642279121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846416417] [2024-11-07 15:45:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:06,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:06,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 256 [2024-11-07 15:45:06,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 197 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 256 [2024-11-07 15:45:06,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,313 INFO L124 PetriNetUnfolderBase]: 187/850 cut-off events. [2024-11-07 15:45:06,313 INFO L125 PetriNetUnfolderBase]: For 40/41 co-relation queries the response was YES. [2024-11-07 15:45:06,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 850 events. 187/850 cut-off events. For 40/41 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5070 event pairs, 182 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1153. Up to 334 conditions per place. [2024-11-07 15:45:06,317 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 27 selfloop transitions, 5 changer transitions 0/196 dead transitions. [2024-11-07 15:45:06,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 465 flow [2024-11-07 15:45:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1191 transitions. [2024-11-07 15:45:06,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2024-11-07 15:45:06,321 INFO L175 Difference]: Start difference. First operand has 201 places, 197 transitions, 403 flow. Second operand 6 states and 1191 transitions. [2024-11-07 15:45:06,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 465 flow [2024-11-07 15:45:06,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:06,324 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 410 flow [2024-11-07 15:45:06,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2024-11-07 15:45:06,325 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -34 predicate places. [2024-11-07 15:45:06,325 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 410 flow [2024-11-07 15:45:06,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,327 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] [2024-11-07 15:45:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:45:06,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:06,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1483377538, now seen corresponding path program 1 times [2024-11-07 15:45:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732681718] [2024-11-07 15:45:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732681718] [2024-11-07 15:45:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732681718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336053956] [2024-11-07 15:45:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:06,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 256 [2024-11-07 15:45:06,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 256 [2024-11-07 15:45:06,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,457 INFO L124 PetriNetUnfolderBase]: 79/735 cut-off events. [2024-11-07 15:45:06,457 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-07 15:45:06,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 735 events. 79/735 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3965 event pairs, 74 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 884. Up to 143 conditions per place. [2024-11-07 15:45:06,461 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 16 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-11-07 15:45:06,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 195 transitions, 444 flow [2024-11-07 15:45:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2024-11-07 15:45:06,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8294270833333334 [2024-11-07 15:45:06,463 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 410 flow. Second operand 3 states and 637 transitions. [2024-11-07 15:45:06,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 195 transitions, 444 flow [2024-11-07 15:45:06,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 195 transitions, 434 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:45:06,466 INFO L231 Difference]: Finished difference. Result has 200 places, 195 transitions, 402 flow [2024-11-07 15:45:06,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=200, PETRI_TRANSITIONS=195} [2024-11-07 15:45:06,467 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -38 predicate places. [2024-11-07 15:45:06,467 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 195 transitions, 402 flow [2024-11-07 15:45:06,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:06,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:45:06,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:06,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1303173861, now seen corresponding path program 1 times [2024-11-07 15:45:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497466612] [2024-11-07 15:45:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497466612] [2024-11-07 15:45:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497466612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788425397] [2024-11-07 15:45:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:06,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-11-07 15:45:06,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 195 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-11-07 15:45:06,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,567 INFO L124 PetriNetUnfolderBase]: 148/659 cut-off events. [2024-11-07 15:45:06,568 INFO L125 PetriNetUnfolderBase]: For 13/38 co-relation queries the response was YES. [2024-11-07 15:45:06,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 659 events. 148/659 cut-off events. For 13/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3298 event pairs, 97 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 883. Up to 235 conditions per place. [2024-11-07 15:45:06,571 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-11-07 15:45:06,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 452 flow [2024-11-07 15:45:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2024-11-07 15:45:06,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8424479166666666 [2024-11-07 15:45:06,592 INFO L175 Difference]: Start difference. First operand has 200 places, 195 transitions, 402 flow. Second operand 3 states and 647 transitions. [2024-11-07 15:45:06,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 452 flow [2024-11-07 15:45:06,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:06,597 INFO L231 Difference]: Finished difference. Result has 199 places, 195 transitions, 408 flow [2024-11-07 15:45:06,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=199, PETRI_TRANSITIONS=195} [2024-11-07 15:45:06,598 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -39 predicate places. [2024-11-07 15:45:06,599 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 195 transitions, 408 flow [2024-11-07 15:45:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,599 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:06,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:45:06,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1717335503, now seen corresponding path program 1 times [2024-11-07 15:45:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040345544] [2024-11-07 15:45:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040345544] [2024-11-07 15:45:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040345544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743184458] [2024-11-07 15:45:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:06,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-11-07 15:45:06,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 195 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-11-07 15:45:06,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,755 INFO L124 PetriNetUnfolderBase]: 129/874 cut-off events. [2024-11-07 15:45:06,755 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-07 15:45:06,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 874 events. 129/874 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5198 event pairs, 38 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1080. Up to 198 conditions per place. [2024-11-07 15:45:06,760 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 21 selfloop transitions, 3 changer transitions 0/201 dead transitions. [2024-11-07 15:45:06,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 201 transitions, 470 flow [2024-11-07 15:45:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-11-07 15:45:06,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8463541666666666 [2024-11-07 15:45:06,761 INFO L175 Difference]: Start difference. First operand has 199 places, 195 transitions, 408 flow. Second operand 3 states and 650 transitions. [2024-11-07 15:45:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 201 transitions, 470 flow [2024-11-07 15:45:06,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 201 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:45:06,767 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 425 flow [2024-11-07 15:45:06,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2024-11-07 15:45:06,767 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -38 predicate places. [2024-11-07 15:45:06,769 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 425 flow [2024-11-07 15:45:06,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,769 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] [2024-11-07 15:45:06,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:45:06,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:06,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash 248836725, now seen corresponding path program 1 times [2024-11-07 15:45:06,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357325421] [2024-11-07 15:45:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:06,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:06,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357325421] [2024-11-07 15:45:06,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357325421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:06,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:06,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:45:06,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167706557] [2024-11-07 15:45:06,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:06,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:06,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:06,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:06,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-11-07 15:45:06,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:06,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-11-07 15:45:06,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:06,942 INFO L124 PetriNetUnfolderBase]: 42/608 cut-off events. [2024-11-07 15:45:06,942 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2024-11-07 15:45:06,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 608 events. 42/608 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2719 event pairs, 16 based on Foata normal form. 7/574 useless extension candidates. Maximal degree in co-relation 705. Up to 60 conditions per place. [2024-11-07 15:45:06,945 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 18 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2024-11-07 15:45:06,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 199 transitions, 472 flow [2024-11-07 15:45:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-11-07 15:45:06,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528645833333334 [2024-11-07 15:45:06,946 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 425 flow. Second operand 3 states and 655 transitions. [2024-11-07 15:45:06,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 199 transitions, 472 flow [2024-11-07 15:45:06,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:45:06,950 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 431 flow [2024-11-07 15:45:06,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2024-11-07 15:45:06,951 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2024-11-07 15:45:06,951 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 431 flow [2024-11-07 15:45:06,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:06,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:06,952 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] [2024-11-07 15:45:06,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:45:06,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:06,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1443948509, now seen corresponding path program 1 times [2024-11-07 15:45:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476866101] [2024-11-07 15:45:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476866101] [2024-11-07 15:45:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476866101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:07,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:07,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:45:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983472442] [2024-11-07 15:45:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:07,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:45:07,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:45:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:45:07,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-11-07 15:45:07,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:07,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:07,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-11-07 15:45:07,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:07,164 INFO L124 PetriNetUnfolderBase]: 31/366 cut-off events. [2024-11-07 15:45:07,164 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2024-11-07 15:45:07,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 366 events. 31/366 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 929 event pairs, 8 based on Foata normal form. 9/355 useless extension candidates. Maximal degree in co-relation 458. Up to 24 conditions per place. [2024-11-07 15:45:07,166 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 18 selfloop transitions, 5 changer transitions 0/201 dead transitions. [2024-11-07 15:45:07,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 493 flow [2024-11-07 15:45:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:45:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 15:45:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2024-11-07 15:45:07,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84765625 [2024-11-07 15:45:07,168 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 431 flow. Second operand 4 states and 868 transitions. [2024-11-07 15:45:07,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 493 flow [2024-11-07 15:45:07,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 486 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:07,172 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 440 flow [2024-11-07 15:45:07,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2024-11-07 15:45:07,173 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2024-11-07 15:45:07,173 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 440 flow [2024-11-07 15:45:07,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:07,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:07,173 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] [2024-11-07 15:45:07,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:45:07,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -223500219, now seen corresponding path program 1 times [2024-11-07 15:45:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872546672] [2024-11-07 15:45:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:07,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872546672] [2024-11-07 15:45:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872546672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:07,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603762590] [2024-11-07 15:45:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:07,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:07,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:07,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 256 [2024-11-07 15:45:07,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:07,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:07,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 256 [2024-11-07 15:45:07,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:07,808 INFO L124 PetriNetUnfolderBase]: 42/384 cut-off events. [2024-11-07 15:45:07,808 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-07 15:45:07,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 384 events. 42/384 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1131 event pairs, 22 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 517. Up to 65 conditions per place. [2024-11-07 15:45:07,810 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 30 selfloop transitions, 4 changer transitions 0/202 dead transitions. [2024-11-07 15:45:07,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 202 transitions, 530 flow [2024-11-07 15:45:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2024-11-07 15:45:07,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.806640625 [2024-11-07 15:45:07,813 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 440 flow. Second operand 6 states and 1239 transitions. [2024-11-07 15:45:07,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 202 transitions, 530 flow [2024-11-07 15:45:07,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 202 transitions, 518 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-07 15:45:07,816 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 434 flow [2024-11-07 15:45:07,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2024-11-07 15:45:07,817 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-11-07 15:45:07,817 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 434 flow [2024-11-07 15:45:07,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:07,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:07,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:45:07,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 221640397, now seen corresponding path program 1 times [2024-11-07 15:45:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372443383] [2024-11-07 15:45:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372443383] [2024-11-07 15:45:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372443383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017479247] [2024-11-07 15:45:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:08,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:08,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:08,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 256 [2024-11-07 15:45:08,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 194 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:08,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:08,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 256 [2024-11-07 15:45:08,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:08,403 INFO L124 PetriNetUnfolderBase]: 42/371 cut-off events. [2024-11-07 15:45:08,404 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-07 15:45:08,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 371 events. 42/371 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 22 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 490. Up to 65 conditions per place. [2024-11-07 15:45:08,405 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 30 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2024-11-07 15:45:08,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 201 transitions, 524 flow [2024-11-07 15:45:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2024-11-07 15:45:08,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.806640625 [2024-11-07 15:45:08,408 INFO L175 Difference]: Start difference. First operand has 206 places, 194 transitions, 434 flow. Second operand 6 states and 1239 transitions. [2024-11-07 15:45:08,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 201 transitions, 524 flow [2024-11-07 15:45:08,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 201 transitions, 517 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 15:45:08,412 INFO L231 Difference]: Finished difference. Result has 206 places, 193 transitions, 433 flow [2024-11-07 15:45:08,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=193} [2024-11-07 15:45:08,412 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-11-07 15:45:08,412 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 193 transitions, 433 flow [2024-11-07 15:45:08,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:08,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:08,413 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] [2024-11-07 15:45:08,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:45:08,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1167097120, now seen corresponding path program 1 times [2024-11-07 15:45:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054832413] [2024-11-07 15:45:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:08,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054832413] [2024-11-07 15:45:08,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054832413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:08,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:08,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306879303] [2024-11-07 15:45:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:08,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:08,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:08,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 256 [2024-11-07 15:45:08,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 193 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:08,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:08,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 256 [2024-11-07 15:45:08,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:08,515 INFO L124 PetriNetUnfolderBase]: 40/360 cut-off events. [2024-11-07 15:45:08,515 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-07 15:45:08,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 360 events. 40/360 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1029 event pairs, 26 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 472. Up to 69 conditions per place. [2024-11-07 15:45:08,517 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 18 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-11-07 15:45:08,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 477 flow [2024-11-07 15:45:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2024-11-07 15:45:08,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2024-11-07 15:45:08,519 INFO L175 Difference]: Start difference. First operand has 206 places, 193 transitions, 433 flow. Second operand 3 states and 646 transitions. [2024-11-07 15:45:08,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 477 flow [2024-11-07 15:45:08,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 194 transitions, 470 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 15:45:08,522 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 428 flow [2024-11-07 15:45:08,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=203, PETRI_TRANSITIONS=192} [2024-11-07 15:45:08,523 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2024-11-07 15:45:08,523 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 428 flow [2024-11-07 15:45:08,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:08,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:08,524 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] [2024-11-07 15:45:08,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:45:08,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-11-07 15:45:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1307809786, now seen corresponding path program 1 times [2024-11-07 15:45:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:08,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320859022] [2024-11-07 15:45:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:08,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320859022] [2024-11-07 15:45:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320859022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:08,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13687524] [2024-11-07 15:45:08,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:08,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:08,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-11-07 15:45:08,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:08,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:08,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-11-07 15:45:08,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:08,648 INFO L124 PetriNetUnfolderBase]: 34/346 cut-off events. [2024-11-07 15:45:08,648 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-07 15:45:08,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 346 events. 34/346 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 957 event pairs, 24 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 461. Up to 63 conditions per place. [2024-11-07 15:45:08,649 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 0 selfloop transitions, 0 changer transitions 191/191 dead transitions. [2024-11-07 15:45:08,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 191 transitions, 456 flow [2024-11-07 15:45:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2024-11-07 15:45:08,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8424479166666666 [2024-11-07 15:45:08,651 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 428 flow. Second operand 3 states and 647 transitions. [2024-11-07 15:45:08,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 191 transitions, 456 flow [2024-11-07 15:45:08,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:08,652 INFO L231 Difference]: Finished difference. Result has 202 places, 0 transitions, 0 flow [2024-11-07 15:45:08,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=202, PETRI_TRANSITIONS=0} [2024-11-07 15:45:08,653 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2024-11-07 15:45:08,653 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 0 transitions, 0 flow [2024-11-07 15:45:08,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (76 of 77 remaining) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (75 of 77 remaining) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (74 of 77 remaining) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (73 of 77 remaining) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (72 of 77 remaining) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (71 of 77 remaining) [2024-11-07 15:45:08,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (70 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (69 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (68 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (66 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (57 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (56 of 77 remaining) [2024-11-07 15:45:08,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (55 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (54 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (53 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (52 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (49 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (47 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (46 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (45 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 77 remaining) [2024-11-07 15:45:08,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 77 remaining) [2024-11-07 15:45:08,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 77 remaining) [2024-11-07 15:45:08,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (16 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 77 remaining) [2024-11-07 15:45:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 77 remaining) [2024-11-07 15:45:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 77 remaining) [2024-11-07 15:45:08,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:45:08,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:08,668 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:45:08,668 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:45:08,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:45:08 BasicIcfg [2024-11-07 15:45:08,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:45:08,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:45:08,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:45:08,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:45:08,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:04" (3/4) ... [2024-11-07 15:45:08,673 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:45:08,675 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:45:08,675 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:45:08,675 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-07 15:45:08,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-07 15:45:08,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 15:45:08,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:45:08,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:45:08,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:45:08,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:45:08,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:45:08,725 INFO L158 Benchmark]: Toolchain (without parser) took 5566.22ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 76.6MB in the beginning and 198.9MB in the end (delta: -122.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-07 15:45:08,725 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:45:08,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.09ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:45:08,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:45:08,725 INFO L158 Benchmark]: Boogie Preprocessor took 45.75ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 59.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:45:08,725 INFO L158 Benchmark]: RCFGBuilder took 769.24ms. Allocated memory is still 100.7MB. Free memory was 59.3MB in the beginning and 70.8MB in the end (delta: -11.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-11-07 15:45:08,726 INFO L158 Benchmark]: TraceAbstraction took 4457.44ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 70.2MB in the beginning and 204.4MB in the end (delta: -134.2MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2024-11-07 15:45:08,726 INFO L158 Benchmark]: Witness Printer took 52.48ms. Allocated memory is still 251.7MB. Free memory was 204.4MB in the beginning and 198.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:45:08,727 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.14ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.09ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.75ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 59.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 769.24ms. Allocated memory is still 100.7MB. Free memory was 59.3MB in the beginning and 70.8MB in the end (delta: -11.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4457.44ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 70.2MB in the beginning and 204.4MB in the end (delta: -134.2MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. * Witness Printer took 52.48ms. Allocated memory is still 251.7MB. Free memory was 204.4MB in the beginning and 198.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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 - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: 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: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 345 locations, 77 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: 4.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 57 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1507 NumberOfCodeBlocks, 1507 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 2105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:45:08,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE