./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX --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 c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:51:17,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:51:17,183 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 16:51:17,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:51:17,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:51:17,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:51:17,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:51:17,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:51:17,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:51:17,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:51:17,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:51:17,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:51:17,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:51:17,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:51:17,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:51:17,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:51:17,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:51:17,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:51:17,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:51:17,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:51:17,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:51:17,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:51:17,258 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 16:51:17,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:51:17,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:51:17,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:51:17,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:51:17,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:51:17,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:51:17,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:51:17,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:51:17,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:51:17,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:51:17,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:51:17,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:51:17,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:51:17,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:51:17,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:51:17,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:51:17,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:51:17,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:51:17,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX 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 -> c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 [2024-11-08 16:51:17,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:51:17,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:51:17,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:51:17,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:51:17,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:51:17,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i Unable to find full path for "g++" [2024-11-08 16:51:20,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:51:20,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:51:20,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i [2024-11-08 16:51:20,778 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/data/2d537836b/f7ac26d8e9e0486abb20c43b13265e26/FLAG53285040d [2024-11-08 16:51:20,805 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/data/2d537836b/f7ac26d8e9e0486abb20c43b13265e26 [2024-11-08 16:51:20,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:51:20,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:51:20,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:51:20,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:51:20,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:51:20,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:51:20" (1/1) ... [2024-11-08 16:51:20,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef25053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:20, skipping insertion in model container [2024-11-08 16:51:20,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:51:20" (1/1) ... [2024-11-08 16:51:20,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:51:21,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:51:21,758 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:51:21,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:51:21,928 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:51:21,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21 WrapperNode [2024-11-08 16:51:21,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:51:21,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:51:21,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:51:21,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:51:21,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:21,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,027 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-08 16:51:22,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:51:22,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:51:22,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:51:22,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:51:22,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:51:22,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:51:22,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:51:22,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:51:22,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (1/1) ... [2024-11-08 16:51:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:51:22,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:22,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:22,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:51:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:51:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:51:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:51:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 16:51:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-08 16:51:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-08 16:51:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:51:22,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:51:22,225 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:51:22,507 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:51:22,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:51:22,927 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:51:22,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:51:22,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:51:22,942 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:51:22,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:22 BoogieIcfgContainer [2024-11-08 16:51:22,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:51:22,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:51:22,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:51:22,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:51:22,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:51:20" (1/3) ... [2024-11-08 16:51:22,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b822bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:51:22, skipping insertion in model container [2024-11-08 16:51:22,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:51:21" (2/3) ... [2024-11-08 16:51:22,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b822bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:51:22, skipping insertion in model container [2024-11-08 16:51:22,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:51:22" (3/3) ... [2024-11-08 16:51:22,954 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i [2024-11-08 16:51:22,979 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:51:22,979 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-08 16:51:22,980 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:51:23,063 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 16:51:23,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions, 179 flow [2024-11-08 16:51:23,167 INFO L124 PetriNetUnfolderBase]: 6/120 cut-off events. [2024-11-08 16:51:23,167 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 16:51:23,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 120 events. 6/120 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2024-11-08 16:51:23,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 86 transitions, 179 flow [2024-11-08 16:51:23,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 86 transitions, 179 flow [2024-11-08 16:51:23,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:51:23,194 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;@273248ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:51:23,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 16:51:23,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:51:23,210 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-08 16:51:23,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:51:23,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:23,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:23,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 16:51:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2123334769, now seen corresponding path program 1 times [2024-11-08 16:51:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512778860] [2024-11-08 16:51:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:23,796 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-08 16:51:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512778860] [2024-11-08 16:51:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512778860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:23,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:23,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028646598] [2024-11-08 16:51:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:23,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:51:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:51:23,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:51:24,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 86 [2024-11-08 16:51:24,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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-08 16:51:24,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:24,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 86 [2024-11-08 16:51:24,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:24,225 INFO L124 PetriNetUnfolderBase]: 5/126 cut-off events. [2024-11-08 16:51:24,225 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 16:51:24,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 126 events. 5/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 172 event pairs, 0 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 65. Up to 19 conditions per place. [2024-11-08 16:51:24,228 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 13 selfloop transitions, 2 changer transitions 7/91 dead transitions. [2024-11-08 16:51:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 91 transitions, 231 flow [2024-11-08 16:51:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 443 transitions. [2024-11-08 16:51:24,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8585271317829457 [2024-11-08 16:51:24,252 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 179 flow. Second operand 6 states and 443 transitions. [2024-11-08 16:51:24,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 91 transitions, 231 flow [2024-11-08 16:51:24,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:24,262 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 195 flow [2024-11-08 16:51:24,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-11-08 16:51:24,273 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 9 predicate places. [2024-11-08 16:51:24,273 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 195 flow [2024-11-08 16:51:24,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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-08 16:51:24,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:24,274 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:51:24,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 16:51:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 226160941, now seen corresponding path program 1 times [2024-11-08 16:51:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841110322] [2024-11-08 16:51:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:25,195 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-08 16:51:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841110322] [2024-11-08 16:51:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841110322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:25,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796999088] [2024-11-08 16:51:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:25,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 86 [2024-11-08 16:51:25,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 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-08 16:51:25,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:25,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 86 [2024-11-08 16:51:25,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:25,759 INFO L124 PetriNetUnfolderBase]: 75/360 cut-off events. [2024-11-08 16:51:25,760 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2024-11-08 16:51:25,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 360 events. 75/360 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1684 event pairs, 32 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 497. Up to 150 conditions per place. [2024-11-08 16:51:25,766 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 23 selfloop transitions, 22 changer transitions 0/105 dead transitions. [2024-11-08 16:51:25,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 105 transitions, 327 flow [2024-11-08 16:51:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2024-11-08 16:51:25,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7984496124031008 [2024-11-08 16:51:25,787 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 195 flow. Second operand 6 states and 412 transitions. [2024-11-08 16:51:25,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 105 transitions, 327 flow [2024-11-08 16:51:25,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 105 transitions, 313 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-08 16:51:25,804 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 331 flow [2024-11-08 16:51:25,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-11-08 16:51:25,805 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 10 predicate places. [2024-11-08 16:51:25,805 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 331 flow [2024-11-08 16:51:25,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 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-08 16:51:25,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:25,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:51:25,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 16:51:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1378222114, now seen corresponding path program 1 times [2024-11-08 16:51:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724465024] [2024-11-08 16:51:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724465024] [2024-11-08 16:51:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724465024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:26,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:26,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770567640] [2024-11-08 16:51:26,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:26,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:26,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 86 [2024-11-08 16:51:26,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 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-08 16:51:26,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:26,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 86 [2024-11-08 16:51:26,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:27,001 INFO L124 PetriNetUnfolderBase]: 133/484 cut-off events. [2024-11-08 16:51:27,001 INFO L125 PetriNetUnfolderBase]: For 140/160 co-relation queries the response was YES. [2024-11-08 16:51:27,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 484 events. 133/484 cut-off events. For 140/160 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2474 event pairs, 26 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 981. Up to 238 conditions per place. [2024-11-08 16:51:27,011 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 33 selfloop transitions, 48 changer transitions 9/148 dead transitions. [2024-11-08 16:51:27,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 148 transitions, 649 flow [2024-11-08 16:51:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2024-11-08 16:51:27,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.877906976744186 [2024-11-08 16:51:27,016 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 331 flow. Second operand 6 states and 453 transitions. [2024-11-08 16:51:27,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 148 transitions, 649 flow [2024-11-08 16:51:27,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 148 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:27,032 INFO L231 Difference]: Finished difference. Result has 105 places, 139 transitions, 701 flow [2024-11-08 16:51:27,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=701, PETRI_PLACES=105, PETRI_TRANSITIONS=139} [2024-11-08 16:51:27,034 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 20 predicate places. [2024-11-08 16:51:27,034 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 139 transitions, 701 flow [2024-11-08 16:51:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 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-08 16:51:27,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:27,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:27,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:51:27,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 16:51:27,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash -330153063, now seen corresponding path program 1 times [2024-11-08 16:51:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463659216] [2024-11-08 16:51:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:51:27,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463659216] [2024-11-08 16:51:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463659216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:27,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008743927] [2024-11-08 16:51:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:27,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:27,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:27,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:27,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 86 [2024-11-08 16:51:27,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 139 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 65.16666666666667) internal successors, (391), 6 states have internal predecessors, (391), 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-08 16:51:27,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:27,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 86 [2024-11-08 16:51:27,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:28,011 INFO L124 PetriNetUnfolderBase]: 143/510 cut-off events. [2024-11-08 16:51:28,011 INFO L125 PetriNetUnfolderBase]: For 497/543 co-relation queries the response was YES. [2024-11-08 16:51:28,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 510 events. 143/510 cut-off events. For 497/543 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2816 event pairs, 10 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 1468. Up to 241 conditions per place. [2024-11-08 16:51:28,018 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 73 selfloop transitions, 25 changer transitions 13/167 dead transitions. [2024-11-08 16:51:28,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 167 transitions, 1084 flow [2024-11-08 16:51:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 421 transitions. [2024-11-08 16:51:28,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8158914728682171 [2024-11-08 16:51:28,021 INFO L175 Difference]: Start difference. First operand has 105 places, 139 transitions, 701 flow. Second operand 6 states and 421 transitions. [2024-11-08 16:51:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 167 transitions, 1084 flow [2024-11-08 16:51:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 167 transitions, 1066 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:28,049 INFO L231 Difference]: Finished difference. Result has 107 places, 154 transitions, 918 flow [2024-11-08 16:51:28,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=107, PETRI_TRANSITIONS=154} [2024-11-08 16:51:28,050 INFO L277 CegarLoopForPetriNet]: 85 programPoint places, 22 predicate places. [2024-11-08 16:51:28,050 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 154 transitions, 918 flow [2024-11-08 16:51:28,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.16666666666667) internal successors, (391), 6 states have internal predecessors, (391), 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-08 16:51:28,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:28,051 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-08 16:51:28,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:51:28,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 16:51:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash -327656646, now seen corresponding path program 1 times [2024-11-08 16:51:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605166558] [2024-11-08 16:51:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:28,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:28,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:28,157 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:51:28,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-08 16:51:28,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-08 16:51:28,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-08 16:51:28,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-08 16:51:28,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-08 16:51:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:51:28,163 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 16:51:28,167 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 16:51:28,167 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-08 16:51:28,204 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-08 16:51:28,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 104 transitions, 224 flow [2024-11-08 16:51:28,248 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-11-08 16:51:28,248 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-08 16:51:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 415 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 122. Up to 8 conditions per place. [2024-11-08 16:51:28,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 104 transitions, 224 flow [2024-11-08 16:51:28,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 104 transitions, 224 flow [2024-11-08 16:51:28,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:51:28,254 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;@273248ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:51:28,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-08 16:51:28,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:51:28,261 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-08 16:51:28,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:51:28,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:28,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:28,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:51:28,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash -865446799, now seen corresponding path program 1 times [2024-11-08 16:51:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905748528] [2024-11-08 16:51:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:28,362 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-08 16:51:28,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905748528] [2024-11-08 16:51:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905748528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:28,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:28,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099795384] [2024-11-08 16:51:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:28,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:51:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:51:28,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:51:28,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 104 [2024-11-08 16:51:28,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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-08 16:51:28,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:28,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 104 [2024-11-08 16:51:28,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:28,598 INFO L124 PetriNetUnfolderBase]: 10/212 cut-off events. [2024-11-08 16:51:28,599 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-08 16:51:28,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 212 events. 10/212 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 441 event pairs, 0 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 153. Up to 38 conditions per place. [2024-11-08 16:51:28,601 INFO L140 encePairwiseOnDemand]: 94/104 looper letters, 16 selfloop transitions, 2 changer transitions 7/110 dead transitions. [2024-11-08 16:51:28,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 284 flow [2024-11-08 16:51:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2024-11-08 16:51:28,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8685897435897436 [2024-11-08 16:51:28,612 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 224 flow. Second operand 6 states and 542 transitions. [2024-11-08 16:51:28,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 284 flow [2024-11-08 16:51:28,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:28,615 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 244 flow [2024-11-08 16:51:28,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2024-11-08 16:51:28,617 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places. [2024-11-08 16:51:28,618 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 244 flow [2024-11-08 16:51:28,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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-08 16:51:28,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:28,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:51:28,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:51:28,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1532346669, now seen corresponding path program 1 times [2024-11-08 16:51:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380378988] [2024-11-08 16:51:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:28,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:29,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-08 16:51:29,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380378988] [2024-11-08 16:51:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380378988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83752341] [2024-11-08 16:51:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:29,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:29,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:29,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2024-11-08 16:51:29,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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-08 16:51:29,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:29,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2024-11-08 16:51:29,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:29,935 INFO L124 PetriNetUnfolderBase]: 926/2681 cut-off events. [2024-11-08 16:51:29,936 INFO L125 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2024-11-08 16:51:29,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 2681 events. 926/2681 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 20265 event pairs, 529 based on Foata normal form. 0/2419 useless extension candidates. Maximal degree in co-relation 3052. Up to 1384 conditions per place. [2024-11-08 16:51:29,965 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 31 selfloop transitions, 38 changer transitions 0/141 dead transitions. [2024-11-08 16:51:29,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 141 transitions, 463 flow [2024-11-08 16:51:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2024-11-08 16:51:29,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8125 [2024-11-08 16:51:29,968 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 244 flow. Second operand 6 states and 507 transitions. [2024-11-08 16:51:29,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 141 transitions, 463 flow [2024-11-08 16:51:29,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 141 transitions, 451 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-08 16:51:29,974 INFO L231 Difference]: Finished difference. Result has 115 places, 140 transitions, 486 flow [2024-11-08 16:51:29,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=115, PETRI_TRANSITIONS=140} [2024-11-08 16:51:29,976 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2024-11-08 16:51:29,976 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 140 transitions, 486 flow [2024-11-08 16:51:29,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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-08 16:51:29,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:29,977 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:29,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:51:29,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:51:29,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash 410956818, now seen corresponding path program 1 times [2024-11-08 16:51:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720947876] [2024-11-08 16:51:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:30,499 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-08 16:51:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720947876] [2024-11-08 16:51:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720947876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:30,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356031290] [2024-11-08 16:51:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:30,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:30,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 104 [2024-11-08 16:51:30,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 140 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-08 16:51:30,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:30,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 104 [2024-11-08 16:51:30,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:31,934 INFO L124 PetriNetUnfolderBase]: 1892/4711 cut-off events. [2024-11-08 16:51:31,934 INFO L125 PetriNetUnfolderBase]: For 1548/1673 co-relation queries the response was YES. [2024-11-08 16:51:31,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 4711 events. 1892/4711 cut-off events. For 1548/1673 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 37005 event pairs, 446 based on Foata normal form. 0/4382 useless extension candidates. Maximal degree in co-relation 8622. Up to 2580 conditions per place. [2024-11-08 16:51:31,981 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 63 selfloop transitions, 92 changer transitions 0/235 dead transitions. [2024-11-08 16:51:31,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 235 transitions, 1232 flow [2024-11-08 16:51:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2024-11-08 16:51:31,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2024-11-08 16:51:31,985 INFO L175 Difference]: Start difference. First operand has 115 places, 140 transitions, 486 flow. Second operand 6 states and 555 transitions. [2024-11-08 16:51:31,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 235 transitions, 1232 flow [2024-11-08 16:51:31,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 235 transitions, 1232 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:32,000 INFO L231 Difference]: Finished difference. Result has 125 places, 227 transitions, 1322 flow [2024-11-08 16:51:32,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=125, PETRI_TRANSITIONS=227} [2024-11-08 16:51:32,002 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2024-11-08 16:51:32,002 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 227 transitions, 1322 flow [2024-11-08 16:51:32,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-08 16:51:32,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:32,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:51:32,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:51:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash -615339383, now seen corresponding path program 1 times [2024-11-08 16:51:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635027064] [2024-11-08 16:51:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:51:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635027064] [2024-11-08 16:51:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635027064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:32,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833774418] [2024-11-08 16:51:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:32,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:51:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:32,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:51:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:51:32,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 104 [2024-11-08 16:51:32,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 227 transitions, 1322 flow. Second operand has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 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-08 16:51:32,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:32,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 104 [2024-11-08 16:51:32,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:34,486 INFO L124 PetriNetUnfolderBase]: 2342/5601 cut-off events. [2024-11-08 16:51:34,486 INFO L125 PetriNetUnfolderBase]: For 5473/5834 co-relation queries the response was YES. [2024-11-08 16:51:34,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17559 conditions, 5601 events. 2342/5601 cut-off events. For 5473/5834 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44851 event pairs, 295 based on Foata normal form. 2/5356 useless extension candidates. Maximal degree in co-relation 14223. Up to 3135 conditions per place. [2024-11-08 16:51:34,564 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 145 selfloop transitions, 76 changer transitions 0/300 dead transitions. [2024-11-08 16:51:34,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 300 transitions, 2256 flow [2024-11-08 16:51:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:51:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:51:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 518 transitions. [2024-11-08 16:51:34,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8301282051282052 [2024-11-08 16:51:34,567 INFO L175 Difference]: Start difference. First operand has 125 places, 227 transitions, 1322 flow. Second operand 6 states and 518 transitions. [2024-11-08 16:51:34,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 300 transitions, 2256 flow [2024-11-08 16:51:34,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 300 transitions, 2238 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:34,632 INFO L231 Difference]: Finished difference. Result has 135 places, 298 transitions, 2162 flow [2024-11-08 16:51:34,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2162, PETRI_PLACES=135, PETRI_TRANSITIONS=298} [2024-11-08 16:51:34,636 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2024-11-08 16:51:34,637 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 298 transitions, 2162 flow [2024-11-08 16:51:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 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-08 16:51:34,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:34,639 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:34,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:51:34,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:51:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2056402574, now seen corresponding path program 1 times [2024-11-08 16:51:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437955464] [2024-11-08 16:51:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437955464] [2024-11-08 16:51:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437955464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:51:35,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167134116] [2024-11-08 16:51:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:35,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:35,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:35,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:35,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:51:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:35,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:51:35,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:36,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:51:36,161 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:51:36,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:51:36,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 16:51:36,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-08 16:51:36,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:36,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-08 16:51:36,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:36,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-08 16:51:36,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-08 16:51:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:36,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:51:36,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-08 16:51:36,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-08 16:51:36,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-08 16:51:36,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_233) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-08 16:51:45,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:45,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-08 16:51:45,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:45,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-08 16:51:45,136 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:51:45,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:51:45,151 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:51:45,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:51:45,166 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:51:45,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-08 16:51:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 16:51:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167134116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:51:45,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:51:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-08 16:51:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541914981] [2024-11-08 16:51:45,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:51:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 16:51:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 16:51:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=235, Unknown=23, NotChecked=140, Total=462 [2024-11-08 16:51:45,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-08 16:51:45,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 298 transitions, 2162 flow. Second operand has 22 states, 22 states have (on average 51.13636363636363) internal successors, (1125), 22 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-08 16:51:45,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:51:45,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-08 16:51:45,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:51:51,649 INFO L124 PetriNetUnfolderBase]: 7034/14848 cut-off events. [2024-11-08 16:51:51,649 INFO L125 PetriNetUnfolderBase]: For 22063/22318 co-relation queries the response was YES. [2024-11-08 16:51:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48457 conditions, 14848 events. 7034/14848 cut-off events. For 22063/22318 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 129113 event pairs, 2037 based on Foata normal form. 77/14173 useless extension candidates. Maximal degree in co-relation 42774. Up to 8911 conditions per place. [2024-11-08 16:51:51,795 INFO L140 encePairwiseOnDemand]: 78/104 looper letters, 288 selfloop transitions, 135 changer transitions 0/473 dead transitions. [2024-11-08 16:51:51,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 473 transitions, 4249 flow [2024-11-08 16:51:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:51:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-08 16:51:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1018 transitions. [2024-11-08 16:51:51,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757918552036199 [2024-11-08 16:51:51,800 INFO L175 Difference]: Start difference. First operand has 135 places, 298 transitions, 2162 flow. Second operand 17 states and 1018 transitions. [2024-11-08 16:51:51,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 473 transitions, 4249 flow [2024-11-08 16:51:51,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 473 transitions, 4105 flow, removed 72 selfloop flow, removed 0 redundant places. [2024-11-08 16:51:51,995 INFO L231 Difference]: Finished difference. Result has 159 places, 357 transitions, 3128 flow [2024-11-08 16:51:51,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3128, PETRI_PLACES=159, PETRI_TRANSITIONS=357} [2024-11-08 16:51:51,998 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 55 predicate places. [2024-11-08 16:51:51,999 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 357 transitions, 3128 flow [2024-11-08 16:51:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 51.13636363636363) internal successors, (1125), 22 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-08 16:51:52,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:51:52,000 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:52,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:51:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:52,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:51:52,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 107275603, now seen corresponding path program 1 times [2024-11-08 16:51:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911529271] [2024-11-08 16:51:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:53,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911529271] [2024-11-08 16:51:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911529271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:51:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160904356] [2024-11-08 16:51:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:53,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:53,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:53,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:51:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:53,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 16:51:53,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:53,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:51:53,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:51:53,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:51:54,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:51:54,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 16:51:54,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 16:51:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 16:51:54,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-08 16:51:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:54,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:51:54,818 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2024-11-08 16:51:54,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_298) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-08 16:52:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 16:52:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160904356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:07,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 46 [2024-11-08 16:52:07,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459741393] [2024-11-08 16:52:07,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:07,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 16:52:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 16:52:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1752, Unknown=24, NotChecked=174, Total=2162 [2024-11-08 16:52:08,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 104 [2024-11-08 16:52:08,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 357 transitions, 3128 flow. Second operand has 47 states, 47 states have (on average 38.297872340425535) internal successors, (1800), 47 states have internal predecessors, (1800), 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-08 16:52:08,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:52:08,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 104 [2024-11-08 16:52:08,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:52:25,106 INFO L124 PetriNetUnfolderBase]: 11280/21869 cut-off events. [2024-11-08 16:52:25,106 INFO L125 PetriNetUnfolderBase]: For 44377/45999 co-relation queries the response was YES. [2024-11-08 16:52:25,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80784 conditions, 21869 events. 11280/21869 cut-off events. For 44377/45999 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 183542 event pairs, 1339 based on Foata normal form. 381/20991 useless extension candidates. Maximal degree in co-relation 65989. Up to 9003 conditions per place. [2024-11-08 16:52:25,498 INFO L140 encePairwiseOnDemand]: 69/104 looper letters, 830 selfloop transitions, 701 changer transitions 14/1586 dead transitions. [2024-11-08 16:52:25,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1586 transitions, 15313 flow [2024-11-08 16:52:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-08 16:52:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2024-11-08 16:52:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 3847 transitions. [2024-11-08 16:52:25,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43518099547511313 [2024-11-08 16:52:25,516 INFO L175 Difference]: Start difference. First operand has 159 places, 357 transitions, 3128 flow. Second operand 85 states and 3847 transitions. [2024-11-08 16:52:25,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1586 transitions, 15313 flow [2024-11-08 16:52:25,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 1586 transitions, 15243 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-08 16:52:25,971 INFO L231 Difference]: Finished difference. Result has 266 places, 1029 transitions, 11988 flow [2024-11-08 16:52:25,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=3088, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=11988, PETRI_PLACES=266, PETRI_TRANSITIONS=1029} [2024-11-08 16:52:25,973 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 162 predicate places. [2024-11-08 16:52:25,973 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 1029 transitions, 11988 flow [2024-11-08 16:52:25,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 38.297872340425535) internal successors, (1800), 47 states have internal predecessors, (1800), 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-08 16:52:25,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:52:25,975 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:26,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:26,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:52:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 32912616, now seen corresponding path program 2 times [2024-11-08 16:52:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131934456] [2024-11-08 16:52:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131934456] [2024-11-08 16:52:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131934456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430770245] [2024-11-08 16:52:27,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:52:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:52:27,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:27,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:52:27,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:52:27,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:27,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-08 16:52:27,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:27,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:52:27,546 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:52:27,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:52:28,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 16:52:28,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-08 16:52:28,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-08 16:52:28,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-08 16:52:28,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2024-11-08 16:52:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:28,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430770245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:31,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:31,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2024-11-08 16:52:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034719152] [2024-11-08 16:52:31,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:31,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-08 16:52:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 16:52:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 16:52:40,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 104 [2024-11-08 16:52:40,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 1029 transitions, 11988 flow. Second operand has 43 states, 43 states have (on average 63.883720930232556) internal successors, (2747), 43 states have internal predecessors, (2747), 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-08 16:52:40,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:52:40,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 104 [2024-11-08 16:52:40,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:52:51,069 INFO L124 PetriNetUnfolderBase]: 8793/19238 cut-off events. [2024-11-08 16:52:51,069 INFO L125 PetriNetUnfolderBase]: For 153904/155675 co-relation queries the response was YES. [2024-11-08 16:52:51,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106086 conditions, 19238 events. 8793/19238 cut-off events. For 153904/155675 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 177043 event pairs, 552 based on Foata normal form. 409/18872 useless extension candidates. Maximal degree in co-relation 100876. Up to 6655 conditions per place. [2024-11-08 16:52:51,270 INFO L140 encePairwiseOnDemand]: 77/104 looper letters, 958 selfloop transitions, 802 changer transitions 0/1864 dead transitions. [2024-11-08 16:52:51,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1864 transitions, 27247 flow [2024-11-08 16:52:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 16:52:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-11-08 16:52:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2438 transitions. [2024-11-08 16:52:51,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6697802197802197 [2024-11-08 16:52:51,279 INFO L175 Difference]: Start difference. First operand has 266 places, 1029 transitions, 11988 flow. Second operand 35 states and 2438 transitions. [2024-11-08 16:52:51,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1864 transitions, 27247 flow [2024-11-08 16:52:52,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 1864 transitions, 26364 flow, removed 420 selfloop flow, removed 13 redundant places. [2024-11-08 16:52:52,388 INFO L231 Difference]: Finished difference. Result has 300 places, 1629 transitions, 23560 flow [2024-11-08 16:52:52,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=11269, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=23560, PETRI_PLACES=300, PETRI_TRANSITIONS=1629} [2024-11-08 16:52:52,389 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 196 predicate places. [2024-11-08 16:52:52,390 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 1629 transitions, 23560 flow [2024-11-08 16:52:52,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 63.883720930232556) internal successors, (2747), 43 states have internal predecessors, (2747), 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-08 16:52:52,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:52:52,391 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:52,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:52,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 16:52:52,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:52:52,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1492926800, now seen corresponding path program 3 times [2024-11-08 16:52:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276680246] [2024-11-08 16:52:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:53,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:53,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276680246] [2024-11-08 16:52:53,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276680246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:53,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713022839] [2024-11-08 16:52:53,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 16:52:53,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:53,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:52:53,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:53,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:52:53,710 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 16:52:53,710 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:53,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:52:53,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:53,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:52:53,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:52:53,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:52:53,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 16:52:53,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-08 16:52:53,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:53,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-08 16:52:53,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:53,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-08 16:52:54,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-08 16:52:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:54,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:54,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_429 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_429 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-08 16:52:57,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_429 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-08 16:53:01,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_429 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_429 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_429 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_429) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-08 16:53:01,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:01,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-08 16:53:01,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:01,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-08 16:53:01,589 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:01,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:01,598 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:01,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:01,608 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:01,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-08 16:53:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 16:53:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713022839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:01,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:53:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-08 16:53:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972820773] [2024-11-08 16:53:01,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:01,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:53:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:53:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=238, Unknown=23, NotChecked=102, Total=420 [2024-11-08 16:53:01,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-08 16:53:01,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 1629 transitions, 23560 flow. Second operand has 21 states, 21 states have (on average 51.19047619047619) internal successors, (1075), 21 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-08 16:53:01,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:01,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-08 16:53:01,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:17,692 INFO L124 PetriNetUnfolderBase]: 15928/32763 cut-off events. [2024-11-08 16:53:17,692 INFO L125 PetriNetUnfolderBase]: For 409647/416478 co-relation queries the response was YES. [2024-11-08 16:53:17,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188798 conditions, 32763 events. 15928/32763 cut-off events. For 409647/416478 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 313905 event pairs, 3316 based on Foata normal form. 480/31482 useless extension candidates. Maximal degree in co-relation 182465. Up to 19949 conditions per place. [2024-11-08 16:53:18,088 INFO L140 encePairwiseOnDemand]: 78/104 looper letters, 1178 selfloop transitions, 583 changer transitions 0/1874 dead transitions. [2024-11-08 16:53:18,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1874 transitions, 30865 flow [2024-11-08 16:53:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:53:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-08 16:53:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1150 transitions. [2024-11-08 16:53:18,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5819838056680162 [2024-11-08 16:53:18,091 INFO L175 Difference]: Start difference. First operand has 300 places, 1629 transitions, 23560 flow. Second operand 19 states and 1150 transitions. [2024-11-08 16:53:18,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 1874 transitions, 30865 flow [2024-11-08 16:53:20,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1874 transitions, 30071 flow, removed 362 selfloop flow, removed 15 redundant places. [2024-11-08 16:53:20,797 INFO L231 Difference]: Finished difference. Result has 309 places, 1769 transitions, 27829 flow [2024-11-08 16:53:20,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=22784, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=447, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1076, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=27829, PETRI_PLACES=309, PETRI_TRANSITIONS=1769} [2024-11-08 16:53:20,799 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 205 predicate places. [2024-11-08 16:53:20,799 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 1769 transitions, 27829 flow [2024-11-08 16:53:20,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 51.19047619047619) internal successors, (1075), 21 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-08 16:53:20,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:20,800 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:53:20,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:21,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 16:53:21,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:21,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash 834281460, now seen corresponding path program 4 times [2024-11-08 16:53:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:21,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677546926] [2024-11-08 16:53:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:21,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677546926] [2024-11-08 16:53:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677546926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:53:21,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681391949] [2024-11-08 16:53:21,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 16:53:21,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:53:21,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:53:21,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:53:21,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:53:21,778 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 16:53:21,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:21,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:53:21,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:21,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:53:21,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:53:21,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:53:21,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 16:53:21,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-08 16:53:21,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:21,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-08 16:53:21,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:21,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-08 16:53:22,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-08 16:53:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:22,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:22,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_494 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_494 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_494 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_494 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))))) is different from false [2024-11-08 16:53:22,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_494 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_494 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_494 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_494 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_494) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-08 16:53:26,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:26,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-08 16:53:26,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:26,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2024-11-08 16:53:26,207 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:26,216 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:26,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:26,225 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:26,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-08 16:53:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 16:53:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681391949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:26,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:53:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-08 16:53:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058706179] [2024-11-08 16:53:26,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:26,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:53:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:53:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=266, Unknown=29, NotChecked=70, Total=420 [2024-11-08 16:53:26,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-08 16:53:26,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 1769 transitions, 27829 flow. Second operand has 21 states, 21 states have (on average 51.19047619047619) internal successors, (1075), 21 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-08 16:53:26,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:26,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-08 16:53:26,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:45,726 INFO L124 PetriNetUnfolderBase]: 17127/35361 cut-off events. [2024-11-08 16:53:45,726 INFO L125 PetriNetUnfolderBase]: For 482234/488169 co-relation queries the response was YES. [2024-11-08 16:53:46,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213143 conditions, 35361 events. 17127/35361 cut-off events. For 482234/488169 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 343213 event pairs, 3297 based on Foata normal form. 565/34069 useless extension candidates. Maximal degree in co-relation 208570. Up to 20376 conditions per place. [2024-11-08 16:53:46,327 INFO L140 encePairwiseOnDemand]: 78/104 looper letters, 1238 selfloop transitions, 896 changer transitions 0/2247 dead transitions. [2024-11-08 16:53:46,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 2247 transitions, 40764 flow [2024-11-08 16:53:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 16:53:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-08 16:53:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1214 transitions. [2024-11-08 16:53:46,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5836538461538462 [2024-11-08 16:53:46,331 INFO L175 Difference]: Start difference. First operand has 309 places, 1769 transitions, 27829 flow. Second operand 20 states and 1214 transitions. [2024-11-08 16:53:46,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 2247 transitions, 40764 flow [2024-11-08 16:53:49,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 2247 transitions, 40603 flow, removed 43 selfloop flow, removed 12 redundant places. [2024-11-08 16:53:49,418 INFO L231 Difference]: Finished difference. Result has 322 places, 2104 transitions, 37528 flow [2024-11-08 16:53:49,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=27668, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=598, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=37528, PETRI_PLACES=322, PETRI_TRANSITIONS=2104} [2024-11-08 16:53:49,420 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 218 predicate places. [2024-11-08 16:53:49,420 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 2104 transitions, 37528 flow [2024-11-08 16:53:49,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 51.19047619047619) internal successors, (1075), 21 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-08 16:53:49,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:49,421 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:53:49,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:49,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 16:53:49,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash 357414516, now seen corresponding path program 5 times [2024-11-08 16:53:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353226037] [2024-11-08 16:53:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:49,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353226037] [2024-11-08 16:53:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353226037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:53:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781475094] [2024-11-08 16:53:50,223 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 16:53:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:53:50,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:53:50,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:53:50,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_882cf91d-3266-4691-98d3-25f60fdef445/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 16:53:50,342 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:53:50,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:50,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:53:50,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:50,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:53:50,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:53:50,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:53:50,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 16:53:50,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-08 16:53:50,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:50,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-08 16:53:50,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:50,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-08 16:53:50,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-08 16:53:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:50,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:50,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-08 16:53:50,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_559 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2024-11-08 16:53:50,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_559 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_559) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-11-08 16:53:50,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:50,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-08 16:53:50,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:53:50,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-11-08 16:53:50,938 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:50,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:50,946 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:50,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:50,953 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-08 16:53:50,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-08 16:53:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 16:53:51,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781475094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:51,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:53:51,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-08 16:53:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991038077] [2024-11-08 16:53:51,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:51,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 16:53:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:51,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 16:53:51,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=252, Unknown=14, NotChecked=102, Total=420 [2024-11-08 16:53:51,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-11-08 16:53:51,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2104 transitions, 37528 flow. Second operand has 21 states, 21 states have (on average 51.19047619047619) internal successors, (1075), 21 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-08 16:53:51,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:51,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-11-08 16:53:51,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand