./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 0e0057cc 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_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/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_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 00:45:12,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:45:12,293 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:45:12,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:45:12,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:45:12,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:45:12,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:45:12,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:45:12,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:45:12,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:45:12,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:45:12,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:45:12,326 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:45:12,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:45:12,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:45:12,327 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:45:12,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:45:12,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:45:12,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:45:12,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:45:12,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:45:12,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:45:12,333 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:45:12,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:45:12,334 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:45:12,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:45:12,335 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:45:12,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:45:12,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:45:12,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:45:12,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:45:12,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:45:12,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:45:12,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:45:12,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:45:12,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:45:12,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:45:12,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:45:12,338 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:45:12,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:45:12,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:45:12,339 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_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/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_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 00:45:12,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:45:12,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:45:12,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:45:12,575 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:45:12,576 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:45:12,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i [2023-11-29 00:45:15,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:45:15,643 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:45:15,644 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i [2023-11-29 00:45:15,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/data/8bdf7d67c/25fc848a892343a9bcc9dc7acad51c30/FLAGa0782f5fb [2023-11-29 00:45:15,673 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/data/8bdf7d67c/25fc848a892343a9bcc9dc7acad51c30 [2023-11-29 00:45:15,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:45:15,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:45:15,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:45:15,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:45:15,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:45:15,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:45:15" (1/1) ... [2023-11-29 00:45:15,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd040e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:15, skipping insertion in model container [2023-11-29 00:45:15,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:45:15" (1/1) ... [2023-11-29 00:45:15,731 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:45:16,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:45:16,120 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:45:16,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:45:16,209 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:45:16,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16 WrapperNode [2023-11-29 00:45:16,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:45:16,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:45:16,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:45:16,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:45:16,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,264 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-29 00:45:16,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:45:16,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:45:16,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:45:16,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:45:16,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:45:16,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:45:16,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:45:16,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:45:16,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (1/1) ... [2023-11-29 00:45:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:45:16,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:16,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:45:16,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:45:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:45:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 00:45:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:45:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 00:45:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:45:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:45:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:45:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 00:45:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 00:45:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:45:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:45:16,368 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:45:16,500 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:45:16,502 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:45:16,800 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:45:16,811 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:45:16,811 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:45:16,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:45:16 BoogieIcfgContainer [2023-11-29 00:45:16,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:45:16,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:45:16,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:45:16,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:45:16,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:45:15" (1/3) ... [2023-11-29 00:45:16,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f01109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:45:16, skipping insertion in model container [2023-11-29 00:45:16,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:45:16" (2/3) ... [2023-11-29 00:45:16,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f01109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:45:16, skipping insertion in model container [2023-11-29 00:45:16,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:45:16" (3/3) ... [2023-11-29 00:45:16,822 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i [2023-11-29 00:45:16,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:45:16,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:45:16,841 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-29 00:45:16,842 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:45:16,902 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 00:45:16,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-29 00:45:17,007 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-29 00:45:17,007 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:45:17,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 382 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-29 00:45:17,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow [2023-11-29 00:45:17,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow [2023-11-29 00:45:17,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:45:17,035 INFO L357 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, mHoare=true, 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;@3fd2a191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:45:17,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-29 00:45:17,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:45:17,045 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-29 00:45:17,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:45:17,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:17,046 INFO L208 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] [2023-11-29 00:45:17,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:17,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash 578939384, now seen corresponding path program 1 times [2023-11-29 00:45:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:17,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296540312] [2023-11-29 00:45:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296540312] [2023-11-29 00:45:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296540312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:17,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:17,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381099465] [2023-11-29 00:45:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:17,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:17,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:18,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2023-11-29 00:45:18,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2023-11-29 00:45:18,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:18,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2023-11-29 00:45:18,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:18,450 INFO L124 PetriNetUnfolderBase]: 81/497 cut-off events. [2023-11-29 00:45:18,450 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-11-29 00:45:18,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 497 events. 81/497 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2288 event pairs, 6 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 591. Up to 140 conditions per place. [2023-11-29 00:45:18,456 INFO L140 encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions. [2023-11-29 00:45:18,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow [2023-11-29 00:45:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-11-29 00:45:18,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2023-11-29 00:45:18,475 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-11-29 00:45:18,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-11-29 00:45:18,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:18,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-11-29 00:45:18,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:18,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:18,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:18,497 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions. [2023-11-29 00:45:18,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow [2023-11-29 00:45:18,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:45:18,508 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow [2023-11-29 00:45:18,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2023-11-29 00:45:18,514 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2023-11-29 00:45:18,514 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow [2023-11-29 00:45:18,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2023-11-29 00:45:18,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:18,515 INFO L208 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] [2023-11-29 00:45:18,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:45:18,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:18,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2012313278, now seen corresponding path program 1 times [2023-11-29 00:45:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:18,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473171253] [2023-11-29 00:45:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473171253] [2023-11-29 00:45:18,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473171253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:18,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837836148] [2023-11-29 00:45:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:18,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:45:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:45:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:45:18,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122 [2023-11-29 00:45:18,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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) [2023-11-29 00:45:18,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:18,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122 [2023-11-29 00:45:18,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:18,811 INFO L124 PetriNetUnfolderBase]: 59/485 cut-off events. [2023-11-29 00:45:18,811 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 00:45:18,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 485 events. 59/485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2126 event pairs, 3 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 609. Up to 73 conditions per place. [2023-11-29 00:45:18,817 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions. [2023-11-29 00:45:18,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow [2023-11-29 00:45:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-11-29 00:45:18,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.894808743169399 [2023-11-29 00:45:18,820 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-11-29 00:45:18,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-11-29 00:45:18,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:18,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-11-29 00:45:18,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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) [2023-11-29 00:45:18,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:18,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:18,827 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions. [2023-11-29 00:45:18,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow [2023-11-29 00:45:18,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:45:18,836 INFO L231 Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow [2023-11-29 00:45:18,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=139, PETRI_TRANSITIONS=146} [2023-11-29 00:45:18,838 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places. [2023-11-29 00:45:18,838 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow [2023-11-29 00:45:18,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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) [2023-11-29 00:45:18,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:18,839 INFO L208 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] [2023-11-29 00:45:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:45:18,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:18,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1180280619, now seen corresponding path program 1 times [2023-11-29 00:45:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344638246] [2023-11-29 00:45:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:19,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:19,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344638246] [2023-11-29 00:45:19,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344638246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:19,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190462045] [2023-11-29 00:45:19,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:19,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:19,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2023-11-29 00:45:19,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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) [2023-11-29 00:45:19,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:19,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2023-11-29 00:45:19,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:19,649 INFO L124 PetriNetUnfolderBase]: 207/964 cut-off events. [2023-11-29 00:45:19,649 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-11-29 00:45:19,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 964 events. 207/964 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6054 event pairs, 9 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1814. Up to 294 conditions per place. [2023-11-29 00:45:19,657 INFO L140 encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions. [2023-11-29 00:45:19,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow [2023-11-29 00:45:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2023-11-29 00:45:19,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-29 00:45:19,659 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2023-11-29 00:45:19,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2023-11-29 00:45:19,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:19,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2023-11-29 00:45:19,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 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) [2023-11-29 00:45:19,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:19,665 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:19,665 INFO L175 Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions. [2023-11-29 00:45:19,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow [2023-11-29 00:45:19,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:45:19,674 INFO L231 Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow [2023-11-29 00:45:19,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=148, PETRI_TRANSITIONS=192} [2023-11-29 00:45:19,675 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places. [2023-11-29 00:45:19,675 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow [2023-11-29 00:45:19,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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) [2023-11-29 00:45:19,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:19,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:19,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:45:19,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:19,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -396544275, now seen corresponding path program 1 times [2023-11-29 00:45:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530110417] [2023-11-29 00:45:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530110417] [2023-11-29 00:45:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530110417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562132024] [2023-11-29 00:45:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:20,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:20,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122 [2023-11-29 00:45:20,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 192 transitions, 919 flow. Second operand has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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) [2023-11-29 00:45:20,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:20,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122 [2023-11-29 00:45:20,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:20,600 INFO L124 PetriNetUnfolderBase]: 589/1951 cut-off events. [2023-11-29 00:45:20,600 INFO L125 PetriNetUnfolderBase]: For 1487/1604 co-relation queries the response was YES. [2023-11-29 00:45:20,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5160 conditions, 1951 events. 589/1951 cut-off events. For 1487/1604 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14467 event pairs, 97 based on Foata normal form. 20/1866 useless extension candidates. Maximal degree in co-relation 4918. Up to 1020 conditions per place. [2023-11-29 00:45:20,613 INFO L140 encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 120 changer transitions 6/314 dead transitions. [2023-11-29 00:45:20,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow [2023-11-29 00:45:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-11-29 00:45:20,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2023-11-29 00:45:20,617 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-11-29 00:45:20,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-11-29 00:45:20,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:20,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-11-29 00:45:20,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:20,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:20,621 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:20,621 INFO L175 Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions. [2023-11-29 00:45:20,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow [2023-11-29 00:45:20,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:45:20,667 INFO L231 Difference]: Finished difference. Result has 151 places, 308 transitions, 2003 flow [2023-11-29 00:45:20,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2003, PETRI_PLACES=151, PETRI_TRANSITIONS=308} [2023-11-29 00:45:20,669 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places. [2023-11-29 00:45:20,669 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 308 transitions, 2003 flow [2023-11-29 00:45:20,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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) [2023-11-29 00:45:20,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:20,670 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:20,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:45:20,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:20,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1434386381, now seen corresponding path program 1 times [2023-11-29 00:45:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:20,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650608131] [2023-11-29 00:45:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650608131] [2023-11-29 00:45:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650608131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873206730] [2023-11-29 00:45:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:21,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:21,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:21,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:45:21,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:45:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:21,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 00:45:21,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:21,467 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 [2023-11-29 00:45:21,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:45:21,503 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 [2023-11-29 00:45:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 00:45:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 00:45:21,854 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 [2023-11-29 00:45:21,895 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 [2023-11-29 00:45:21,946 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 [2023-11-29 00:45:22,009 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 [2023-11-29 00:45:22,244 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 [2023-11-29 00:45:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:22,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:22,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-29 00:45:22,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-29 00:45:22,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:45:22,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:45:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:22,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873206730] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:45:22,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:45:22,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 30 [2023-11-29 00:45:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709062728] [2023-11-29 00:45:22,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:22,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:45:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:45:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=701, Unknown=10, NotChecked=110, Total=930 [2023-11-29 00:45:23,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 122 [2023-11-29 00:45:23,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 308 transitions, 2003 flow. Second operand has 31 states, 31 states have (on average 43.806451612903224) internal successors, (1358), 31 states have internal predecessors, (1358), 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) [2023-11-29 00:45:23,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:23,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 122 [2023-11-29 00:45:23,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:26,965 INFO L124 PetriNetUnfolderBase]: 1192/3060 cut-off events. [2023-11-29 00:45:26,965 INFO L125 PetriNetUnfolderBase]: For 4445/4447 co-relation queries the response was YES. [2023-11-29 00:45:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10654 conditions, 3060 events. 1192/3060 cut-off events. For 4445/4447 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 21564 event pairs, 166 based on Foata normal form. 41/3064 useless extension candidates. Maximal degree in co-relation 10365. Up to 1030 conditions per place. [2023-11-29 00:45:26,993 INFO L140 encePairwiseOnDemand]: 86/122 looper letters, 431 selfloop transitions, 177 changer transitions 51/700 dead transitions. [2023-11-29 00:45:26,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 700 transitions, 5343 flow [2023-11-29 00:45:26,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 00:45:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-29 00:45:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1761 transitions. [2023-11-29 00:45:27,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4510758196721312 [2023-11-29 00:45:27,002 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 1761 transitions. [2023-11-29 00:45:27,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 1761 transitions. [2023-11-29 00:45:27,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:27,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 1761 transitions. [2023-11-29 00:45:27,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 55.03125) internal successors, (1761), 32 states have internal predecessors, (1761), 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) [2023-11-29 00:45:27,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 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) [2023-11-29 00:45:27,019 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 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) [2023-11-29 00:45:27,019 INFO L175 Difference]: Start difference. First operand has 151 places, 308 transitions, 2003 flow. Second operand 32 states and 1761 transitions. [2023-11-29 00:45:27,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 700 transitions, 5343 flow [2023-11-29 00:45:27,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 700 transitions, 5253 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-11-29 00:45:27,077 INFO L231 Difference]: Finished difference. Result has 196 places, 386 transitions, 3207 flow [2023-11-29 00:45:27,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3207, PETRI_PLACES=196, PETRI_TRANSITIONS=386} [2023-11-29 00:45:27,078 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places. [2023-11-29 00:45:27,079 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 386 transitions, 3207 flow [2023-11-29 00:45:27,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 43.806451612903224) internal successors, (1358), 31 states have internal predecessors, (1358), 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) [2023-11-29 00:45:27,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:27,080 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:27,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:45:27,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:27,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:27,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash -856421357, now seen corresponding path program 1 times [2023-11-29 00:45:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:27,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30821675] [2023-11-29 00:45:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30821675] [2023-11-29 00:45:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30821675] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989297142] [2023-11-29 00:45:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:27,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:27,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:45:27,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:45:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:28,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 00:45:28,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:28,026 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 [2023-11-29 00:45:28,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:45:28,054 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 [2023-11-29 00:45:28,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 00:45:28,273 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 [2023-11-29 00:45:28,305 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 [2023-11-29 00:45:28,346 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 [2023-11-29 00:45:28,400 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 [2023-11-29 00:45:28,459 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 [2023-11-29 00:45:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:28,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:28,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false [2023-11-29 00:45:28,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false [2023-11-29 00:45:28,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:45:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:45:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989297142] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:45:28,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:45:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-11-29 00:45:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054744863] [2023-11-29 00:45:28,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 00:45:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 00:45:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=645, Unknown=12, NotChecked=106, Total=870 [2023-11-29 00:45:29,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122 [2023-11-29 00:45:29,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 386 transitions, 3207 flow. Second operand has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 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) [2023-11-29 00:45:29,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:29,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122 [2023-11-29 00:45:29,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:30,817 INFO L124 PetriNetUnfolderBase]: 935/2599 cut-off events. [2023-11-29 00:45:30,817 INFO L125 PetriNetUnfolderBase]: For 8750/8750 co-relation queries the response was YES. [2023-11-29 00:45:30,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11083 conditions, 2599 events. 935/2599 cut-off events. For 8750/8750 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 18637 event pairs, 193 based on Foata normal form. 25/2570 useless extension candidates. Maximal degree in co-relation 10763. Up to 1249 conditions per place. [2023-11-29 00:45:30,839 INFO L140 encePairwiseOnDemand]: 107/122 looper letters, 378 selfloop transitions, 34 changer transitions 28/493 dead transitions. [2023-11-29 00:45:30,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 493 transitions, 4661 flow [2023-11-29 00:45:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:45:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-29 00:45:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions. [2023-11-29 00:45:30,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49544626593806923 [2023-11-29 00:45:30,865 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions. [2023-11-29 00:45:30,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions. [2023-11-29 00:45:30,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:30,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions. [2023-11-29 00:45:30,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 60.44444444444444) internal successors, (1088), 18 states have internal predecessors, (1088), 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) [2023-11-29 00:45:30,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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) [2023-11-29 00:45:30,874 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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) [2023-11-29 00:45:30,875 INFO L175 Difference]: Start difference. First operand has 196 places, 386 transitions, 3207 flow. Second operand 18 states and 1088 transitions. [2023-11-29 00:45:30,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 493 transitions, 4661 flow [2023-11-29 00:45:30,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 493 transitions, 4607 flow, removed 9 selfloop flow, removed 10 redundant places. [2023-11-29 00:45:30,949 INFO L231 Difference]: Finished difference. Result has 200 places, 370 transitions, 3051 flow [2023-11-29 00:45:30,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3149, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=200, PETRI_TRANSITIONS=370} [2023-11-29 00:45:30,951 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places. [2023-11-29 00:45:30,951 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 370 transitions, 3051 flow [2023-11-29 00:45:30,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 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) [2023-11-29 00:45:30,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:30,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:30,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:45:31,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 00:45:31,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:31,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1234583565, now seen corresponding path program 1 times [2023-11-29 00:45:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:31,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899836702] [2023-11-29 00:45:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:45:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899836702] [2023-11-29 00:45:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899836702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658379110] [2023-11-29 00:45:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:31,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:31,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2023-11-29 00:45:31,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 370 transitions, 3051 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-29 00:45:31,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:31,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2023-11-29 00:45:31,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:32,066 INFO L124 PetriNetUnfolderBase]: 520/1890 cut-off events. [2023-11-29 00:45:32,066 INFO L125 PetriNetUnfolderBase]: For 6305/6356 co-relation queries the response was YES. [2023-11-29 00:45:32,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1890 events. 520/1890 cut-off events. For 6305/6356 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14552 event pairs, 42 based on Foata normal form. 5/1873 useless extension candidates. Maximal degree in co-relation 7163. Up to 474 conditions per place. [2023-11-29 00:45:32,081 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 120 selfloop transitions, 37 changer transitions 15/410 dead transitions. [2023-11-29 00:45:32,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 410 transitions, 3815 flow [2023-11-29 00:45:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-11-29 00:45:32,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8770491803278688 [2023-11-29 00:45:32,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-11-29 00:45:32,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-11-29 00:45:32,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:32,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-11-29 00:45:32,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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) [2023-11-29 00:45:32,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:32,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 00:45:32,087 INFO L175 Difference]: Start difference. First operand has 200 places, 370 transitions, 3051 flow. Second operand 6 states and 642 transitions. [2023-11-29 00:45:32,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 410 transitions, 3815 flow [2023-11-29 00:45:32,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 410 transitions, 3748 flow, removed 1 selfloop flow, removed 16 redundant places. [2023-11-29 00:45:32,128 INFO L231 Difference]: Finished difference. Result has 194 places, 395 transitions, 3496 flow [2023-11-29 00:45:32,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2984, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3496, PETRI_PLACES=194, PETRI_TRANSITIONS=395} [2023-11-29 00:45:32,129 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places. [2023-11-29 00:45:32,129 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 395 transitions, 3496 flow [2023-11-29 00:45:32,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-29 00:45:32,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:32,129 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-29 00:45:32,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:45:32,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 00:45:32,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash -767136527, now seen corresponding path program 1 times [2023-11-29 00:45:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964891198] [2023-11-29 00:45:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:45:32,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:45:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:45:32,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:45:32,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:45:32,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-29 00:45:32,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-29 00:45:32,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-29 00:45:32,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:45:32,215 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:32,217 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:45:32,217 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:45:32,238 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 00:45:32,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow [2023-11-29 00:45:32,268 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2023-11-29 00:45:32,268 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 00:45:32,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 764 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. [2023-11-29 00:45:32,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow [2023-11-29 00:45:32,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow [2023-11-29 00:45:32,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:45:32,281 INFO L357 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, mHoare=true, 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;@3fd2a191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:45:32,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 00:45:32,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:45:32,285 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-29 00:45:32,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:45:32,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:32,286 INFO L208 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] [2023-11-29 00:45:32,286 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:45:32,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2078961544, now seen corresponding path program 1 times [2023-11-29 00:45:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881483577] [2023-11-29 00:45:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881483577] [2023-11-29 00:45:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881483577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277097920] [2023-11-29 00:45:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:32,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:32,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:32,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2023-11-29 00:45:32,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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) [2023-11-29 00:45:32,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:32,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2023-11-29 00:45:32,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:33,192 INFO L124 PetriNetUnfolderBase]: 1139/4013 cut-off events. [2023-11-29 00:45:33,192 INFO L125 PetriNetUnfolderBase]: For 115/203 co-relation queries the response was YES. [2023-11-29 00:45:33,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 115/203 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31909 event pairs, 192 based on Foata normal form. 74/3754 useless extension candidates. Maximal degree in co-relation 2969. Up to 1538 conditions per place. [2023-11-29 00:45:33,215 INFO L140 encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions. [2023-11-29 00:45:33,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow [2023-11-29 00:45:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-11-29 00:45:33,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2023-11-29 00:45:33,218 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-11-29 00:45:33,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-11-29 00:45:33,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:33,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-11-29 00:45:33,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 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) [2023-11-29 00:45:33,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:33,222 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:33,222 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions. [2023-11-29 00:45:33,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow [2023-11-29 00:45:33,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:45:33,225 INFO L231 Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow [2023-11-29 00:45:33,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=150, PETRI_TRANSITIONS=179} [2023-11-29 00:45:33,226 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places. [2023-11-29 00:45:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow [2023-11-29 00:45:33,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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) [2023-11-29 00:45:33,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:33,227 INFO L208 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] [2023-11-29 00:45:33,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:45:33,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:45:33,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1521651250, now seen corresponding path program 1 times [2023-11-29 00:45:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356856731] [2023-11-29 00:45:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356856731] [2023-11-29 00:45:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356856731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:33,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:33,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760548592] [2023-11-29 00:45:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:33,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:45:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:45:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:45:33,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140 [2023-11-29 00:45:33,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 179 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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) [2023-11-29 00:45:33,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:33,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140 [2023-11-29 00:45:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:33,713 INFO L124 PetriNetUnfolderBase]: 890/3527 cut-off events. [2023-11-29 00:45:33,713 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2023-11-29 00:45:33,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3527 events. 890/3527 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28422 event pairs, 150 based on Foata normal form. 1/3305 useless extension candidates. Maximal degree in co-relation 3349. Up to 983 conditions per place. [2023-11-29 00:45:33,731 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2023-11-29 00:45:33,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow [2023-11-29 00:45:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-11-29 00:45:33,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8976190476190476 [2023-11-29 00:45:33,735 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-11-29 00:45:33,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-11-29 00:45:33,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:33,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-11-29 00:45:33,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-29 00:45:33,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:33,739 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:33,739 INFO L175 Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions. [2023-11-29 00:45:33,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow [2023-11-29 00:45:33,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:45:33,744 INFO L231 Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow [2023-11-29 00:45:33,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=158, PETRI_TRANSITIONS=184} [2023-11-29 00:45:33,746 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places. [2023-11-29 00:45:33,746 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow [2023-11-29 00:45:33,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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) [2023-11-29 00:45:33,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:33,747 INFO L208 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] [2023-11-29 00:45:33,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:45:33,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:45:33,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash -789065557, now seen corresponding path program 1 times [2023-11-29 00:45:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940555596] [2023-11-29 00:45:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940555596] [2023-11-29 00:45:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940555596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:33,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462717934] [2023-11-29 00:45:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:33,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:33,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:33,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:34,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2023-11-29 00:45:34,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:34,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:34,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2023-11-29 00:45:34,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:35,361 INFO L124 PetriNetUnfolderBase]: 3173/8712 cut-off events. [2023-11-29 00:45:35,362 INFO L125 PetriNetUnfolderBase]: For 4361/4372 co-relation queries the response was YES. [2023-11-29 00:45:35,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19457 conditions, 8712 events. 3173/8712 cut-off events. For 4361/4372 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76112 event pairs, 410 based on Foata normal form. 7/8207 useless extension candidates. Maximal degree in co-relation 19323. Up to 3775 conditions per place. [2023-11-29 00:45:35,402 INFO L140 encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions. [2023-11-29 00:45:35,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow [2023-11-29 00:45:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-11-29 00:45:35,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2023-11-29 00:45:35,405 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-11-29 00:45:35,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-11-29 00:45:35,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:35,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-11-29 00:45:35,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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) [2023-11-29 00:45:35,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:35,409 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:35,409 INFO L175 Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions. [2023-11-29 00:45:35,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow [2023-11-29 00:45:35,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:45:35,419 INFO L231 Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow [2023-11-29 00:45:35,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=284} [2023-11-29 00:45:35,420 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places. [2023-11-29 00:45:35,420 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow [2023-11-29 00:45:35,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:35,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:35,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:35,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:45:35,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:45:35,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -468383767, now seen corresponding path program 1 times [2023-11-29 00:45:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:35,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541679200] [2023-11-29 00:45:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541679200] [2023-11-29 00:45:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541679200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:45:35,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:45:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:45:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970697595] [2023-11-29 00:45:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:45:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:45:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:35,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:45:35,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:45:35,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2023-11-29 00:45:35,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 284 transitions, 1638 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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) [2023-11-29 00:45:35,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:35,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2023-11-29 00:45:35,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:38,695 INFO L124 PetriNetUnfolderBase]: 8581/20124 cut-off events. [2023-11-29 00:45:38,695 INFO L125 PetriNetUnfolderBase]: For 22364/24762 co-relation queries the response was YES. [2023-11-29 00:45:38,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58964 conditions, 20124 events. 8581/20124 cut-off events. For 22364/24762 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 190622 event pairs, 1832 based on Foata normal form. 70/19104 useless extension candidates. Maximal degree in co-relation 20664. Up to 11835 conditions per place. [2023-11-29 00:45:38,908 INFO L140 encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions. [2023-11-29 00:45:38,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow [2023-11-29 00:45:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:45:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:45:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-11-29 00:45:38,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8845238095238095 [2023-11-29 00:45:38,912 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-11-29 00:45:38,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-11-29 00:45:38,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:38,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-11-29 00:45:38,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 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) [2023-11-29 00:45:38,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:38,917 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:45:38,917 INFO L175 Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions. [2023-11-29 00:45:38,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow [2023-11-29 00:45:38,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 00:45:38,968 INFO L231 Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow [2023-11-29 00:45:38,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4284, PETRI_PLACES=171, PETRI_TRANSITIONS=517} [2023-11-29 00:45:38,970 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places. [2023-11-29 00:45:38,970 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow [2023-11-29 00:45:38,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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) [2023-11-29 00:45:38,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:38,971 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:38,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:45:38,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:45:38,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1146121371, now seen corresponding path program 1 times [2023-11-29 00:45:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314457180] [2023-11-29 00:45:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:39,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314457180] [2023-11-29 00:45:39,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314457180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:39,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628302760] [2023-11-29 00:45:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:39,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:45:39,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:45:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:39,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 00:45:39,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:39,570 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 [2023-11-29 00:45:39,580 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:45:39,580 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 [2023-11-29 00:45:39,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 00:45:39,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:45:39,856 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 [2023-11-29 00:45:39,893 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 [2023-11-29 00:45:39,932 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 [2023-11-29 00:45:39,980 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 30 treesize of output 21 [2023-11-29 00:45:40,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:45:40,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:45:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:40,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:40,067 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-29 00:45:40,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (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_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2023-11-29 00:45:40,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:45:40,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:45:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:45:40,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628302760] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:45:40,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:45:40,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2023-11-29 00:45:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616818566] [2023-11-29 00:45:40,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:40,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 00:45:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 00:45:40,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=615, Unknown=2, NotChecked=102, Total=812 [2023-11-29 00:45:40,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140 [2023-11-29 00:45:40,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand has 29 states, 29 states have (on average 53.724137931034484) internal successors, (1558), 29 states have internal predecessors, (1558), 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) [2023-11-29 00:45:40,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:40,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140 [2023-11-29 00:45:40,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:52,052 INFO L124 PetriNetUnfolderBase]: 28923/54633 cut-off events. [2023-11-29 00:45:52,052 INFO L125 PetriNetUnfolderBase]: For 97648/97659 co-relation queries the response was YES. [2023-11-29 00:45:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191087 conditions, 54633 events. 28923/54633 cut-off events. For 97648/97659 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 512600 event pairs, 3533 based on Foata normal form. 365/52462 useless extension candidates. Maximal degree in co-relation 154238. Up to 22273 conditions per place. [2023-11-29 00:45:52,619 INFO L140 encePairwiseOnDemand]: 100/140 looper letters, 894 selfloop transitions, 672 changer transitions 3/1620 dead transitions. [2023-11-29 00:45:52,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1620 transitions, 16072 flow [2023-11-29 00:45:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 00:45:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-29 00:45:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2291 transitions. [2023-11-29 00:45:52,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958874458874459 [2023-11-29 00:45:52,626 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2291 transitions. [2023-11-29 00:45:52,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2291 transitions. [2023-11-29 00:45:52,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:45:52,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2291 transitions. [2023-11-29 00:45:52,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 69.42424242424242) internal successors, (2291), 33 states have internal predecessors, (2291), 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) [2023-11-29 00:45:52,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 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) [2023-11-29 00:45:52,639 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 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) [2023-11-29 00:45:52,639 INFO L175 Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 33 states and 2291 transitions. [2023-11-29 00:45:52,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1620 transitions, 16072 flow [2023-11-29 00:45:53,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1620 transitions, 15982 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-11-29 00:45:53,846 INFO L231 Difference]: Finished difference. Result has 225 places, 1106 transitions, 13135 flow [2023-11-29 00:45:53,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=13135, PETRI_PLACES=225, PETRI_TRANSITIONS=1106} [2023-11-29 00:45:53,847 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 85 predicate places. [2023-11-29 00:45:53,847 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 1106 transitions, 13135 flow [2023-11-29 00:45:53,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 53.724137931034484) internal successors, (1558), 29 states have internal predecessors, (1558), 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) [2023-11-29 00:45:53,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:45:53,848 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:53,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:45:54,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 00:45:54,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:45:54,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:54,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1286787851, now seen corresponding path program 1 times [2023-11-29 00:45:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:45:54,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739150786] [2023-11-29 00:45:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:45:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:45:54,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739150786] [2023-11-29 00:45:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739150786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:54,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641063866] [2023-11-29 00:45:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:45:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:45:54,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:45:54,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:45:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:54,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 00:45:54,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:54,680 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 [2023-11-29 00:45:54,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:45:54,706 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 [2023-11-29 00:45:54,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 00:45:54,878 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 [2023-11-29 00:45:54,904 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 [2023-11-29 00:45:54,937 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 [2023-11-29 00:45:54,978 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 [2023-11-29 00:45:55,099 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 [2023-11-29 00:45:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:55,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:55,154 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))) is different from false [2023-11-29 00:45:55,207 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false [2023-11-29 00:45:55,221 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false [2023-11-29 00:45:55,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false [2023-11-29 00:45:55,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:45:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:45:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641063866] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:45:55,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:45:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-11-29 00:45:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611460806] [2023-11-29 00:45:55,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:55,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:45:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:45:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=605, Unknown=4, NotChecked=212, Total=930 [2023-11-29 00:45:55,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140 [2023-11-29 00:45:55,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1106 transitions, 13135 flow. Second operand has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 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) [2023-11-29 00:45:55,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:55,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140 [2023-11-29 00:45:55,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:46:11,520 INFO L124 PetriNetUnfolderBase]: 28653/54757 cut-off events. [2023-11-29 00:46:11,520 INFO L125 PetriNetUnfolderBase]: For 222538/222596 co-relation queries the response was YES. [2023-11-29 00:46:11,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241163 conditions, 54757 events. 28653/54757 cut-off events. For 222538/222596 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 510605 event pairs, 4412 based on Foata normal form. 168/52066 useless extension candidates. Maximal degree in co-relation 235951. Up to 17675 conditions per place. [2023-11-29 00:46:12,072 INFO L140 encePairwiseOnDemand]: 108/140 looper letters, 1158 selfloop transitions, 777 changer transitions 0/2003 dead transitions. [2023-11-29 00:46:12,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2003 transitions, 25951 flow [2023-11-29 00:46:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 00:46:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 00:46:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2136 transitions. [2023-11-29 00:46:12,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448979591836735 [2023-11-29 00:46:12,076 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2136 transitions. [2023-11-29 00:46:12,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2136 transitions. [2023-11-29 00:46:12,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:46:12,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2136 transitions. [2023-11-29 00:46:12,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 76.28571428571429) internal successors, (2136), 28 states have internal predecessors, (2136), 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) [2023-11-29 00:46:12,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 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) [2023-11-29 00:46:12,085 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 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) [2023-11-29 00:46:12,086 INFO L175 Difference]: Start difference. First operand has 225 places, 1106 transitions, 13135 flow. Second operand 28 states and 2136 transitions. [2023-11-29 00:46:12,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2003 transitions, 25951 flow [2023-11-29 00:46:16,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2003 transitions, 25840 flow, removed 50 selfloop flow, removed 5 redundant places. [2023-11-29 00:46:16,459 INFO L231 Difference]: Finished difference. Result has 264 places, 1478 transitions, 21494 flow [2023-11-29 00:46:16,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=13025, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=21494, PETRI_PLACES=264, PETRI_TRANSITIONS=1478} [2023-11-29 00:46:16,460 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places. [2023-11-29 00:46:16,460 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1478 transitions, 21494 flow [2023-11-29 00:46:16,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 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) [2023-11-29 00:46:16,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:46:16,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:16,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:46:16,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 00:46:16,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:46:16,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash 429703151, now seen corresponding path program 1 times [2023-11-29 00:46:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:16,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706585953] [2023-11-29 00:46:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:46:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706585953] [2023-11-29 00:46:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706585953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:46:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:46:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:46:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552058867] [2023-11-29 00:46:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:46:16,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:46:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:46:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:46:17,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2023-11-29 00:46:17,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1478 transitions, 21494 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2023-11-29 00:46:17,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:46:17,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2023-11-29 00:46:17,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:46:24,453 INFO L124 PetriNetUnfolderBase]: 11894/27937 cut-off events. [2023-11-29 00:46:24,453 INFO L125 PetriNetUnfolderBase]: For 175174/176871 co-relation queries the response was YES. [2023-11-29 00:46:24,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136561 conditions, 27937 events. 11894/27937 cut-off events. For 175174/176871 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 274247 event pairs, 925 based on Foata normal form. 228/27279 useless extension candidates. Maximal degree in co-relation 135147. Up to 10889 conditions per place. [2023-11-29 00:46:25,150 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 1122 selfloop transitions, 180 changer transitions 0/1655 dead transitions. [2023-11-29 00:46:25,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1655 transitions, 26585 flow [2023-11-29 00:46:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:46:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:46:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-11-29 00:46:25,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8773809523809524 [2023-11-29 00:46:25,152 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-11-29 00:46:25,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-11-29 00:46:25,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:46:25,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-11-29 00:46:25,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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) [2023-11-29 00:46:25,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:46:25,156 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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) [2023-11-29 00:46:25,156 INFO L175 Difference]: Start difference. First operand has 264 places, 1478 transitions, 21494 flow. Second operand 6 states and 737 transitions. [2023-11-29 00:46:25,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1655 transitions, 26585 flow [2023-11-29 00:46:27,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1655 transitions, 26190 flow, removed 173 selfloop flow, removed 10 redundant places. [2023-11-29 00:46:27,579 INFO L231 Difference]: Finished difference. Result has 264 places, 1653 transitions, 24421 flow [2023-11-29 00:46:27,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21099, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24421, PETRI_PLACES=264, PETRI_TRANSITIONS=1653} [2023-11-29 00:46:27,580 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places. [2023-11-29 00:46:27,581 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1653 transitions, 24421 flow [2023-11-29 00:46:27,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2023-11-29 00:46:27,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:46:27,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:27,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:46:27,581 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:46:27,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash -304460334, now seen corresponding path program 1 times [2023-11-29 00:46:27,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:27,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788238165] [2023-11-29 00:46:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:46:28,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:28,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788238165] [2023-11-29 00:46:28,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788238165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:46:28,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678203397] [2023-11-29 00:46:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:28,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:46:28,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:46:28,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:46:28,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:46:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:28,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 00:46:28,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:46:28,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:46:28,833 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:46:28,872 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 19 treesize of output 18 [2023-11-29 00:46:28,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 [2023-11-29 00:46:28,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 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 [2023-11-29 00:46:29,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:46:29,017 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 [2023-11-29 00:46:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:46:29,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:46:29,073 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-29 00:46:29,088 WARN L854 $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_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2023-11-29 00:46:29,105 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-29 00:46:29,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 00:46:29,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:46:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:46:29,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678203397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:46:29,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:46:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 41 [2023-11-29 00:46:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688132446] [2023-11-29 00:46:29,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 00:46:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 00:46:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1337, Unknown=3, NotChecked=228, Total=1722 [2023-11-29 00:46:29,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 140 [2023-11-29 00:46:29,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1653 transitions, 24421 flow. Second operand has 42 states, 42 states have (on average 45.11904761904762) internal successors, (1895), 42 states have internal predecessors, (1895), 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) [2023-11-29 00:46:29,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:46:29,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 140 [2023-11-29 00:46:29,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:46:58,551 INFO L124 PetriNetUnfolderBase]: 37782/70664 cut-off events. [2023-11-29 00:46:58,551 INFO L125 PetriNetUnfolderBase]: For 425412/425564 co-relation queries the response was YES. [2023-11-29 00:46:59,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350356 conditions, 70664 events. 37782/70664 cut-off events. For 425412/425564 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 672407 event pairs, 6332 based on Foata normal form. 682/68277 useless extension candidates. Maximal degree in co-relation 346546. Up to 36034 conditions per place. [2023-11-29 00:46:59,469 INFO L140 encePairwiseOnDemand]: 95/140 looper letters, 1849 selfloop transitions, 980 changer transitions 4/2889 dead transitions. [2023-11-29 00:46:59,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 2889 transitions, 43546 flow [2023-11-29 00:46:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 00:46:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-29 00:46:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2284 transitions. [2023-11-29 00:46:59,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4183150183150183 [2023-11-29 00:46:59,474 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2284 transitions. [2023-11-29 00:46:59,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2284 transitions. [2023-11-29 00:46:59,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:46:59,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2284 transitions. [2023-11-29 00:46:59,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 58.56410256410256) internal successors, (2284), 39 states have internal predecessors, (2284), 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) [2023-11-29 00:46:59,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 140.0) internal successors, (5600), 40 states have internal predecessors, (5600), 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) [2023-11-29 00:46:59,488 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 140.0) internal successors, (5600), 40 states have internal predecessors, (5600), 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) [2023-11-29 00:46:59,488 INFO L175 Difference]: Start difference. First operand has 264 places, 1653 transitions, 24421 flow. Second operand 39 states and 2284 transitions. [2023-11-29 00:46:59,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 2889 transitions, 43546 flow [2023-11-29 00:47:10,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 2889 transitions, 43394 flow, removed 76 selfloop flow, removed 0 redundant places. [2023-11-29 00:47:10,158 INFO L231 Difference]: Finished difference. Result has 318 places, 2261 transitions, 37160 flow [2023-11-29 00:47:10,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24269, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=37160, PETRI_PLACES=318, PETRI_TRANSITIONS=2261} [2023-11-29 00:47:10,160 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 178 predicate places. [2023-11-29 00:47:10,160 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 2261 transitions, 37160 flow [2023-11-29 00:47:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 45.11904761904762) internal successors, (1895), 42 states have internal predecessors, (1895), 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) [2023-11-29 00:47:10,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:47:10,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:47:10,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:47:10,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:47:10,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:47:10,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:47:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1169680025, now seen corresponding path program 1 times [2023-11-29 00:47:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:47:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217227521] [2023-11-29 00:47:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:47:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:47:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:47:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:47:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:47:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217227521] [2023-11-29 00:47:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217227521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:47:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196805419] [2023-11-29 00:47:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:47:10,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:47:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:47:10,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:47:10,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:47:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:47:11,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:47:11,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:47:11,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:47:11,323 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:47:11,350 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 19 treesize of output 18 [2023-11-29 00:47:11,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 [2023-11-29 00:47:11,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 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 [2023-11-29 00:47:11,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:47:11,582 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 [2023-11-29 00:47:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:47:11,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:47:11,643 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false [2023-11-29 00:47:11,722 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false [2023-11-29 00:47:11,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (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 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))))) is different from false [2023-11-29 00:47:11,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (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|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))))) is different from false [2023-11-29 00:47:11,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (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 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false [2023-11-29 00:47:11,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:11,890 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 35 treesize of output 51 [2023-11-29 00:47:11,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:47:11,908 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 64 treesize of output 36 [2023-11-29 00:47:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:47:11,924 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:47:11,924 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 35 treesize of output 1 [2023-11-29 00:47:11,932 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:47:11,932 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 33 treesize of output 1 [2023-11-29 00:47:11,939 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:47:11,940 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 35 treesize of output 1 [2023-11-29 00:47:12,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 00:47:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:47:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196805419] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:47:12,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:47:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2023-11-29 00:47:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86926932] [2023-11-29 00:47:12,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:47:12,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 00:47:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:47:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 00:47:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=872, Unknown=5, NotChecked=320, Total=1332 [2023-11-29 00:47:12,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140 [2023-11-29 00:47:12,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 2261 transitions, 37160 flow. Second operand has 37 states, 37 states have (on average 62.62162162162162) internal successors, (2317), 37 states have internal predecessors, (2317), 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) [2023-11-29 00:47:12,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:47:12,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140 [2023-11-29 00:47:12,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:47:51,068 INFO L124 PetriNetUnfolderBase]: 38681/74297 cut-off events. [2023-11-29 00:47:51,068 INFO L125 PetriNetUnfolderBase]: For 721873/722668 co-relation queries the response was YES. [2023-11-29 00:47:51,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441998 conditions, 74297 events. 38681/74297 cut-off events. For 721873/722668 co-relation queries the response was YES. Maximal size of possible extension queue 1894. Compared 722864 event pairs, 4825 based on Foata normal form. 350/71240 useless extension candidates. Maximal degree in co-relation 437864. Up to 29140 conditions per place. [2023-11-29 00:47:52,180 INFO L140 encePairwiseOnDemand]: 103/140 looper letters, 1936 selfloop transitions, 1331 changer transitions 0/3371 dead transitions. [2023-11-29 00:47:52,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 3371 transitions, 59926 flow [2023-11-29 00:47:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 00:47:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 00:47:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1580 transitions. [2023-11-29 00:47:52,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2023-11-29 00:47:52,183 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1580 transitions. [2023-11-29 00:47:52,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1580 transitions. [2023-11-29 00:47:52,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:47:52,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1580 transitions. [2023-11-29 00:47:52,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 79.0) internal successors, (1580), 20 states have internal predecessors, (1580), 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) [2023-11-29 00:47:52,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 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) [2023-11-29 00:47:52,188 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 140.0) internal successors, (2940), 21 states have internal predecessors, (2940), 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) [2023-11-29 00:47:52,188 INFO L175 Difference]: Start difference. First operand has 318 places, 2261 transitions, 37160 flow. Second operand 20 states and 1580 transitions. [2023-11-29 00:47:52,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 3371 transitions, 59926 flow [2023-11-29 00:48:13,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 3371 transitions, 59584 flow, removed 150 selfloop flow, removed 17 redundant places. [2023-11-29 00:48:13,231 INFO L231 Difference]: Finished difference. Result has 329 places, 2849 transitions, 53541 flow [2023-11-29 00:48:13,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36830, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=761, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=53541, PETRI_PLACES=329, PETRI_TRANSITIONS=2849} [2023-11-29 00:48:13,233 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 189 predicate places. [2023-11-29 00:48:13,233 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 2849 transitions, 53541 flow [2023-11-29 00:48:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 62.62162162162162) internal successors, (2317), 37 states have internal predecessors, (2317), 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) [2023-11-29 00:48:13,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:13,233 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:13,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:48:13,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:48:13,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:48:13,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -124007959, now seen corresponding path program 2 times [2023-11-29 00:48:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:13,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842804424] [2023-11-29 00:48:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:14,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842804424] [2023-11-29 00:48:14,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842804424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:48:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408375808] [2023-11-29 00:48:14,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:48:14,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:48:14,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:48:14,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:48:14,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:48:14,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:48:14,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:48:14,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 00:48:14,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:48:14,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-29 00:48:14,530 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:48:14,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:48:14,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:14,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-29 00:48:14,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:48:14,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 00:48:14,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:48:14,703 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 43 treesize of output 32 [2023-11-29 00:48:14,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:48:14,787 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 43 treesize of output 32 [2023-11-29 00:48:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:14,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:48:14,814 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-29 00:48:14,856 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-29 00:48:14,871 WARN L854 $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_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-29 00:48:14,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:48:15,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:48:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-29 00:48:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408375808] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:48:15,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:48:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-29 00:48:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36834420] [2023-11-29 00:48:15,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:48:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 00:48:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 00:48:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1062, Unknown=4, NotChecked=276, Total=1482 [2023-11-29 00:48:15,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 140 [2023-11-29 00:48:15,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 2849 transitions, 53541 flow. Second operand has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 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) [2023-11-29 00:48:15,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:15,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 140 [2023-11-29 00:48:15,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:49:11,034 INFO L124 PetriNetUnfolderBase]: 45644/84753 cut-off events. [2023-11-29 00:49:11,034 INFO L125 PetriNetUnfolderBase]: For 1017355/1017784 co-relation queries the response was YES. [2023-11-29 00:49:11,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539337 conditions, 84753 events. 45644/84753 cut-off events. For 1017355/1017784 co-relation queries the response was YES. Maximal size of possible extension queue 2026. Compared 809336 event pairs, 6751 based on Foata normal form. 766/81601 useless extension candidates. Maximal degree in co-relation 534262. Up to 26754 conditions per place. [2023-11-29 00:49:12,401 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 1865 selfloop transitions, 2046 changer transitions 1/3981 dead transitions. [2023-11-29 00:49:12,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 3981 transitions, 76432 flow [2023-11-29 00:49:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 00:49:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-29 00:49:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2256 transitions. [2023-11-29 00:49:12,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198156682027649 [2023-11-29 00:49:12,405 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2256 transitions. [2023-11-29 00:49:12,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2256 transitions. [2023-11-29 00:49:12,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:49:12,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2256 transitions. [2023-11-29 00:49:12,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 72.7741935483871) internal successors, (2256), 31 states have internal predecessors, (2256), 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) [2023-11-29 00:49:12,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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) [2023-11-29 00:49:12,413 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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) [2023-11-29 00:49:12,413 INFO L175 Difference]: Start difference. First operand has 329 places, 2849 transitions, 53541 flow. Second operand 31 states and 2256 transitions. [2023-11-29 00:49:12,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 3981 transitions, 76432 flow [2023-11-29 00:49:35,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 3981 transitions, 76337 flow, removed 18 selfloop flow, removed 10 redundant places. [2023-11-29 00:49:35,801 INFO L231 Difference]: Finished difference. Result has 361 places, 3344 transitions, 71395 flow [2023-11-29 00:49:35,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=53468, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1649, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1092, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=71395, PETRI_PLACES=361, PETRI_TRANSITIONS=3344} [2023-11-29 00:49:35,804 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 221 predicate places. [2023-11-29 00:49:35,804 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 3344 transitions, 71395 flow [2023-11-29 00:49:35,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 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) [2023-11-29 00:49:35,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:49:35,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:49:35,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:49:36,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:49:36,006 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:49:36,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:49:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash -16083501, now seen corresponding path program 1 times [2023-11-29 00:49:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:49:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415703398] [2023-11-29 00:49:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:49:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:49:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:49:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:49:37,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415703398] [2023-11-29 00:49:37,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415703398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:49:37,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915797728] [2023-11-29 00:49:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:49:37,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:49:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:49:37,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:49:37,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:49:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:49:37,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 00:49:37,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:49:37,749 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 [2023-11-29 00:49:37,802 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 00:49:37,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 00:49:37,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:49:37,948 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 00:49:37,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-29 00:49:38,028 INFO L349 Elim1Store]: treesize reduction 4, result has 81.0 percent of original size [2023-11-29 00:49:38,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-29 00:49:38,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:49:39,131 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 00:49:39,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 84 [2023-11-29 00:49:40,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:40,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 71 [2023-11-29 00:49:40,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:49:40,269 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 [2023-11-29 00:49:40,338 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 [2023-11-29 00:49:40,417 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 [2023-11-29 00:49:40,505 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 [2023-11-29 00:49:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:40,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:49:40,594 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-29 00:49:40,618 WARN L854 $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_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:49:40,633 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-29 00:49:40,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:40,782 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 35 treesize of output 51 [2023-11-29 00:49:40,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:40,787 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 84 treesize of output 32 [2023-11-29 00:49:40,793 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:49:40,794 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 35 treesize of output 1 [2023-11-29 00:49:40,798 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:49:40,799 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 33 treesize of output 1 [2023-11-29 00:49:40,804 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:49:40,804 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 35 treesize of output 1 [2023-11-29 00:49:41,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false [2023-11-29 00:49:41,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:49:41,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:41,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 62 treesize of output 45 [2023-11-29 00:49:41,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 00:49:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915797728] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:49:49,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:49:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 21] total 62 [2023-11-29 00:49:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666136873] [2023-11-29 00:49:49,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:49:49,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-29 00:49:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:49:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-29 00:49:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3181, Unknown=27, NotChecked=468, Total=3906 [2023-11-29 00:49:49,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 140 [2023-11-29 00:49:49,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 3344 transitions, 71395 flow. Second operand has 63 states, 63 states have (on average 33.57142857142857) internal successors, (2115), 63 states have internal predecessors, (2115), 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) [2023-11-29 00:49:49,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:49:49,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 140 [2023-11-29 00:49:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:49:58,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|))) (let ((.cse0 (select .cse7 0))) (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) 1)) (.cse4 (+ .cse0 2)) (.cse8 (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_~#ts~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (select .cse7 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) .cse3 (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (= (select |c_#valid| .cse2) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse0) 1) (or (exists ((|ULTIMATE.start_main_~#ts~0#1.base| Int)) (and (<= .cse4 |ULTIMATE.start_main_~#ts~0#1.base|) (exists ((|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|))) (and (= |c_threadThread1of2ForFork0_#in~arg.base| .cse5) (not (= .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= .cse0 .cse5))))))) (and (exists ((|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse6 (select .cse7 |ULTIMATE.start_main_~#ts~0#1.offset|))) (and (not (= .cse0 .cse6)) (= |c_threadThread1of2ForFork0_#in~arg.base| .cse6)))) (<= .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or .cse3 .cse8) (<= .cse4 |c_ULTIMATE.start_main_~#ts~0#1.base|) (or .cse8 (not (= .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (not (= .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false [2023-11-29 00:49:59,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse6 (+ .cse0 2))) (let ((.cse4 (<= .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (.cse8 (= (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) 1)) (.cse11 (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_~#ts~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse7 (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (not (= .cse0 .cse1)) (or (and (exists ((|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse2 (select .cse3 |ULTIMATE.start_main_~#ts~0#1.offset|))) (and (= c_threadThread1of2ForFork0_~arg.base .cse2) (not (= .cse0 .cse2))))) .cse4) (exists ((|ULTIMATE.start_main_~#ts~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|))) (and (not (= .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= .cse0 .cse5)) (= c_threadThread1of2ForFork0_~arg.base .cse5)))) (<= .cse6 |ULTIMATE.start_main_~#ts~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse7)) (= |c_ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) .cse8 (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (= (select |c_#valid| .cse7) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse0) 1) (or (exists ((|ULTIMATE.start_main_~#ts~0#1.base| Int)) (and (<= .cse6 |ULTIMATE.start_main_~#ts~0#1.base|) (exists ((|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|))) (and (= |c_threadThread1of2ForFork0_#in~arg.base| .cse9) (not (= .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= .cse0 .cse9))))))) (and (exists ((|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse10 (select .cse3 |ULTIMATE.start_main_~#ts~0#1.offset|))) (and (not (= .cse0 .cse10)) (= |c_threadThread1of2ForFork0_#in~arg.base| .cse10)))) .cse4)) (or .cse8 .cse11) (<= .cse6 |c_ULTIMATE.start_main_~#ts~0#1.base|) (or .cse11 (not (= .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (= c_threadThread1of2ForFork0_~arg.offset 0) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (not (= .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= .cse1 .cse7)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) is different from false [2023-11-29 00:50:05,230 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#tids~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) 1) (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|)) is different from false [2023-11-29 00:52:10,488 INFO L124 PetriNetUnfolderBase]: 81106/147708 cut-off events. [2023-11-29 00:52:10,488 INFO L125 PetriNetUnfolderBase]: For 2558703/2559112 co-relation queries the response was YES. [2023-11-29 00:52:12,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053479 conditions, 147708 events. 81106/147708 cut-off events. For 2558703/2559112 co-relation queries the response was YES. Maximal size of possible extension queue 3424. Compared 1477934 event pairs, 23471 based on Foata normal form. 86/140977 useless extension candidates. Maximal degree in co-relation 1050840. Up to 69422 conditions per place. [2023-11-29 00:52:13,490 INFO L140 encePairwiseOnDemand]: 70/140 looper letters, 5577 selfloop transitions, 931 changer transitions 168/6707 dead transitions. [2023-11-29 00:52:13,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 6707 transitions, 146071 flow [2023-11-29 00:52:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-29 00:52:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-29 00:52:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 3016 transitions. [2023-11-29 00:52:13,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3122153209109731 [2023-11-29 00:52:13,496 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 3016 transitions. [2023-11-29 00:52:13,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 3016 transitions. [2023-11-29 00:52:13,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:52:13,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 3016 transitions. [2023-11-29 00:52:13,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 43.710144927536234) internal successors, (3016), 69 states have internal predecessors, (3016), 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) [2023-11-29 00:52:13,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 140.0) internal successors, (9800), 70 states have internal predecessors, (9800), 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) [2023-11-29 00:52:13,511 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 140.0) internal successors, (9800), 70 states have internal predecessors, (9800), 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) [2023-11-29 00:52:13,511 INFO L175 Difference]: Start difference. First operand has 361 places, 3344 transitions, 71395 flow. Second operand 69 states and 3016 transitions. [2023-11-29 00:52:13,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 6707 transitions, 146071 flow [2023-11-29 00:54:55,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 6707 transitions, 144980 flow, removed 504 selfloop flow, removed 16 redundant places. [2023-11-29 00:54:55,972 INFO L231 Difference]: Finished difference. Result has 456 places, 3978 transitions, 87515 flow [2023-11-29 00:54:55,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=70841, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2810, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=87515, PETRI_PLACES=456, PETRI_TRANSITIONS=3978} [2023-11-29 00:54:55,975 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 316 predicate places. [2023-11-29 00:54:55,975 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 3978 transitions, 87515 flow [2023-11-29 00:54:55,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 33.57142857142857) internal successors, (2115), 63 states have internal predecessors, (2115), 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) [2023-11-29 00:54:55,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:55,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:55,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:54:56,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:54:56,177 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 00:54:56,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 144842323, now seen corresponding path program 2 times [2023-11-29 00:54:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144644735] [2023-11-29 00:54:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:57,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144644735] [2023-11-29 00:54:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144644735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:54:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245090948] [2023-11-29 00:54:57,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:54:57,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:54:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:54:57,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:54:57,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acdd2491-7ff6-4edc-8211-a8501a0cbf2a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:54:57,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:54:57,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:54:57,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 00:54:57,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:58,016 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 [2023-11-29 00:54:58,145 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 00:54:58,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 00:54:58,232 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-29 00:54:58,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 00:54:59,239 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 00:54:59,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 74 [2023-11-29 00:54:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:54:59,264 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2023-11-29 00:54:59,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 29 [2023-11-29 00:54:59,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 00:54:59,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-29 00:54:59,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:54:59,822 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 26 treesize of output 19 [2023-11-29 00:54:59,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:54:59,835 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 16 treesize of output 11 [2023-11-29 00:55:00,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:55:00,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:55:00,136 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 [2023-11-29 00:55:00,181 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 [2023-11-29 00:55:00,228 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 [2023-11-29 00:55:00,284 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 [2023-11-29 00:55:00,360 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 [2023-11-29 00:55:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:00,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:55:00,623 WARN L854 $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_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1273 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2023-11-29 00:55:00,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1273 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:55:00,652 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false [2023-11-29 00:55:00,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:00,665 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 35 treesize of output 51 [2023-11-29 00:55:00,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:00,669 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 68 treesize of output 28 [2023-11-29 00:55:00,676 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:55:00,676 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 35 treesize of output 1 [2023-11-29 00:55:00,680 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:55:00,681 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 35 treesize of output 1 [2023-11-29 00:55:00,685 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:55:00,685 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 33 treesize of output 1 [2023-11-29 00:55:01,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:01,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 127 treesize of output 82 [2023-11-29 00:55:01,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-11-29 00:55:01,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:01,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 20 [2023-11-29 00:55:01,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-11-29 00:55:01,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:01,917 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 41 treesize of output 46 [2023-11-29 00:55:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245090948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:55:02,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:55:02,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 22] total 67 [2023-11-29 00:55:02,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886613167] [2023-11-29 00:55:02,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:55:02,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-29 00:55:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-29 00:55:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3837, Unknown=38, NotChecked=384, Total=4556 [2023-11-29 00:55:02,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 140 [2023-11-29 00:55:02,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 3978 transitions, 87515 flow. Second operand has 68 states, 68 states have (on average 33.38235294117647) internal successors, (2270), 68 states have internal predecessors, (2270), 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) [2023-11-29 00:55:02,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:02,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 140 [2023-11-29 00:55:02,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand