./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB --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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:49:32,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:49:32,970 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-27 19:49:32,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:49:32,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:49:33,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:49:33,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:49:33,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:49:33,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:49:33,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:49:33,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:49:33,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:49:33,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:49:33,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:49:33,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:49:33,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:49:33,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:49:33,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:49:33,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:49:33,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:49:33,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:49:33,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:49:33,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:33,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:33,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:49:33,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:49:33,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:49:33,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:49:33,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:49:33,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:49:33,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:49:33,029 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2024-11-27 19:49:33,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:49:33,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:49:33,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:49:33,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:49:33,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:49:33,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-11-27 19:49:36,499 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/data/84dbe6e7c/dc8bb67eb184427a92b6288b0a4fbfee/FLAGf09844b9f [2024-11-27 19:49:36,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:49:36,753 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-11-27 19:49:36,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/data/84dbe6e7c/dc8bb67eb184427a92b6288b0a4fbfee/FLAGf09844b9f [2024-11-27 19:49:36,786 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/data/84dbe6e7c/dc8bb67eb184427a92b6288b0a4fbfee [2024-11-27 19:49:36,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:49:36,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:49:36,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:49:36,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:49:36,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:49:36,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:49:36" (1/1) ... [2024-11-27 19:49:36,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa6ed07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:36, skipping insertion in model container [2024-11-27 19:49:36,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:49:36" (1/1) ... [2024-11-27 19:49:36,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:49:37,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:49:37,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:49:37,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:49:37,089 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:49:37,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37 WrapperNode [2024-11-27 19:49:37,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:49:37,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:49:37,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:49:37,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:49:37,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,127 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2024-11-27 19:49:37,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:49:37,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:49:37,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:49:37,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:49:37,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:49:37,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:49:37,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:49:37,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:49:37,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (1/1) ... [2024-11-27 19:49:37,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:49:37,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:49:37,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:49:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:49:37,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-27 19:49:37,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-27 19:49:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-27 19:49:37,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-27 19:49:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-27 19:49:37,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-27 19:49:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-27 19:49:37,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-27 19:49:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 19:49:37,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-27 19:49:37,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-27 19:49:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-27 19:49:37,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-27 19:49:37,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:49:37,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:49:37,258 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 19:49:37,387 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:49:37,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:49:38,088 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 19:49:38,088 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:49:38,121 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:49:38,121 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-27 19:49:38,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:38 BoogieIcfgContainer [2024-11-27 19:49:38,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:49:38,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:49:38,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:49:38,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:49:38,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:49:36" (1/3) ... [2024-11-27 19:49:38,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a2a7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:49:38, skipping insertion in model container [2024-11-27 19:49:38,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:37" (2/3) ... [2024-11-27 19:49:38,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a2a7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:49:38, skipping insertion in model container [2024-11-27 19:49:38,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:38" (3/3) ... [2024-11-27 19:49:38,136 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-11-27 19:49:38,153 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:49:38,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 392 locations, 1 initial locations, 6 loop locations, and 61 error locations. [2024-11-27 19:49:38,154 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 19:49:38,354 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-27 19:49:38,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2024-11-27 19:49:38,643 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2024-11-27 19:49:38,649 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-27 19:49:38,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 24/409 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 819 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2024-11-27 19:49:38,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2024-11-27 19:49:38,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2024-11-27 19:49:38,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:49:38,695 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;@31b12642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:49:38,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2024-11-27 19:49:38,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 19:49:38,702 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-27 19:49:38,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:49:38,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:38,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:38,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:38,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1024146303, now seen corresponding path program 1 times [2024-11-27 19:49:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:38,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445825315] [2024-11-27 19:49:38,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:38,928 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-27 19:49:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445825315] [2024-11-27 19:49:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445825315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653719066] [2024-11-27 19:49:38,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:38,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:38,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:38,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:38,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:39,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-27 19:49:39,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:39,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:39,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-27 19:49:39,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:39,376 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2024-11-27 19:49:39,377 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-27 19:49:39,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 40/509 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1836 event pairs, 20 based on Foata normal form. 91/490 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2024-11-27 19:49:39,390 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2024-11-27 19:49:39,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2024-11-27 19:49:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:49:39,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:49:39,418 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:49:39,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2024-11-27 19:49:39,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-27 19:49:39,440 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2024-11-27 19:49:39,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2024-11-27 19:49:39,449 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2024-11-27 19:49:39,449 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2024-11-27 19:49:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:39,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:39,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:49:39,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 854044592, now seen corresponding path program 1 times [2024-11-27 19:49:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816239452] [2024-11-27 19:49:39,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:39,529 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-27 19:49:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816239452] [2024-11-27 19:49:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816239452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:39,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:39,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412631313] [2024-11-27 19:49:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:39,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:39,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:39,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:39,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:39,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-27 19:49:39,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:39,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:39,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-27 19:49:39,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:39,783 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2024-11-27 19:49:39,784 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-27 19:49:39,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 40/507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1732 event pairs, 20 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2024-11-27 19:49:39,791 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-11-27 19:49:39,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2024-11-27 19:49:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:39,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:39,795 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:39,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2024-11-27 19:49:39,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:39,809 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2024-11-27 19:49:39,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2024-11-27 19:49:39,811 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2024-11-27 19:49:39,811 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2024-11-27 19:49:39,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:39,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:39,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:49:39,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:39,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -427447794, now seen corresponding path program 1 times [2024-11-27 19:49:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092982421] [2024-11-27 19:49:39,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:39,882 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-27 19:49:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:39,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092982421] [2024-11-27 19:49:39,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092982421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:39,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:39,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761968368] [2024-11-27 19:49:39,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:39,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:39,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:39,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:39,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-27 19:49:39,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:39,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:39,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-27 19:49:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:40,117 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2024-11-27 19:49:40,118 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 19:49:40,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 488 events. 40/488 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1589 event pairs, 20 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 539. Up to 68 conditions per place. [2024-11-27 19:49:40,127 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-11-27 19:49:40,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2024-11-27 19:49:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:40,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:40,134 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:40,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2024-11-27 19:49:40,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:40,142 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2024-11-27 19:49:40,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2024-11-27 19:49:40,144 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2024-11-27 19:49:40,144 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2024-11-27 19:49:40,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:40,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:40,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:49:40,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:40,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1322024631, now seen corresponding path program 1 times [2024-11-27 19:49:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:40,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787859089] [2024-11-27 19:49:40,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:40,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:40,194 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-27 19:49:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787859089] [2024-11-27 19:49:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787859089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791689008] [2024-11-27 19:49:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:40,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:40,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:40,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:40,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-27 19:49:40,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:40,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-27 19:49:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:40,395 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2024-11-27 19:49:40,395 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 19:49:40,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 469 events. 40/469 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1402 event pairs, 20 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 509. Up to 68 conditions per place. [2024-11-27 19:49:40,402 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-11-27 19:49:40,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2024-11-27 19:49:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:40,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:40,406 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:40,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2024-11-27 19:49:40,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:40,413 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2024-11-27 19:49:40,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2024-11-27 19:49:40,415 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2024-11-27 19:49:40,415 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2024-11-27 19:49:40,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:40,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:40,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:49:40,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:40,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1994124702, now seen corresponding path program 1 times [2024-11-27 19:49:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660976375] [2024-11-27 19:49:40,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:40,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-27 19:49:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:40,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660976375] [2024-11-27 19:49:40,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660976375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:40,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:40,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960262247] [2024-11-27 19:49:40,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:40,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:40,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:40,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:40,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-27 19:49:40,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:40,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-27 19:49:40,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:40,645 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2024-11-27 19:49:40,645 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 19:49:40,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 450 events. 40/450 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1222 event pairs, 20 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 479. Up to 68 conditions per place. [2024-11-27 19:49:40,651 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-11-27 19:49:40,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2024-11-27 19:49:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:40,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:40,654 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:40,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2024-11-27 19:49:40,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:40,661 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2024-11-27 19:49:40,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=363, PETRI_TRANSITIONS=369} [2024-11-27 19:49:40,662 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2024-11-27 19:49:40,663 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2024-11-27 19:49:40,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:40,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:49:40,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2125455126, now seen corresponding path program 1 times [2024-11-27 19:49:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233333367] [2024-11-27 19:49:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:40,710 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-27 19:49:40,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233333367] [2024-11-27 19:49:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233333367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450986108] [2024-11-27 19:49:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:40,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:40,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:40,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:40,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-27 19:49:40,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 369 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:40,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-27 19:49:40,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:40,879 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2024-11-27 19:49:40,880 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 19:49:40,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 431 events. 40/431 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1060 event pairs, 20 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 449. Up to 68 conditions per place. [2024-11-27 19:49:40,885 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-11-27 19:49:40,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2024-11-27 19:49:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:40,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:40,889 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:40,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2024-11-27 19:49:40,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:40,895 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2024-11-27 19:49:40,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2024-11-27 19:49:40,897 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2024-11-27 19:49:40,897 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2024-11-27 19:49:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-27 19:49:40,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:40,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:40,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:49:40,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:40,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2083684682, now seen corresponding path program 1 times [2024-11-27 19:49:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:40,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965988593] [2024-11-27 19:49:40,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:40,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:40,961 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-27 19:49:40,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965988593] [2024-11-27 19:49:40,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965988593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:40,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:40,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238837124] [2024-11-27 19:49:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:40,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:40,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:40,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:41,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2024-11-27 19:49:41,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-27 19:49:41,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:41,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2024-11-27 19:49:41,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:42,133 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2024-11-27 19:49:42,133 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-27 19:49:42,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4767 events. 758/4767 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46194 event pairs, 387 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 5709. Up to 942 conditions per place. [2024-11-27 19:49:42,251 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-27 19:49:42,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2024-11-27 19:49:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-11-27 19:49:42,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2024-11-27 19:49:42,255 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2024-11-27 19:49:42,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2024-11-27 19:49:42,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:42,262 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2024-11-27 19:49:42,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=361, PETRI_TRANSITIONS=367} [2024-11-27 19:49:42,265 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2024-11-27 19:49:42,265 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2024-11-27 19:49:42,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-27 19:49:42,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:42,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:42,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:49:42,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:42,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -796584280, now seen corresponding path program 1 times [2024-11-27 19:49:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424005982] [2024-11-27 19:49:42,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:42,366 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-27 19:49:42,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:42,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424005982] [2024-11-27 19:49:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424005982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:42,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142284939] [2024-11-27 19:49:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:42,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:42,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:42,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-27 19:49:42,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 367 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-27 19:49:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:42,560 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2024-11-27 19:49:42,560 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-27 19:49:42,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 497 events. 55/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1873 event pairs, 30 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 569. Up to 90 conditions per place. [2024-11-27 19:49:42,568 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2024-11-27 19:49:42,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2024-11-27 19:49:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-11-27 19:49:42,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-11-27 19:49:42,572 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2024-11-27 19:49:42,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2024-11-27 19:49:42,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:49:42,586 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2024-11-27 19:49:42,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2024-11-27 19:49:42,589 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2024-11-27 19:49:42,589 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2024-11-27 19:49:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:42,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:42,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:42,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:49:42,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:42,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1013288607, now seen corresponding path program 1 times [2024-11-27 19:49:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015449055] [2024-11-27 19:49:42,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:42,683 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-27 19:49:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:42,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015449055] [2024-11-27 19:49:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015449055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:42,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:42,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244462867] [2024-11-27 19:49:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:42,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:42,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:42,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:42,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-27 19:49:42,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:42,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:42,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-27 19:49:42,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:42,891 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2024-11-27 19:49:42,892 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-27 19:49:42,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 492 events. 55/492 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1809 event pairs, 30 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 552. Up to 90 conditions per place. [2024-11-27 19:49:42,899 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2024-11-27 19:49:42,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2024-11-27 19:49:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-11-27 19:49:42,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-11-27 19:49:42,904 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2024-11-27 19:49:42,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2024-11-27 19:49:42,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:49:42,912 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2024-11-27 19:49:42,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=352, PETRI_TRANSITIONS=357} [2024-11-27 19:49:42,915 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2024-11-27 19:49:42,915 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2024-11-27 19:49:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:42,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:42,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:42,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:49:42,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:42,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1514980717, now seen corresponding path program 1 times [2024-11-27 19:49:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:42,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324785674] [2024-11-27 19:49:42,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:43,033 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-27 19:49:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324785674] [2024-11-27 19:49:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324785674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:43,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593844338] [2024-11-27 19:49:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:43,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:43,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:43,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:43,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-27 19:49:43,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:43,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:43,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-27 19:49:43,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:43,312 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2024-11-27 19:49:43,312 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-27 19:49:43,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 657 events. 66/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2920 event pairs, 5 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 729. Up to 95 conditions per place. [2024-11-27 19:49:43,322 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2024-11-27 19:49:43,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2024-11-27 19:49:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-11-27 19:49:43,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2024-11-27 19:49:43,327 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2024-11-27 19:49:43,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2024-11-27 19:49:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:49:43,335 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2024-11-27 19:49:43,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2024-11-27 19:49:43,337 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2024-11-27 19:49:43,338 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2024-11-27 19:49:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:43,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:43,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:49:43,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 93717617, now seen corresponding path program 1 times [2024-11-27 19:49:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946527009] [2024-11-27 19:49:43,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:43,414 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-27 19:49:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946527009] [2024-11-27 19:49:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946527009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:43,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:43,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040839757] [2024-11-27 19:49:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:43,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:43,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:43,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:43,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-27 19:49:43,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:43,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:43,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-27 19:49:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:43,729 INFO L124 PetriNetUnfolderBase]: 105/1026 cut-off events. [2024-11-27 19:49:43,729 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-27 19:49:43,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1026 events. 105/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5801 event pairs, 40 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 896. Up to 154 conditions per place. [2024-11-27 19:49:43,745 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2024-11-27 19:49:43,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 357 transitions, 837 flow [2024-11-27 19:49:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:43,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:43,749 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:43,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 357 transitions, 837 flow [2024-11-27 19:49:43,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 357 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:49:43,756 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2024-11-27 19:49:43,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=344, PETRI_TRANSITIONS=347} [2024-11-27 19:49:43,757 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2024-11-27 19:49:43,757 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2024-11-27 19:49:43,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:43,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:43,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:43,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:49:43,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:43,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash 97469428, now seen corresponding path program 1 times [2024-11-27 19:49:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810284194] [2024-11-27 19:49:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:43,801 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-27 19:49:43,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:43,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810284194] [2024-11-27 19:49:43,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810284194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:43,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:43,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253610779] [2024-11-27 19:49:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:43,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:43,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:43,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:43,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-27 19:49:43,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 347 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:43,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:43,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-27 19:49:43,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:44,253 INFO L124 PetriNetUnfolderBase]: 199/1421 cut-off events. [2024-11-27 19:49:44,253 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-27 19:49:44,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1421 events. 199/1421 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9644 event pairs, 98 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1436. Up to 302 conditions per place. [2024-11-27 19:49:44,275 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2024-11-27 19:49:44,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 351 transitions, 830 flow [2024-11-27 19:49:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2024-11-27 19:49:44,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2024-11-27 19:49:44,279 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1164 transitions. [2024-11-27 19:49:44,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 351 transitions, 830 flow [2024-11-27 19:49:44,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:49:44,289 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2024-11-27 19:49:44,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=342} [2024-11-27 19:49:44,292 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2024-11-27 19:49:44,293 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2024-11-27 19:49:44,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:44,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:44,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:44,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:49:44,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash -131661210, now seen corresponding path program 1 times [2024-11-27 19:49:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:44,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829760824] [2024-11-27 19:49:44,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:44,375 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-27 19:49:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829760824] [2024-11-27 19:49:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829760824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507360729] [2024-11-27 19:49:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:44,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:44,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:44,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:44,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-27 19:49:44,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:44,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:44,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-27 19:49:44,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:44,694 INFO L124 PetriNetUnfolderBase]: 175/1141 cut-off events. [2024-11-27 19:49:44,694 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-27 19:49:44,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 1141 events. 175/1141 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6503 event pairs, 82 based on Foata normal form. 1/1044 useless extension candidates. Maximal degree in co-relation 912. Up to 269 conditions per place. [2024-11-27 19:49:44,711 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2024-11-27 19:49:44,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2024-11-27 19:49:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-27 19:49:44,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-27 19:49:44,714 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2024-11-27 19:49:44,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2024-11-27 19:49:44,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:49:44,721 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2024-11-27 19:49:44,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2024-11-27 19:49:44,723 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2024-11-27 19:49:44,723 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2024-11-27 19:49:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 19:49:44,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:44,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:49:44,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:49:44,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:44,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1585636668, now seen corresponding path program 1 times [2024-11-27 19:49:44,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:44,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246980834] [2024-11-27 19:49:44,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:44,797 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-27 19:49:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246980834] [2024-11-27 19:49:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246980834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:44,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480411403] [2024-11-27 19:49:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:44,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:44,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:44,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2024-11-27 19:49:44,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-27 19:49:44,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:44,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2024-11-27 19:49:44,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:54,859 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2024-11-27 19:49:54,860 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2024-11-27 19:49:55,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89458 conditions, 60994 events. 17906/60994 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 2231. Compared 865554 event pairs, 8762 based on Foata normal form. 1/52708 useless extension candidates. Maximal degree in co-relation 34103. Up to 21614 conditions per place. [2024-11-27 19:49:55,794 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2024-11-27 19:49:55,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2024-11-27 19:49:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-11-27 19:49:55,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2024-11-27 19:49:55,797 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2024-11-27 19:49:55,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2024-11-27 19:49:56,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 19:49:56,047 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2024-11-27 19:49:56,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=319, PETRI_TRANSITIONS=265} [2024-11-27 19:49:56,049 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2024-11-27 19:49:56,050 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2024-11-27 19:49:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-27 19:49:56,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:56,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:49:56,051 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1794437906, now seen corresponding path program 1 times [2024-11-27 19:49:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183830380] [2024-11-27 19:49:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:56,124 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-27 19:49:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183830380] [2024-11-27 19:49:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183830380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031799499] [2024-11-27 19:49:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:56,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:56,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:56,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:56,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-27 19:49:56,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 265 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-27 19:49:56,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:56,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-27 19:49:56,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:57,369 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2024-11-27 19:49:57,370 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2024-11-27 19:49:57,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10493 conditions, 7454 events. 1604/7454 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 81581 event pairs, 362 based on Foata normal form. 0/6282 useless extension candidates. Maximal degree in co-relation 5435. Up to 1748 conditions per place. [2024-11-27 19:49:57,504 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-27 19:49:57,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2024-11-27 19:49:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:49:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:49:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:49:57,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:49:57,509 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:49:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2024-11-27 19:49:57,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 19:49:57,520 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2024-11-27 19:49:57,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2024-11-27 19:49:57,521 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2024-11-27 19:49:57,521 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2024-11-27 19:49:57,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-27 19:49:57,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:49:57,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:49:57,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:49:57,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1233554861, now seen corresponding path program 1 times [2024-11-27 19:49:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234256528] [2024-11-27 19:49:57,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:57,605 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-27 19:49:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234256528] [2024-11-27 19:49:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234256528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:57,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:57,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:49:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942243953] [2024-11-27 19:49:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:57,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:49:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:57,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:49:57,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:49:57,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-27 19:49:57,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-27 19:49:57,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:49:57,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-27 19:49:57,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:49:59,807 INFO L124 PetriNetUnfolderBase]: 3288/13832 cut-off events. [2024-11-27 19:49:59,807 INFO L125 PetriNetUnfolderBase]: For 273/289 co-relation queries the response was YES. [2024-11-27 19:49:59,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20763 conditions, 13832 events. 3288/13832 cut-off events. For 273/289 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 168914 event pairs, 981 based on Foata normal form. 0/12203 useless extension candidates. Maximal degree in co-relation 20163. Up to 2895 conditions per place. [2024-11-27 19:50:00,062 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-27 19:50:00,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2024-11-27 19:50:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:50:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:50:00,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:50:00,066 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:50:00,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2024-11-27 19:50:00,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:50:00,078 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2024-11-27 19:50:00,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2024-11-27 19:50:00,079 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2024-11-27 19:50:00,079 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2024-11-27 19:50:00,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-27 19:50:00,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:00,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:00,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:50:00,081 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:50:00,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1896144623, now seen corresponding path program 1 times [2024-11-27 19:50:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622618241] [2024-11-27 19:50:00,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:00,144 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-27 19:50:00,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622618241] [2024-11-27 19:50:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622618241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:00,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:00,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714412463] [2024-11-27 19:50:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:00,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-27 19:50:00,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-27 19:50:00,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:00,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-27 19:50:00,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:01,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 446#true]) [2024-11-27 19:50:01,150 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,150 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,150 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-27 19:50:01,151 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 19:50:01,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,152 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-27 19:50:01,152 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-27 19:50:01,152 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 19:50:01,152 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 19:50:01,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true, 446#true]) [2024-11-27 19:50:01,383 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-27 19:50:01,383 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 19:50:01,383 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 19:50:01,383 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-27 19:50:01,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:01,384 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-27 19:50:01,384 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-27 19:50:01,384 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-27 19:50:01,384 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 19:50:01,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,439 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-27 19:50:01,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:01,439 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-27 19:50:01,439 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:01,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,440 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-27 19:50:01,440 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-27 19:50:01,440 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,440 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,528 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 446#true]) [2024-11-27 19:50:01,528 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:01,528 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-27 19:50:01,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, Black: 442#true, 446#true]) [2024-11-27 19:50:01,529 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 19:50:01,529 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:01,529 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:01,529 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:01,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 244#L107-4true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2024-11-27 19:50:01,676 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-27 19:50:01,676 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-27 19:50:01,676 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,676 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-27 19:50:01,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 244#L107-4true, Black: 438#true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2024-11-27 19:50:01,678 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-27 19:50:01,678 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 19:50:01,678 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 19:50:01,678 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:01,768 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 454#true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true, 446#true]) [2024-11-27 19:50:01,768 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:01,768 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:01,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true, 446#true]) [2024-11-27 19:50:01,770 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 19:50:01,770 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 19:50:01,770 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:01,770 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 341#$Ultimate##0true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,815 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 312#$Ultimate##0true, 465#true, 339#L41-3true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,815 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 19:50:01,815 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-27 19:50:01,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,816 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-27 19:50:01,816 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:01,816 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-27 19:50:01,816 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:01,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 341#$Ultimate##0true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:01,969 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 19:50:01,970 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:01,970 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:01,970 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 19:50:02,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, 312#$Ultimate##0true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:02,040 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-27 19:50:02,040 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:02,040 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:02,040 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-27 19:50:02,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, Black: 454#true, 465#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:02,041 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-27 19:50:02,041 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:02,041 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:02,041 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 19:50:02,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 26#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 377#L81-3true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2024-11-27 19:50:02,042 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-27 19:50:02,042 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 19:50:02,042 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:02,042 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:02,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([978] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 465#true, 339#L41-3true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:02,124 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-27 19:50:02,124 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 19:50:02,124 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 19:50:02,124 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-27 19:50:02,297 INFO L124 PetriNetUnfolderBase]: 2474/10213 cut-off events. [2024-11-27 19:50:02,297 INFO L125 PetriNetUnfolderBase]: For 441/457 co-relation queries the response was YES. [2024-11-27 19:50:02,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15307 conditions, 10213 events. 2474/10213 cut-off events. For 441/457 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 117851 event pairs, 718 based on Foata normal form. 0/8892 useless extension candidates. Maximal degree in co-relation 14215. Up to 2243 conditions per place. [2024-11-27 19:50:02,483 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-11-27 19:50:02,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2024-11-27 19:50:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:50:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:50:02,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:50:02,487 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:50:02,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2024-11-27 19:50:02,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:50:02,501 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2024-11-27 19:50:02,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2024-11-27 19:50:02,502 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2024-11-27 19:50:02,502 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2024-11-27 19:50:02,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-27 19:50:02,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:02,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:02,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 19:50:02,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:50:02,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 635437828, now seen corresponding path program 1 times [2024-11-27 19:50:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:02,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931582238] [2024-11-27 19:50:02,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:02,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:02,572 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-27 19:50:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931582238] [2024-11-27 19:50:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931582238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21807412] [2024-11-27 19:50:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:02,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:02,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:02,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-27 19:50:02,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-27 19:50:02,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:02,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-27 19:50:02,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:03,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 190#$Ultimate##0true, 312#$Ultimate##0true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:03,880 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-11-27 19:50:03,880 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-27 19:50:03,880 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:03,880 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 19:50:03,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, Black: 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:03,880 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 19:50:03,880 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:03,881 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:03,881 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:04,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 339#L41-3true, 454#true, 273#L108-4true, 341#$Ultimate##0true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:04,117 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 19:50:04,117 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:04,117 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:04,117 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:04,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 339#L41-3true, Black: 458#true, 273#L108-4true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:04,118 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 19:50:04,118 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:04,118 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 19:50:04,118 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:04,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 190#$Ultimate##0true, 312#$Ultimate##0true, 454#true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:04,122 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 19:50:04,122 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:04,122 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:04,122 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-27 19:50:04,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, Black: 454#true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:04,122 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 19:50:04,122 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:04,122 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:04,123 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 19:50:04,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, 312#$Ultimate##0true, Black: 454#true, 273#L108-4true, Black: 458#true, 341#$Ultimate##0true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:04,189 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-27 19:50:04,189 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 19:50:04,189 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-27 19:50:04,189 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 19:50:04,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, 312#$Ultimate##0true, 339#L41-3true, 454#true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, 379#L49-3true, Black: 442#true]) [2024-11-27 19:50:04,311 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 19:50:04,311 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:04,311 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 19:50:04,311 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 19:50:04,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 339#L41-3true, 273#L108-4true, Black: 458#true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 377#L81-3true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:04,311 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-27 19:50:04,312 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 19:50:04,312 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-27 19:50:04,312 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 19:50:04,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, 339#L41-3true, Black: 458#true, 341#$Ultimate##0true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true]) [2024-11-27 19:50:04,363 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-27 19:50:04,363 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:04,363 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:04,363 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-27 19:50:04,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 190#$Ultimate##0true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:04,364 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-27 19:50:04,364 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-27 19:50:04,364 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-27 19:50:04,364 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-27 19:50:04,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, Black: 450#true, 41#L73-3true, Black: 454#true, 312#$Ultimate##0true, 339#L41-3true, Black: 458#true, 273#L108-4true, 460#(= |#race~n~0| 0), 25#L57-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 340#L65-3true, Black: 442#true, 379#L49-3true]) [2024-11-27 19:50:04,492 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-27 19:50:04,492 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 19:50:04,492 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 19:50:04,492 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 19:50:04,607 INFO L124 PetriNetUnfolderBase]: 2368/9261 cut-off events. [2024-11-27 19:50:04,607 INFO L125 PetriNetUnfolderBase]: For 491/513 co-relation queries the response was YES. [2024-11-27 19:50:04,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14203 conditions, 9261 events. 2368/9261 cut-off events. For 491/513 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 104231 event pairs, 725 based on Foata normal form. 2/8149 useless extension candidates. Maximal degree in co-relation 13541. Up to 2033 conditions per place. [2024-11-27 19:50:04,750 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-11-27 19:50:04,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2024-11-27 19:50:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:50:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:50:04,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:50:04,753 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:50:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2024-11-27 19:50:04,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:50:04,763 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2024-11-27 19:50:04,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2024-11-27 19:50:04,764 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2024-11-27 19:50:04,765 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2024-11-27 19:50:04,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-27 19:50:04,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:04,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:04,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 19:50:04,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:50:04,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1850627078, now seen corresponding path program 1 times [2024-11-27 19:50:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:04,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132310315] [2024-11-27 19:50:04,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:04,837 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-27 19:50:04,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:04,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132310315] [2024-11-27 19:50:04,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132310315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:04,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250249146] [2024-11-27 19:50:04,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:04,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:04,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:04,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:04,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-27 19:50:04,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-27 19:50:04,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:04,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-27 19:50:04,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:06,493 INFO L124 PetriNetUnfolderBase]: 1913/7673 cut-off events. [2024-11-27 19:50:06,493 INFO L125 PetriNetUnfolderBase]: For 430/473 co-relation queries the response was YES. [2024-11-27 19:50:06,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11697 conditions, 7673 events. 1913/7673 cut-off events. For 430/473 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 82636 event pairs, 588 based on Foata normal form. 5/6791 useless extension candidates. Maximal degree in co-relation 10772. Up to 1778 conditions per place. [2024-11-27 19:50:06,613 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-27 19:50:06,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2024-11-27 19:50:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:50:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:50:06,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:50:06,617 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:50:06,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2024-11-27 19:50:06,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:50:06,628 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2024-11-27 19:50:06,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2024-11-27 19:50:06,629 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2024-11-27 19:50:06,629 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2024-11-27 19:50:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-27 19:50:06,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:06,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:06,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 19:50:06,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-27 19:50:06,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash 697579009, now seen corresponding path program 1 times [2024-11-27 19:50:06,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454472560] [2024-11-27 19:50:06,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:06,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:06,706 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-27 19:50:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:06,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454472560] [2024-11-27 19:50:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454472560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:06,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810655437] [2024-11-27 19:50:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:06,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:06,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:06,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-27 19:50:06,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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-27 19:50:06,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:06,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-27 19:50:06,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:07,946 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2024-11-27 19:50:07,946 INFO L125 PetriNetUnfolderBase]: For 224/252 co-relation queries the response was YES. [2024-11-27 19:50:08,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8383 conditions, 5788 events. 1313/5788 cut-off events. For 224/252 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 58401 event pairs, 333 based on Foata normal form. 4/5099 useless extension candidates. Maximal degree in co-relation 7691. Up to 1400 conditions per place. [2024-11-27 19:50:08,010 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2024-11-27 19:50:08,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2024-11-27 19:50:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:50:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-27 19:50:08,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-27 19:50:08,013 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2024-11-27 19:50:08,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2024-11-27 19:50:08,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:50:08,021 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2024-11-27 19:50:08,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2024-11-27 19:50:08,021 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2024-11-27 19:50:08,021 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2024-11-27 19:50:08,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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-27 19:50:08,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2024-11-27 19:50:08,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2024-11-27 19:50:08,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2024-11-27 19:50:08,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2024-11-27 19:50:08,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2024-11-27 19:50:08,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2024-11-27 19:50:08,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2024-11-27 19:50:08,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2024-11-27 19:50:08,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2024-11-27 19:50:08,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2024-11-27 19:50:08,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2024-11-27 19:50:08,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2024-11-27 19:50:08,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2024-11-27 19:50:08,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2024-11-27 19:50:08,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2024-11-27 19:50:08,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2024-11-27 19:50:08,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2024-11-27 19:50:08,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2024-11-27 19:50:08,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2024-11-27 19:50:08,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2024-11-27 19:50:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 19:50:08,034 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:08,040 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 19:50:08,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:50:08,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:50:08 BasicIcfg [2024-11-27 19:50:08,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:50:08,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:50:08,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:50:08,048 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:50:08,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:38" (3/4) ... [2024-11-27 19:50:08,051 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 19:50:08,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-27 19:50:08,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-27 19:50:08,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-27 19:50:08,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-27 19:50:08,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-27 19:50:08,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-27 19:50:08,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-27 19:50:08,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-27 19:50:08,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-27 19:50:08,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 19:50:08,170 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 19:50:08,171 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 19:50:08,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:50:08,171 INFO L158 Benchmark]: Toolchain (without parser) took 31381.46ms. Allocated memory was 117.4MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 92.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2024-11-27 19:50:08,172 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:08,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.92ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:50:08,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.86ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:08,173 INFO L158 Benchmark]: Boogie Preprocessor took 53.71ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:08,173 INFO L158 Benchmark]: RCFGBuilder took 938.88ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 49.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 19:50:08,173 INFO L158 Benchmark]: TraceAbstraction took 29921.19ms. Allocated memory was 117.4MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 48.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2024-11-27 19:50:08,174 INFO L158 Benchmark]: Witness Printer took 122.83ms. Allocated memory is still 5.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:50:08,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.92ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.86ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.71ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 938.88ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 49.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29921.19ms. Allocated memory was 117.4MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 48.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. * Witness Printer took 122.83ms. Allocated memory is still 5.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 536 locations, 97 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: 29.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 209 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-27 19:50:08,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798e3a5b-ae2f-448a-9c1d-e1e02b48fa41/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE