./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/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_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/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_9992e536-3b4f-4aed-99e4-da350d00bcb7/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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:11:04,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:11:04,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 07:11:04,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:11:04,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:11:04,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:11:04,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:11:04,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:11:04,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:11:04,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:11:04,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:11:04,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:11:04,277 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:11:04,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:11:04,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:11:04,278 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:11:04,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:11:04,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:11:04,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:11:04,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:11:04,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:11:04,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:11:04,281 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 07:11:04,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:11:04,282 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:11:04,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:11:04,283 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:11:04,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:11:04,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:11:04,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:11:04,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:11:04,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:11:04,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:11:04,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:11:04,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:11:04,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:11:04,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:11:04,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:11:04,287 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:11:04,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:11:04,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:11:04,288 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_9992e536-3b4f-4aed-99e4-da350d00bcb7/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_9992e536-3b4f-4aed-99e4-da350d00bcb7/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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2023-11-29 07:11:04,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:11:04,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:11:04,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:11:04,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:11:04,545 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:11:04,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2023-11-29 07:11:07,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:11:07,514 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:11:07,514 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2023-11-29 07:11:07,533 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/data/117be4fdc/f1d8e6bba00f4ca38f2445041fb994c0/FLAG2a847fcfd [2023-11-29 07:11:07,547 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/data/117be4fdc/f1d8e6bba00f4ca38f2445041fb994c0 [2023-11-29 07:11:07,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:11:07,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:11:07,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:11:07,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:11:07,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:11:07,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:11:07" (1/1) ... [2023-11-29 07:11:07,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8aff35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:07, skipping insertion in model container [2023-11-29 07:11:07,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:11:07" (1/1) ... [2023-11-29 07:11:07,607 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:11:07,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:11:07,940 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:11:07,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:11:08,027 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:11:08,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08 WrapperNode [2023-11-29 07:11:08,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:11:08,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:11:08,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:11:08,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:11:08,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,077 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2023-11-29 07:11:08,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:11:08,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:11:08,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:11:08,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:11:08,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:11:08,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:11:08,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:11:08,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:11:08,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (1/1) ... [2023-11-29 07:11:08,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:11:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:11:08,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:11:08,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:11:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 07:11:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:11:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 07:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 07:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 07:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 07:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 07:11:08,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 07:11:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:11:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:11:08,180 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 07:11:08,309 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:11:08,311 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:11:08,527 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:11:08,537 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:11:08,538 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 07:11:08,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:11:08 BoogieIcfgContainer [2023-11-29 07:11:08,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:11:08,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:11:08,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:11:08,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:11:08,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:11:07" (1/3) ... [2023-11-29 07:11:08,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16950b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:11:08, skipping insertion in model container [2023-11-29 07:11:08,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:11:08" (2/3) ... [2023-11-29 07:11:08,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16950b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:11:08, skipping insertion in model container [2023-11-29 07:11:08,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:11:08" (3/3) ... [2023-11-29 07:11:08,549 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2023-11-29 07:11:08,555 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 07:11:08,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:11:08,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-29 07:11:08,564 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 07:11:08,616 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 07:11:08,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 209 flow [2023-11-29 07:11:08,749 INFO L124 PetriNetUnfolderBase]: 6/144 cut-off events. [2023-11-29 07:11:08,750 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 07:11:08,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 6/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2023-11-29 07:11:08,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 209 flow [2023-11-29 07:11:08,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 209 flow [2023-11-29 07:11:08,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:11:08,778 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;@360d506d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:11:08,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 07:11:08,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 07:11:08,792 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2023-11-29 07:11:08,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:11:08,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:08,793 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] [2023-11-29 07:11:08,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 07:11:08,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 110762765, now seen corresponding path program 1 times [2023-11-29 07:11:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486980306] [2023-11-29 07:11:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,156 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 07:11:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:09,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486980306] [2023-11-29 07:11:09,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486980306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039841782] [2023-11-29 07:11:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:09,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:11:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:11:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:11:09,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 101 [2023-11-29 07:11:09,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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 07:11:09,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:09,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 101 [2023-11-29 07:11:09,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:09,404 INFO L124 PetriNetUnfolderBase]: 1/145 cut-off events. [2023-11-29 07:11:09,404 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 07:11:09,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 145 events. 1/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2023-11-29 07:11:09,406 INFO L140 encePairwiseOnDemand]: 90/101 looper letters, 11 selfloop transitions, 2 changer transitions 6/103 dead transitions. [2023-11-29 07:11:09,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 249 flow [2023-11-29 07:11:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions. [2023-11-29 07:11:09,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8811881188118812 [2023-11-29 07:11:09,423 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 534 transitions. [2023-11-29 07:11:09,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions. [2023-11-29 07:11:09,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:09,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions. [2023-11-29 07:11:09,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 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 07:11:09,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:09,441 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:09,443 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 209 flow. Second operand 6 states and 534 transitions. [2023-11-29 07:11:09,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 249 flow [2023-11-29 07:11:09,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:09,451 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 219 flow [2023-11-29 07:11:09,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2023-11-29 07:11:09,456 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2023-11-29 07:11:09,456 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 219 flow [2023-11-29 07:11:09,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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 07:11:09,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:09,457 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] [2023-11-29 07:11:09,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:11:09,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 07:11:09,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -320054848, now seen corresponding path program 1 times [2023-11-29 07:11:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763918115] [2023-11-29 07:11:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:09,928 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 07:11:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763918115] [2023-11-29 07:11:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763918115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377261779] [2023-11-29 07:11:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:10,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 101 [2023-11-29 07:11:10,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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 07:11:10,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:10,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 101 [2023-11-29 07:11:10,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:10,304 INFO L124 PetriNetUnfolderBase]: 90/425 cut-off events. [2023-11-29 07:11:10,304 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-29 07:11:10,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 425 events. 90/425 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2038 event pairs, 52 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 588. Up to 200 conditions per place. [2023-11-29 07:11:10,308 INFO L140 encePairwiseOnDemand]: 90/101 looper letters, 31 selfloop transitions, 22 changer transitions 0/118 dead transitions. [2023-11-29 07:11:10,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 118 transitions, 367 flow [2023-11-29 07:11:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 450 transitions. [2023-11-29 07:11:10,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7425742574257426 [2023-11-29 07:11:10,311 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 450 transitions. [2023-11-29 07:11:10,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 450 transitions. [2023-11-29 07:11:10,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:10,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 450 transitions. [2023-11-29 07:11:10,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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 07:11:10,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:10,316 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:10,317 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 219 flow. Second operand 6 states and 450 transitions. [2023-11-29 07:11:10,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 118 transitions, 367 flow [2023-11-29 07:11:10,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 353 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-29 07:11:10,322 INFO L231 Difference]: Finished difference. Result has 110 places, 118 transitions, 355 flow [2023-11-29 07:11:10,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=110, PETRI_TRANSITIONS=118} [2023-11-29 07:11:10,322 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2023-11-29 07:11:10,323 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 118 transitions, 355 flow [2023-11-29 07:11:10,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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 07:11:10,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:10,324 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] [2023-11-29 07:11:10,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:11:10,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 07:11:10,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash 123090180, now seen corresponding path program 1 times [2023-11-29 07:11:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530209584] [2023-11-29 07:11:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:10,672 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 07:11:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530209584] [2023-11-29 07:11:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530209584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588742935] [2023-11-29 07:11:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:10,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 101 [2023-11-29 07:11:10,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 118 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:10,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:10,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 101 [2023-11-29 07:11:10,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:11,060 INFO L124 PetriNetUnfolderBase]: 197/671 cut-off events. [2023-11-29 07:11:11,061 INFO L125 PetriNetUnfolderBase]: For 159/189 co-relation queries the response was YES. [2023-11-29 07:11:11,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 671 events. 197/671 cut-off events. For 159/189 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3678 event pairs, 36 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1329. Up to 341 conditions per place. [2023-11-29 07:11:11,069 INFO L140 encePairwiseOnDemand]: 82/101 looper letters, 41 selfloop transitions, 64 changer transitions 7/177 dead transitions. [2023-11-29 07:11:11,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 177 transitions, 753 flow [2023-11-29 07:11:11,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2023-11-29 07:11:11,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8366336633663366 [2023-11-29 07:11:11,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 507 transitions. [2023-11-29 07:11:11,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions. [2023-11-29 07:11:11,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:11,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions. [2023-11-29 07:11:11,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 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 07:11:11,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:11,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:11,078 INFO L175 Difference]: Start difference. First operand has 110 places, 118 transitions, 355 flow. Second operand 6 states and 507 transitions. [2023-11-29 07:11:11,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 177 transitions, 753 flow [2023-11-29 07:11:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 177 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:11,086 INFO L231 Difference]: Finished difference. Result has 120 places, 170 transitions, 833 flow [2023-11-29 07:11:11,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=120, PETRI_TRANSITIONS=170} [2023-11-29 07:11:11,087 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2023-11-29 07:11:11,088 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 170 transitions, 833 flow [2023-11-29 07:11:11,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:11:11,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:11,088 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] [2023-11-29 07:11:11,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:11:11,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 07:11:11,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash -884650249, now seen corresponding path program 1 times [2023-11-29 07:11:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:11,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395011010] [2023-11-29 07:11:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:11,398 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 07:11:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395011010] [2023-11-29 07:11:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395011010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:11,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578446284] [2023-11-29 07:11:11,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:11,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:11,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:11,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:11,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 101 [2023-11-29 07:11:11,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 170 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 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 07:11:11,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:11,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 101 [2023-11-29 07:11:11,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:11,801 INFO L124 PetriNetUnfolderBase]: 208/743 cut-off events. [2023-11-29 07:11:11,801 INFO L125 PetriNetUnfolderBase]: For 608/671 co-relation queries the response was YES. [2023-11-29 07:11:11,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 743 events. 208/743 cut-off events. For 608/671 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4463 event pairs, 15 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1971. Up to 271 conditions per place. [2023-11-29 07:11:11,808 INFO L140 encePairwiseOnDemand]: 85/101 looper letters, 80 selfloop transitions, 36 changer transitions 0/200 dead transitions. [2023-11-29 07:11:11,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 200 transitions, 1236 flow [2023-11-29 07:11:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2023-11-29 07:11:11,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7788778877887789 [2023-11-29 07:11:11,811 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 472 transitions. [2023-11-29 07:11:11,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions. [2023-11-29 07:11:11,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:11,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions. [2023-11-29 07:11:11,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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 07:11:11,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:11,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 07:11:11,816 INFO L175 Difference]: Start difference. First operand has 120 places, 170 transitions, 833 flow. Second operand 6 states and 472 transitions. [2023-11-29 07:11:11,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 200 transitions, 1236 flow [2023-11-29 07:11:11,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 200 transitions, 1218 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:11,832 INFO L231 Difference]: Finished difference. Result has 122 places, 199 transitions, 1163 flow [2023-11-29 07:11:11,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=122, PETRI_TRANSITIONS=199} [2023-11-29 07:11:11,834 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places. [2023-11-29 07:11:11,834 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 199 transitions, 1163 flow [2023-11-29 07:11:11,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 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 07:11:11,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:11,835 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 07:11:11,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:11:11,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 07:11:11,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 122711626, now seen corresponding path program 1 times [2023-11-29 07:11:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:11,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517501689] [2023-11-29 07:11:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:11:11,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:11:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:11:11,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 07:11:11,923 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:11:11,924 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-29 07:11:11,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-29 07:11:11,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-29 07:11:11,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-29 07:11:11,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-29 07:11:11,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-29 07:11:11,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-29 07:11:11,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:11:11,926 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 07:11:11,928 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 07:11:11,928 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 07:11:11,950 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 07:11:11,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow [2023-11-29 07:11:11,978 INFO L124 PetriNetUnfolderBase]: 11/263 cut-off events. [2023-11-29 07:11:11,979 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 07:11:11,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 11/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 507 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-11-29 07:11:11,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow [2023-11-29 07:11:11,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow [2023-11-29 07:11:11,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:11:11,984 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;@360d506d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:11:11,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 07:11:11,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 07:11:11,988 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2023-11-29 07:11:11,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:11:11,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:11,988 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] [2023-11-29 07:11:11,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:11,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2007563443, now seen corresponding path program 1 times [2023-11-29 07:11:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:11,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832201017] [2023-11-29 07:11:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:12,040 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 07:11:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832201017] [2023-11-29 07:11:12,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832201017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:12,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:12,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940672336] [2023-11-29 07:11:12,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:12,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:11:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:11:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:11:12,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 119 [2023-11-29 07:11:12,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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 07:11:12,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:12,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 119 [2023-11-29 07:11:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:12,187 INFO L124 PetriNetUnfolderBase]: 3/261 cut-off events. [2023-11-29 07:11:12,187 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 07:11:12,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 261 events. 3/261 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 525 event pairs, 0 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 168. Up to 32 conditions per place. [2023-11-29 07:11:12,189 INFO L140 encePairwiseOnDemand]: 108/119 looper letters, 14 selfloop transitions, 2 changer transitions 6/122 dead transitions. [2023-11-29 07:11:12,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 302 flow [2023-11-29 07:11:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2023-11-29 07:11:12,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8865546218487395 [2023-11-29 07:11:12,191 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2023-11-29 07:11:12,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2023-11-29 07:11:12,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:12,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2023-11-29 07:11:12,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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 07:11:12,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:12,196 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:12,196 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 254 flow. Second operand 6 states and 633 transitions. [2023-11-29 07:11:12,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 302 flow [2023-11-29 07:11:12,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:12,198 INFO L231 Difference]: Finished difference. Result has 128 places, 116 transitions, 268 flow [2023-11-29 07:11:12,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=128, PETRI_TRANSITIONS=116} [2023-11-29 07:11:12,199 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places. [2023-11-29 07:11:12,200 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 268 flow [2023-11-29 07:11:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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 07:11:12,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:12,200 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] [2023-11-29 07:11:12,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:11:12,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:12,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1563657737, now seen corresponding path program 1 times [2023-11-29 07:11:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:12,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852519102] [2023-11-29 07:11:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:12,388 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 07:11:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852519102] [2023-11-29 07:11:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852519102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265585987] [2023-11-29 07:11:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:12,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:12,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 119 [2023-11-29 07:11:12,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 116 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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 07:11:12,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:12,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 119 [2023-11-29 07:11:12,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:13,048 INFO L124 PetriNetUnfolderBase]: 1143/3263 cut-off events. [2023-11-29 07:11:13,049 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-11-29 07:11:13,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 3263 events. 1143/3263 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24888 event pairs, 764 based on Foata normal form. 0/2970 useless extension candidates. Maximal degree in co-relation 4312. Up to 1816 conditions per place. [2023-11-29 07:11:13,065 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 38 selfloop transitions, 38 changer transitions 0/153 dead transitions. [2023-11-29 07:11:13,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 494 flow [2023-11-29 07:11:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2023-11-29 07:11:13,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-29 07:11:13,068 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 544 transitions. [2023-11-29 07:11:13,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions. [2023-11-29 07:11:13,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:13,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions. [2023-11-29 07:11:13,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 07:11:13,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:13,072 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:13,072 INFO L175 Difference]: Start difference. First operand has 128 places, 116 transitions, 268 flow. Second operand 6 states and 544 transitions. [2023-11-29 07:11:13,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 494 flow [2023-11-29 07:11:13,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 482 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 07:11:13,077 INFO L231 Difference]: Finished difference. Result has 130 places, 153 transitions, 510 flow [2023-11-29 07:11:13,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=130, PETRI_TRANSITIONS=153} [2023-11-29 07:11:13,078 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2023-11-29 07:11:13,078 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 153 transitions, 510 flow [2023-11-29 07:11:13,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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 07:11:13,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:13,079 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] [2023-11-29 07:11:13,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:11:13,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:13,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2075767851, now seen corresponding path program 1 times [2023-11-29 07:11:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317099295] [2023-11-29 07:11:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:13,382 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 07:11:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:13,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317099295] [2023-11-29 07:11:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317099295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003051275] [2023-11-29 07:11:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:13,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:13,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119 [2023-11-29 07:11:13,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 153 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 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 07:11:13,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:13,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119 [2023-11-29 07:11:13,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:14,592 INFO L124 PetriNetUnfolderBase]: 2605/6208 cut-off events. [2023-11-29 07:11:14,592 INFO L125 PetriNetUnfolderBase]: For 1573/1736 co-relation queries the response was YES. [2023-11-29 07:11:14,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14073 conditions, 6208 events. 2605/6208 cut-off events. For 1573/1736 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 48776 event pairs, 747 based on Foata normal form. 0/5792 useless extension candidates. Maximal degree in co-relation 11520. Up to 3531 conditions per place. [2023-11-29 07:11:14,645 INFO L140 encePairwiseOnDemand]: 92/119 looper letters, 71 selfloop transitions, 124 changer transitions 0/280 dead transitions. [2023-11-29 07:11:14,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 280 transitions, 1400 flow [2023-11-29 07:11:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2023-11-29 07:11:14,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8753501400560224 [2023-11-29 07:11:14,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 625 transitions. [2023-11-29 07:11:14,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions. [2023-11-29 07:11:14,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:14,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions. [2023-11-29 07:11:14,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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 07:11:14,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:14,654 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:14,654 INFO L175 Difference]: Start difference. First operand has 130 places, 153 transitions, 510 flow. Second operand 6 states and 625 transitions. [2023-11-29 07:11:14,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 280 transitions, 1400 flow [2023-11-29 07:11:14,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 280 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:14,667 INFO L231 Difference]: Finished difference. Result has 140 places, 272 transitions, 1554 flow [2023-11-29 07:11:14,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1554, PETRI_PLACES=140, PETRI_TRANSITIONS=272} [2023-11-29 07:11:14,669 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2023-11-29 07:11:14,669 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 272 transitions, 1554 flow [2023-11-29 07:11:14,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 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 07:11:14,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:14,669 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] [2023-11-29 07:11:14,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:11:14,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:14,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1445906526, now seen corresponding path program 1 times [2023-11-29 07:11:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45015201] [2023-11-29 07:11:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:15,025 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 07:11:15,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45015201] [2023-11-29 07:11:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45015201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:15,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754318863] [2023-11-29 07:11:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:15,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 119 [2023-11-29 07:11:15,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 272 transitions, 1554 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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 07:11:15,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:15,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 119 [2023-11-29 07:11:15,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:16,547 INFO L124 PetriNetUnfolderBase]: 3224/7675 cut-off events. [2023-11-29 07:11:16,548 INFO L125 PetriNetUnfolderBase]: For 6711/7174 co-relation queries the response was YES. [2023-11-29 07:11:16,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 7675 events. 3224/7675 cut-off events. For 6711/7174 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 62553 event pairs, 459 based on Foata normal form. 0/7327 useless extension candidates. Maximal degree in co-relation 19055. Up to 3823 conditions per place. [2023-11-29 07:11:16,602 INFO L140 encePairwiseOnDemand]: 98/119 looper letters, 170 selfloop transitions, 88 changer transitions 0/360 dead transitions. [2023-11-29 07:11:16,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 360 transitions, 2634 flow [2023-11-29 07:11:16,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-11-29 07:11:16,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053221288515406 [2023-11-29 07:11:16,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-11-29 07:11:16,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-11-29 07:11:16,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:16,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-11-29 07:11:16,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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 07:11:16,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:16,609 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:16,609 INFO L175 Difference]: Start difference. First operand has 140 places, 272 transitions, 1554 flow. Second operand 6 states and 575 transitions. [2023-11-29 07:11:16,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 360 transitions, 2634 flow [2023-11-29 07:11:16,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 360 transitions, 2616 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:16,644 INFO L231 Difference]: Finished difference. Result has 150 places, 352 transitions, 2504 flow [2023-11-29 07:11:16,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2504, PETRI_PLACES=150, PETRI_TRANSITIONS=352} [2023-11-29 07:11:16,645 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2023-11-29 07:11:16,646 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 352 transitions, 2504 flow [2023-11-29 07:11:16,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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 07:11:16,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:16,646 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] [2023-11-29 07:11:16,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:11:16,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:16,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash -272965224, now seen corresponding path program 1 times [2023-11-29 07:11:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380384416] [2023-11-29 07:11:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:16,870 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 07:11:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380384416] [2023-11-29 07:11:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380384416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:16,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:11:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501714677] [2023-11-29 07:11:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:16,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:11:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:11:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:11:17,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119 [2023-11-29 07:11:17,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 352 transitions, 2504 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 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 07:11:17,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:17,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119 [2023-11-29 07:11:17,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:18,329 INFO L124 PetriNetUnfolderBase]: 3689/8462 cut-off events. [2023-11-29 07:11:18,329 INFO L125 PetriNetUnfolderBase]: For 15104/15566 co-relation queries the response was YES. [2023-11-29 07:11:18,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30661 conditions, 8462 events. 3689/8462 cut-off events. For 15104/15566 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 67996 event pairs, 333 based on Foata normal form. 0/8152 useless extension candidates. Maximal degree in co-relation 25539. Up to 4191 conditions per place. [2023-11-29 07:11:18,398 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 206 selfloop transitions, 124 changer transitions 0/473 dead transitions. [2023-11-29 07:11:18,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 473 transitions, 4302 flow [2023-11-29 07:11:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:11:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:11:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-11-29 07:11:18,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2023-11-29 07:11:18,401 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-11-29 07:11:18,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-11-29 07:11:18,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:18,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-11-29 07:11:18,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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 07:11:18,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:18,405 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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 07:11:18,406 INFO L175 Difference]: Start difference. First operand has 150 places, 352 transitions, 2504 flow. Second operand 6 states and 606 transitions. [2023-11-29 07:11:18,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 473 transitions, 4302 flow [2023-11-29 07:11:18,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 473 transitions, 4062 flow, removed 120 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:18,462 INFO L231 Difference]: Finished difference. Result has 160 places, 471 transitions, 3984 flow [2023-11-29 07:11:18,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=160, PETRI_TRANSITIONS=471} [2023-11-29 07:11:18,463 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2023-11-29 07:11:18,463 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 471 transitions, 3984 flow [2023-11-29 07:11:18,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 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 07:11:18,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:18,464 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] [2023-11-29 07:11:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:11:18,464 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:18,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1899929088, now seen corresponding path program 1 times [2023-11-29 07:11:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123360492] [2023-11-29 07:11:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,035 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 07:11:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123360492] [2023-11-29 07:11:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123360492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:11:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82290560] [2023-11-29 07:11:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:11:19,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:11:19,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:11:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:19,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 07:11:19,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:19,207 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 07:11:19,237 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:11:19,237 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 07:11:19,293 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 13 treesize of output 9 [2023-11-29 07:11:19,305 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 23 treesize of output 22 [2023-11-29 07:11:19,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:19,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-11-29 07:11:19,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:19,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-11-29 07:11:19,381 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 45 treesize of output 34 [2023-11-29 07:11:19,393 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 07:11:19,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:19,429 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-29 07:11:19,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (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_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))) is different from false [2023-11-29 07:11:19,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (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_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-29 07:11:19,638 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 07:11:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82290560] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:11:19,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:11:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2023-11-29 07:11:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914682881] [2023-11-29 07:11:19,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:11:19,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 07:11:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 07:11:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2023-11-29 07:11:19,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119 [2023-11-29 07:11:19,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 471 transitions, 3984 flow. Second operand has 19 states, 19 states have (on average 56.89473684210526) internal successors, (1081), 19 states have internal predecessors, (1081), 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 07:11:19,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:19,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119 [2023-11-29 07:11:19,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:25,999 INFO L124 PetriNetUnfolderBase]: 11510/22830 cut-off events. [2023-11-29 07:11:26,000 INFO L125 PetriNetUnfolderBase]: For 46570/46600 co-relation queries the response was YES. [2023-11-29 07:11:26,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85352 conditions, 22830 events. 11510/22830 cut-off events. For 46570/46600 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 193367 event pairs, 621 based on Foata normal form. 222/21955 useless extension candidates. Maximal degree in co-relation 76822. Up to 7166 conditions per place. [2023-11-29 07:11:26,167 INFO L140 encePairwiseOnDemand]: 91/119 looper letters, 946 selfloop transitions, 553 changer transitions 43/1600 dead transitions. [2023-11-29 07:11:26,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1600 transitions, 15564 flow [2023-11-29 07:11:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-29 07:11:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-29 07:11:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2674 transitions. [2023-11-29 07:11:26,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6073131955484896 [2023-11-29 07:11:26,178 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2674 transitions. [2023-11-29 07:11:26,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2674 transitions. [2023-11-29 07:11:26,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:26,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2674 transitions. [2023-11-29 07:11:26,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 72.27027027027027) internal successors, (2674), 37 states have internal predecessors, (2674), 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 07:11:26,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 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 07:11:26,201 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 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 07:11:26,201 INFO L175 Difference]: Start difference. First operand has 160 places, 471 transitions, 3984 flow. Second operand 37 states and 2674 transitions. [2023-11-29 07:11:26,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1600 transitions, 15564 flow [2023-11-29 07:11:26,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 1600 transitions, 15264 flow, removed 150 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:26,506 INFO L231 Difference]: Finished difference. Result has 219 places, 918 transitions, 10189 flow [2023-11-29 07:11:26,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3822, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10189, PETRI_PLACES=219, PETRI_TRANSITIONS=918} [2023-11-29 07:11:26,508 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 100 predicate places. [2023-11-29 07:11:26,508 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 918 transitions, 10189 flow [2023-11-29 07:11:26,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 56.89473684210526) internal successors, (1081), 19 states have internal predecessors, (1081), 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 07:11:26,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:26,509 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] [2023-11-29 07:11:26,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 07:11:26,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:26,710 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:26,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1676153764, now seen corresponding path program 1 times [2023-11-29 07:11:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359390503] [2023-11-29 07:11:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:27,152 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 07:11:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359390503] [2023-11-29 07:11:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359390503] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:11:27,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147188743] [2023-11-29 07:11:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:27,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:27,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:11:27,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:11:27,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 07:11:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:27,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 07:11:27,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:27,364 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 07:11:27,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:11:27,489 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 07:11:27,747 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 07:11:27,789 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 07:11:27,847 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 07:11:27,912 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 07:11:27,994 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 07:11:28,046 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 07:11:28,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:28,073 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false [2023-11-29 07:11:28,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (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_458 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2023-11-29 07:11:28,116 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (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) .cse3 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2023-11-29 07:11:28,325 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 07:11:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147188743] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:11:28,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:11:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 37 [2023-11-29 07:11:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377680793] [2023-11-29 07:11:28,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:11:28,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 07:11:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:28,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 07:11:28,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1057, Unknown=3, NotChecked=204, Total=1406 [2023-11-29 07:11:28,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119 [2023-11-29 07:11:28,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 918 transitions, 10189 flow. Second operand has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 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 07:11:28,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:28,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119 [2023-11-29 07:11:28,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:42,569 INFO L124 PetriNetUnfolderBase]: 21737/42230 cut-off events. [2023-11-29 07:11:42,569 INFO L125 PetriNetUnfolderBase]: For 310973/311124 co-relation queries the response was YES. [2023-11-29 07:11:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220770 conditions, 42230 events. 21737/42230 cut-off events. For 310973/311124 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 385909 event pairs, 2336 based on Foata normal form. 267/40335 useless extension candidates. Maximal degree in co-relation 211110. Up to 14507 conditions per place. [2023-11-29 07:11:42,984 INFO L140 encePairwiseOnDemand]: 79/119 looper letters, 1732 selfloop transitions, 982 changer transitions 32/2796 dead transitions. [2023-11-29 07:11:42,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2796 transitions, 37755 flow [2023-11-29 07:11:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-29 07:11:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-11-29 07:11:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2606 transitions. [2023-11-29 07:11:42,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43798319327731094 [2023-11-29 07:11:42,992 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 2606 transitions. [2023-11-29 07:11:42,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 2606 transitions. [2023-11-29 07:11:42,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:42,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2606 transitions. [2023-11-29 07:11:43,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 52.12) internal successors, (2606), 50 states have internal predecessors, (2606), 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 07:11:43,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 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 07:11:43,012 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 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 07:11:43,012 INFO L175 Difference]: Start difference. First operand has 219 places, 918 transitions, 10189 flow. Second operand 50 states and 2606 transitions. [2023-11-29 07:11:43,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2796 transitions, 37755 flow [2023-11-29 07:11:46,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 2796 transitions, 36383 flow, removed 681 selfloop flow, removed 3 redundant places. [2023-11-29 07:11:46,392 INFO L231 Difference]: Finished difference. Result has 283 places, 1804 transitions, 25440 flow [2023-11-29 07:11:46,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=9657, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=25440, PETRI_PLACES=283, PETRI_TRANSITIONS=1804} [2023-11-29 07:11:46,394 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 164 predicate places. [2023-11-29 07:11:46,394 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 1804 transitions, 25440 flow [2023-11-29 07:11:46,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 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 07:11:46,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:46,395 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] [2023-11-29 07:11:46,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 07:11:46,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:46,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:11:46,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1257960966, now seen corresponding path program 2 times [2023-11-29 07:11:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:46,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568457596] [2023-11-29 07:11:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:47,221 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 07:11:47,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568457596] [2023-11-29 07:11:47,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568457596] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:11:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317189371] [2023-11-29 07:11:47,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:11:47,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:47,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:11:47,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:11:47,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 07:11:47,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:11:47,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:11:47,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 07:11:47,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:47,388 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 07:11:47,445 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:11:47,445 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 07:11:47,602 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 07:11:47,637 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 07:11:47,684 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 07:11:47,749 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 07:11:47,930 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 07:11:47,977 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 07:11:47,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:48,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false [2023-11-29 07:11:48,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false [2023-11-29 07:11:48,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (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|) .cse2 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false [2023-11-29 07:11:48,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (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) .cse3 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2023-11-29 07:11:48,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2023-11-29 07:11:48,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:48,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2023-11-29 07:11:48,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:11:48,153 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 81 treesize of output 38 [2023-11-29 07:11:48,157 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 9 treesize of output 3 [2023-11-29 07:11:48,164 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:11:48,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:11:48,171 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:11:48,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:11:48,177 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:11:48,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:11:48,222 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 07:11:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317189371] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:11:48,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:11:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31 [2023-11-29 07:11:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679313096] [2023-11-29 07:11:48,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:11:48,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 07:11:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 07:11:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=602, Unknown=5, NotChecked=270, Total=992 [2023-11-29 07:11:48,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-11-29 07:11:48,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1804 transitions, 25440 flow. Second operand has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 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 07:11:48,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:48,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-11-29 07:11:48,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:12:16,977 INFO L124 PetriNetUnfolderBase]: 34029/67891 cut-off events. [2023-11-29 07:12:16,977 INFO L125 PetriNetUnfolderBase]: For 815976/816338 co-relation queries the response was YES. [2023-11-29 07:12:17,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395150 conditions, 67891 events. 34029/67891 cut-off events. For 815976/816338 co-relation queries the response was YES. Maximal size of possible extension queue 1916. Compared 681856 event pairs, 3811 based on Foata normal form. 158/65056 useless extension candidates. Maximal degree in co-relation 386179. Up to 24263 conditions per place. [2023-11-29 07:12:17,916 INFO L140 encePairwiseOnDemand]: 83/119 looper letters, 2302 selfloop transitions, 1329 changer transitions 38/3734 dead transitions. [2023-11-29 07:12:17,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 3734 transitions, 59987 flow [2023-11-29 07:12:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-29 07:12:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-29 07:12:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2550 transitions. [2023-11-29 07:12:17,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791505791505791 [2023-11-29 07:12:17,921 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2550 transitions. [2023-11-29 07:12:17,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2550 transitions. [2023-11-29 07:12:17,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:12:17,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2550 transitions. [2023-11-29 07:12:17,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 68.91891891891892) internal successors, (2550), 37 states have internal predecessors, (2550), 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 07:12:17,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 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 07:12:17,935 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 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 07:12:17,935 INFO L175 Difference]: Start difference. First operand has 283 places, 1804 transitions, 25440 flow. Second operand 37 states and 2550 transitions. [2023-11-29 07:12:17,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 3734 transitions, 59987 flow [2023-11-29 07:12:27,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3734 transitions, 59733 flow, removed 100 selfloop flow, removed 17 redundant places. [2023-11-29 07:12:27,483 INFO L231 Difference]: Finished difference. Result has 322 places, 2617 transitions, 44520 flow [2023-11-29 07:12:27,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=25278, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=44520, PETRI_PLACES=322, PETRI_TRANSITIONS=2617} [2023-11-29 07:12:27,485 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 203 predicate places. [2023-11-29 07:12:27,485 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 2617 transitions, 44520 flow [2023-11-29 07:12:27,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 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 07:12:27,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:12:27,486 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] [2023-11-29 07:12:27,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 07:12:27,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:12:27,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:12:27,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:12:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2132846908, now seen corresponding path program 3 times [2023-11-29 07:12:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:12:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034178754] [2023-11-29 07:12:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:12:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:12:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:28,121 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 07:12:28,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:12:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034178754] [2023-11-29 07:12:28,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034178754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:12:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132644117] [2023-11-29 07:12:28,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:12:28,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:12:28,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:12:28,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:12:28,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 07:12:28,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 07:12:28,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:12:28,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 07:12:28,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:12:28,242 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 07:12:28,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:12:28,293 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 07:12:28,449 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 07:12:28,522 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 07:12:28,562 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 07:12:28,608 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 07:12:28,678 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 07:12:28,715 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 07:12:28,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:12:28,737 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false [2023-11-29 07:12:28,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (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|) .cse2 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2023-11-29 07:12:28,775 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (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|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2023-11-29 07:12:28,793 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2023-11-29 07:12:28,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2023-11-29 07:12:28,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:12:28,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2023-11-29 07:12:28,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:12:28,859 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 83 treesize of output 39 [2023-11-29 07:12:28,862 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 10 treesize of output 3 [2023-11-29 07:12:28,868 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:12:28,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:12:28,874 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:12:28,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:12:28,879 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:12:28,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2023-11-29 07:12:28,948 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 07:12:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132644117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:12:28,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:12:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33 [2023-11-29 07:12:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686641134] [2023-11-29 07:12:28,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:12:28,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 07:12:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:12:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 07:12:28,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=719, Unknown=5, NotChecked=290, Total=1122 [2023-11-29 07:12:28,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-11-29 07:12:28,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2617 transitions, 44520 flow. Second operand has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 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 07:12:28,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:12:28,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-11-29 07:12:28,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:13:17,386 INFO L124 PetriNetUnfolderBase]: 41285/81153 cut-off events. [2023-11-29 07:13:17,386 INFO L125 PetriNetUnfolderBase]: For 1184505/1185147 co-relation queries the response was YES. [2023-11-29 07:13:18,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517274 conditions, 81153 events. 41285/81153 cut-off events. For 1184505/1185147 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 818425 event pairs, 4314 based on Foata normal form. 399/78030 useless extension candidates. Maximal degree in co-relation 514417. Up to 30004 conditions per place. [2023-11-29 07:13:18,690 INFO L140 encePairwiseOnDemand]: 83/119 looper letters, 2623 selfloop transitions, 2150 changer transitions 35/4873 dead transitions. [2023-11-29 07:13:18,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4873 transitions, 90219 flow [2023-11-29 07:13:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 07:13:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-29 07:13:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2742 transitions. [2023-11-29 07:13:18,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5760504201680672 [2023-11-29 07:13:18,695 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 2742 transitions. [2023-11-29 07:13:18,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 2742 transitions. [2023-11-29 07:13:18,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:13:18,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2742 transitions. [2023-11-29 07:13:18,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 68.55) internal successors, (2742), 40 states have internal predecessors, (2742), 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 07:13:18,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 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 07:13:18,711 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 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 07:13:18,711 INFO L175 Difference]: Start difference. First operand has 322 places, 2617 transitions, 44520 flow. Second operand 40 states and 2742 transitions. [2023-11-29 07:13:18,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 4873 transitions, 90219 flow [2023-11-29 07:13:38,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4873 transitions, 89529 flow, removed 297 selfloop flow, removed 14 redundant places. [2023-11-29 07:13:38,400 INFO L231 Difference]: Finished difference. Result has 368 places, 3656 transitions, 73189 flow [2023-11-29 07:13:38,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=44102, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=73189, PETRI_PLACES=368, PETRI_TRANSITIONS=3656} [2023-11-29 07:13:38,402 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 249 predicate places. [2023-11-29 07:13:38,403 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 3656 transitions, 73189 flow [2023-11-29 07:13:38,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 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 07:13:38,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:13:38,403 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] [2023-11-29 07:13:38,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 07:13:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:13:38,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:13:38,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:13:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 913751356, now seen corresponding path program 4 times [2023-11-29 07:13:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:13:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032199885] [2023-11-29 07:13:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:13:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:13:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:13:39,072 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 07:13:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:13:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032199885] [2023-11-29 07:13:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032199885] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:13:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416606388] [2023-11-29 07:13:39,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 07:13:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:13:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:13:39,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:13:39,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 07:13:39,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 07:13:39,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:13:39,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 07:13:39,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:13:39,261 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 07:13:39,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:13:39,308 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 07:13:39,520 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 07:13:39,555 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 07:13:39,599 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 07:13:39,738 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 07:13:39,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-11-29 07:13:39,844 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 07:13:39,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:14:04,273 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 07:14:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416606388] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:14:04,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:14:04,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2023-11-29 07:14:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075314478] [2023-11-29 07:14:04,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:14:04,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 07:14:04,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:14:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 07:14:04,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1299, Unknown=5, NotChecked=0, Total=1482 [2023-11-29 07:14:08,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:12,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:16,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:21,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:25,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:29,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:34,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:38,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:43,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:47,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:51,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:14:56,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:00,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:05,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:10,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:14,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:19,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:23,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:27,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:31,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:36,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:40,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:45,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 07:15:45,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-11-29 07:15:45,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 3656 transitions, 73189 flow. Second operand has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 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 07:15:45,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:15:45,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-11-29 07:15:45,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:17:06,704 INFO L124 PetriNetUnfolderBase]: 46910/92499 cut-off events. [2023-11-29 07:17:06,704 INFO L125 PetriNetUnfolderBase]: For 1997656/1998520 co-relation queries the response was YES. [2023-11-29 07:17:07,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646594 conditions, 92499 events. 46910/92499 cut-off events. For 1997656/1998520 co-relation queries the response was YES. Maximal size of possible extension queue 2541. Compared 952057 event pairs, 4732 based on Foata normal form. 351/88901 useless extension candidates. Maximal degree in co-relation 642740. Up to 34530 conditions per place. [2023-11-29 07:17:08,294 INFO L140 encePairwiseOnDemand]: 83/119 looper letters, 2996 selfloop transitions, 2313 changer transitions 38/5412 dead transitions. [2023-11-29 07:17:08,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 5412 transitions, 114848 flow [2023-11-29 07:17:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 07:17:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-29 07:17:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2734 transitions. [2023-11-29 07:17:08,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5743697478991596 [2023-11-29 07:17:08,299 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 2734 transitions. [2023-11-29 07:17:08,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 2734 transitions. [2023-11-29 07:17:08,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:17:08,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2734 transitions. [2023-11-29 07:17:08,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 68.35) internal successors, (2734), 40 states have internal predecessors, (2734), 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 07:17:08,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 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 07:17:08,341 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 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 07:17:08,341 INFO L175 Difference]: Start difference. First operand has 368 places, 3656 transitions, 73189 flow. Second operand 40 states and 2734 transitions. [2023-11-29 07:17:08,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 5412 transitions, 114848 flow [2023-11-29 07:17:38,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 5412 transitions, 111590 flow, removed 1568 selfloop flow, removed 15 redundant places. [2023-11-29 07:17:38,578 INFO L231 Difference]: Finished difference. Result has 412 places, 4308 transitions, 94931 flow [2023-11-29 07:17:38,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=70607, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=94931, PETRI_PLACES=412, PETRI_TRANSITIONS=4308} [2023-11-29 07:17:38,582 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 293 predicate places. [2023-11-29 07:17:38,582 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 4308 transitions, 94931 flow [2023-11-29 07:17:38,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 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 07:17:38,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:17:38,583 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] [2023-11-29 07:17:38,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 07:17:38,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 07:17:38,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:17:38,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:17:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1218317434, now seen corresponding path program 5 times [2023-11-29 07:17:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:17:38,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518392640] [2023-11-29 07:17:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:17:38,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:17:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:17:39,226 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 07:17:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:17:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518392640] [2023-11-29 07:17:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518392640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:17:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38369330] [2023-11-29 07:17:39,227 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 07:17:39,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:17:39,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:17:39,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:17:39,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 07:17:39,349 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:17:39,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:17:39,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 07:17:39,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:17:39,430 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 07:17:39,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:17:39,517 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 07:17:39,680 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 07:17:39,724 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 07:17:39,848 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 07:17:39,905 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 07:17:39,987 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 07:17:40,034 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 07:17:40,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:17:40,058 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false [2023-11-29 07:17:40,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (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_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)))) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2023-11-29 07:17:40,364 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (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|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2023-11-29 07:17:40,385 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2023-11-29 07:17:40,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:17:40,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2023-11-29 07:17:40,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:17:40,406 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 83 treesize of output 39 [2023-11-29 07:17:40,409 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 10 treesize of output 3 [2023-11-29 07:17:40,416 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:17:40,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:17:40,422 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:17:40,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2023-11-29 07:17:40,428 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 07:17:40,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 07:17:40,557 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 07:17:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38369330] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:17:40,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:17:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 39 [2023-11-29 07:17:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922963801] [2023-11-29 07:17:40,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:17:40,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 07:17:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:17:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 07:17:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1116, Unknown=22, NotChecked=284, Total=1560 [2023-11-29 07:17:40,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119 [2023-11-29 07:17:40,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 4308 transitions, 94931 flow. Second operand has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 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 07:17:40,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:17:40,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119 [2023-11-29 07:17:40,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:19:26,970 INFO L124 PetriNetUnfolderBase]: 52743/103290 cut-off events. [2023-11-29 07:19:26,971 INFO L125 PetriNetUnfolderBase]: For 2412427/2413522 co-relation queries the response was YES. [2023-11-29 07:19:28,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753473 conditions, 103290 events. 52743/103290 cut-off events. For 2412427/2413522 co-relation queries the response was YES. Maximal size of possible extension queue 2772. Compared 1069663 event pairs, 4973 based on Foata normal form. 528/99364 useless extension candidates. Maximal degree in co-relation 748373. Up to 38947 conditions per place. [2023-11-29 07:19:29,170 INFO L140 encePairwiseOnDemand]: 74/119 looper letters, 3317 selfloop transitions, 2903 changer transitions 40/6310 dead transitions. [2023-11-29 07:19:29,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 6310 transitions, 144714 flow [2023-11-29 07:19:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-29 07:19:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-11-29 07:19:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2670 transitions. [2023-11-29 07:19:29,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44873949579831934 [2023-11-29 07:19:29,174 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 2670 transitions. [2023-11-29 07:19:29,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 2670 transitions. [2023-11-29 07:19:29,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:19:29,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2670 transitions. [2023-11-29 07:19:29,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 53.4) internal successors, (2670), 50 states have internal predecessors, (2670), 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 07:19:29,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 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 07:19:29,182 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 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 07:19:29,182 INFO L175 Difference]: Start difference. First operand has 412 places, 4308 transitions, 94931 flow. Second operand 50 states and 2670 transitions. [2023-11-29 07:19:29,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 6310 transitions, 144714 flow [2023-11-29 07:20:11,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 6310 transitions, 143297 flow, removed 618 selfloop flow, removed 18 redundant places. [2023-11-29 07:20:12,110 INFO L231 Difference]: Finished difference. Result has 463 places, 5049 transitions, 123932 flow [2023-11-29 07:20:12,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=93842, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=123932, PETRI_PLACES=463, PETRI_TRANSITIONS=5049} [2023-11-29 07:20:12,113 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 344 predicate places. [2023-11-29 07:20:12,113 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 5049 transitions, 123932 flow [2023-11-29 07:20:12,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 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 07:20:12,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:20:12,114 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] [2023-11-29 07:20:12,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 07:20:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:20:12,314 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:20:12,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:20:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1102084772, now seen corresponding path program 6 times [2023-11-29 07:20:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:20:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011153250] [2023-11-29 07:20:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:20:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:20:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:20:12,795 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 07:20:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:20:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011153250] [2023-11-29 07:20:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011153250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:20:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903310564] [2023-11-29 07:20:12,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 07:20:12,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:20:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:20:12,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:20:12,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 07:20:12,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-29 07:20:12,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:20:12,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 07:20:12,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:20:12,963 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 07:20:13,024 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:20:13,024 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 07:20:13,200 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 07:20:13,236 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 07:20:13,284 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 07:20:13,339 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 07:20:13,576 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 07:20:13,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 07:20:13,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:20:13,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false [2023-11-29 07:20:13,704 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false [2023-11-29 07:20:13,718 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false [2023-11-29 07:20:14,161 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 07:20:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903310564] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:20:14,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:20:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33 [2023-11-29 07:20:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247674477] [2023-11-29 07:20:14,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:20:14,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 07:20:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:20:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 07:20:14,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=780, Unknown=23, NotChecked=180, Total=1122 [2023-11-29 07:20:14,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-11-29 07:20:14,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 5049 transitions, 123932 flow. Second operand has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 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 07:20:14,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:20:14,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-11-29 07:20:14,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:22:32,186 INFO L124 PetriNetUnfolderBase]: 56592/112299 cut-off events. [2023-11-29 07:22:32,186 INFO L125 PetriNetUnfolderBase]: For 2910119/2911283 co-relation queries the response was YES. [2023-11-29 07:22:33,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851538 conditions, 112299 events. 56592/112299 cut-off events. For 2910119/2911283 co-relation queries the response was YES. Maximal size of possible extension queue 3097. Compared 1191888 event pairs, 6239 based on Foata normal form. 466/107995 useless extension candidates. Maximal degree in co-relation 845996. Up to 57749 conditions per place. [2023-11-29 07:22:34,671 INFO L140 encePairwiseOnDemand]: 83/119 looper letters, 3071 selfloop transitions, 2882 changer transitions 34/6053 dead transitions. [2023-11-29 07:22:34,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 6053 transitions, 156988 flow [2023-11-29 07:22:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 07:22:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-29 07:22:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1937 transitions. [2023-11-29 07:22:34,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5612865835989568 [2023-11-29 07:22:34,674 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 1937 transitions. [2023-11-29 07:22:34,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 1937 transitions. [2023-11-29 07:22:34,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:22:34,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1937 transitions. [2023-11-29 07:22:34,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 66.79310344827586) internal successors, (1937), 29 states have internal predecessors, (1937), 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 07:22:34,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 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 07:22:34,679 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 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 07:22:34,679 INFO L175 Difference]: Start difference. First operand has 463 places, 5049 transitions, 123932 flow. Second operand 29 states and 1937 transitions. [2023-11-29 07:22:34,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 6053 transitions, 156988 flow [2023-11-29 07:23:34,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 6053 transitions, 155596 flow, removed 626 selfloop flow, removed 20 redundant places. [2023-11-29 07:23:34,478 INFO L231 Difference]: Finished difference. Result has 487 places, 5570 transitions, 148812 flow [2023-11-29 07:23:34,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=122552, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=148812, PETRI_PLACES=487, PETRI_TRANSITIONS=5570} [2023-11-29 07:23:34,482 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, 368 predicate places. [2023-11-29 07:23:34,482 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 5570 transitions, 148812 flow [2023-11-29 07:23:34,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 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 07:23:34,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:23:34,482 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] [2023-11-29 07:23:34,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 07:23:34,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:23:34,683 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 07:23:34,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:23:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1909251018, now seen corresponding path program 7 times [2023-11-29 07:23:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:23:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851975962] [2023-11-29 07:23:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:23:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:23:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:23:35,054 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 07:23:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:23:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851975962] [2023-11-29 07:23:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851975962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:23:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820410151] [2023-11-29 07:23:35,054 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 07:23:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:23:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:23:35,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:23:35,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9992e536-3b4f-4aed-99e4-da350d00bcb7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 07:23:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:23:35,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 07:23:35,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:23:35,326 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 07:23:35,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:23:35,444 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 07:23:35,591 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 07:23:35,706 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 07:23:35,748 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 07:23:35,801 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 07:23:35,874 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 07:23:35,919 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 07:23:35,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:23:35,941 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false [2023-11-29 07:23:35,967 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (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|) .cse2 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false [2023-11-29 07:23:36,147 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2023-11-29 07:23:36,356 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 07:23:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820410151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:23:36,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:23:36,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 38 [2023-11-29 07:23:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717523019] [2023-11-29 07:23:36,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:23:36,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 07:23:36,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:23:36,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 07:23:36,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1118, Unknown=15, NotChecked=210, Total=1482 [2023-11-29 07:23:36,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119 [2023-11-29 07:23:36,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 5570 transitions, 148812 flow. Second operand has 39 states, 39 states have (on average 40.30769230769231) internal successors, (1572), 39 states have internal predecessors, (1572), 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 07:23:36,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:23:36,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119 [2023-11-29 07:23:36,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand