./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1 --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 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:11:29,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:11:29,344 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-02 10:11:29,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:11:29,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:11:29,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:11:29,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:11:29,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:11:29,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:11:29,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:11:29,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:11:29,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:11:29,373 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:11:29,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:11:29,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 10:11:29,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 10:11:29,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:11:29,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:11:29,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:11:29,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:11:29,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:11:29,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 10:11:29,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:11:29,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2024-12-02 10:11:29,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:11:29,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:11:29,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:11:29,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:11:29,591 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:11:29,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-12-02 10:11:32,200 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/data/51eae94bf/3f91ea67e0e8429d8434a73192ac9f72/FLAG5941c1d98 [2024-12-02 10:11:32,457 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:11:32,457 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-12-02 10:11:32,465 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/data/51eae94bf/3f91ea67e0e8429d8434a73192ac9f72/FLAG5941c1d98 [2024-12-02 10:11:32,800 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/data/51eae94bf/3f91ea67e0e8429d8434a73192ac9f72 [2024-12-02 10:11:32,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:11:32,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:11:32,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:11:32,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:11:32,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:11:32,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:11:32" (1/1) ... [2024-12-02 10:11:32,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2a1ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:32, skipping insertion in model container [2024-12-02 10:11:32,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:11:32" (1/1) ... [2024-12-02 10:11:32,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:11:32,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:11:32,981 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:11:33,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:11:33,025 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:11:33,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33 WrapperNode [2024-12-02 10:11:33,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:11:33,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:11:33,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:11:33,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:11:33,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,067 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 344 [2024-12-02 10:11:33,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:11:33,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:11:33,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:11:33,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:11:33,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:11:33,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:11:33,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:11:33,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:11:33,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (1/1) ... [2024-12-02 10:11:33,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:11:33,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:33,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:11:33,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:11:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-02 10:11:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-02 10:11:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-02 10:11:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:11:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:11:33,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 10:11:33,176 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 10:11:33,281 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:11:33,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:11:33,919 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 10:11:33,919 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:11:34,166 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:11:34,166 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-12-02 10:11:34,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:11:34 BoogieIcfgContainer [2024-12-02 10:11:34,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:11:34,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:11:34,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:11:34,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:11:34,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:11:32" (1/3) ... [2024-12-02 10:11:34,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0801d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:11:34, skipping insertion in model container [2024-12-02 10:11:34,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:33" (2/3) ... [2024-12-02 10:11:34,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0801d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:11:34, skipping insertion in model container [2024-12-02 10:11:34,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:11:34" (3/3) ... [2024-12-02 10:11:34,176 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2024-12-02 10:11:34,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:11:34,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 6 loop locations, and 55 error locations. [2024-12-02 10:11:34,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 10:11:34,300 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-02 10:11:34,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 510 transitions, 1041 flow [2024-12-02 10:11:34,520 INFO L124 PetriNetUnfolderBase]: 27/507 cut-off events. [2024-12-02 10:11:34,522 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-12-02 10:11:34,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 507 events. 27/507 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 636 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 428. Up to 2 conditions per place. [2024-12-02 10:11:34,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 510 transitions, 1041 flow [2024-12-02 10:11:34,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 463 transitions, 944 flow [2024-12-02 10:11:34,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:11:34,555 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3bf48632, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:11:34,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2024-12-02 10:11:34,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 10:11:34,561 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-12-02 10:11:34,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:11:34,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:34,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:34,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:34,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:34,567 INFO L85 PathProgramCache]: Analyzing trace with hash 171251015, now seen corresponding path program 1 times [2024-12-02 10:11:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938625666] [2024-12-02 10:11:34,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938625666] [2024-12-02 10:11:34,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938625666] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:34,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011456938] [2024-12-02 10:11:34,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:34,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:34,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:34,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:34,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 510 [2024-12-02 10:11:34,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 463 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:34,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:34,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 510 [2024-12-02 10:11:34,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:35,100 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2024-12-02 10:11:35,100 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-12-02 10:11:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6538 event pairs, 51 based on Foata normal form. 12/1018 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2024-12-02 10:11:35,111 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2024-12-02 10:11:35,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2024-12-02 10:11:35,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2024-12-02 10:11:35,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235294117647059 [2024-12-02 10:11:35,127 INFO L175 Difference]: Start difference. First operand has 449 places, 463 transitions, 944 flow. Second operand 3 states and 1413 transitions. [2024-12-02 10:11:35,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2024-12-02 10:11:35,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-12-02 10:11:35,141 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2024-12-02 10:11:35,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-12-02 10:11:35,147 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2024-12-02 10:11:35,147 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2024-12-02 10:11:35,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:35,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:35,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:35,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 10:11:35,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:35,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:35,149 INFO L85 PathProgramCache]: Analyzing trace with hash 358501197, now seen corresponding path program 1 times [2024-12-02 10:11:35,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:35,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146385365] [2024-12-02 10:11:35,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:35,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:35,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:35,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146385365] [2024-12-02 10:11:35,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146385365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:35,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:35,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:35,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568738168] [2024-12-02 10:11:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:35,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:35,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:35,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:35,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-12-02 10:11:35,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:35,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:35,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-12-02 10:11:35,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:35,532 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2024-12-02 10:11:35,532 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-12-02 10:11:35,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6571 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2024-12-02 10:11:35,543 INFO L140 encePairwiseOnDemand]: 502/510 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2024-12-02 10:11:35,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2024-12-02 10:11:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2024-12-02 10:11:35,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947712418300654 [2024-12-02 10:11:35,547 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2024-12-02 10:11:35,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2024-12-02 10:11:35,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:35,556 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2024-12-02 10:11:35,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2024-12-02 10:11:35,558 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2024-12-02 10:11:35,558 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2024-12-02 10:11:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:35,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:35,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 10:11:35,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2057164460, now seen corresponding path program 1 times [2024-12-02 10:11:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087011825] [2024-12-02 10:11:35,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:35,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087011825] [2024-12-02 10:11:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087011825] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:35,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410398828] [2024-12-02 10:11:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:35,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:35,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:35,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:35,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-12-02 10:11:35,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:35,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:35,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-12-02 10:11:35,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:35,864 INFO L124 PetriNetUnfolderBase]: 64/657 cut-off events. [2024-12-02 10:11:35,864 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 10:11:35,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 657 events. 64/657 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2197 event pairs, 34 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 731. Up to 92 conditions per place. [2024-12-02 10:11:35,870 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-12-02 10:11:35,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 416 transitions, 876 flow [2024-12-02 10:11:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-12-02 10:11:35,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-12-02 10:11:35,875 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 3 states and 1390 transitions. [2024-12-02 10:11:35,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 416 transitions, 876 flow [2024-12-02 10:11:35,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 416 transitions, 875 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:11:35,884 INFO L231 Difference]: Finished difference. Result has 414 places, 416 transitions, 843 flow [2024-12-02 10:11:35,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=414, PETRI_TRANSITIONS=416} [2024-12-02 10:11:35,886 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2024-12-02 10:11:35,886 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 416 transitions, 843 flow [2024-12-02 10:11:35,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:35,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:35,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:35,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 10:11:35,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:35,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash 584844508, now seen corresponding path program 1 times [2024-12-02 10:11:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:35,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481632521] [2024-12-02 10:11:35,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:36,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481632521] [2024-12-02 10:11:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481632521] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287661845] [2024-12-02 10:11:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:36,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:36,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:36,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:36,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 510 [2024-12-02 10:11:36,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 416 transitions, 843 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:36,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:36,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 510 [2024-12-02 10:11:36,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:37,179 INFO L124 PetriNetUnfolderBase]: 287/1439 cut-off events. [2024-12-02 10:11:37,179 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-12-02 10:11:37,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 1439 events. 287/1439 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8487 event pairs, 188 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1942. Up to 463 conditions per place. [2024-12-02 10:11:37,187 INFO L140 encePairwiseOnDemand]: 492/510 looper letters, 65 selfloop transitions, 15 changer transitions 0/413 dead transitions. [2024-12-02 10:11:37,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 997 flow [2024-12-02 10:11:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:11:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:11:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2024-12-02 10:11:37,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7996732026143791 [2024-12-02 10:11:37,194 INFO L175 Difference]: Start difference. First operand has 414 places, 416 transitions, 843 flow. Second operand 6 states and 2447 transitions. [2024-12-02 10:11:37,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 997 flow [2024-12-02 10:11:37,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 413 transitions, 993 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:37,198 INFO L231 Difference]: Finished difference. Result has 414 places, 413 transitions, 863 flow [2024-12-02 10:11:37,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=863, PETRI_PLACES=414, PETRI_TRANSITIONS=413} [2024-12-02 10:11:37,199 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2024-12-02 10:11:37,199 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 413 transitions, 863 flow [2024-12-02 10:11:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:37,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:37,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 10:11:37,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:37,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash 978919536, now seen corresponding path program 1 times [2024-12-02 10:11:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942435972] [2024-12-02 10:11:37,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:37,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:37,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942435972] [2024-12-02 10:11:37,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942435972] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:37,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:37,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:37,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196221113] [2024-12-02 10:11:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:37,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:37,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-12-02 10:11:37,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 413 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:37,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-12-02 10:11:37,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:37,428 INFO L124 PetriNetUnfolderBase]: 64/653 cut-off events. [2024-12-02 10:11:37,428 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 10:11:37,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 653 events. 64/653 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2028 event pairs, 34 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 742. Up to 92 conditions per place. [2024-12-02 10:11:37,432 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2024-12-02 10:11:37,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 412 transitions, 897 flow [2024-12-02 10:11:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-12-02 10:11:37,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-12-02 10:11:37,435 INFO L175 Difference]: Start difference. First operand has 414 places, 413 transitions, 863 flow. Second operand 3 states and 1390 transitions. [2024-12-02 10:11:37,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 412 transitions, 897 flow [2024-12-02 10:11:37,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 10:11:37,440 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2024-12-02 10:11:37,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-12-02 10:11:37,441 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2024-12-02 10:11:37,441 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2024-12-02 10:11:37,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:37,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 10:11:37,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -231526230, now seen corresponding path program 1 times [2024-12-02 10:11:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120765128] [2024-12-02 10:11:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120765128] [2024-12-02 10:11:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120765128] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787034501] [2024-12-02 10:11:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:37,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:37,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:37,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:37,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-12-02 10:11:37,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:37,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-12-02 10:11:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:37,610 INFO L124 PetriNetUnfolderBase]: 30/482 cut-off events. [2024-12-02 10:11:37,610 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 10:11:37,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 482 events. 30/482 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 504. Up to 44 conditions per place. [2024-12-02 10:11:37,613 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2024-12-02 10:11:37,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2024-12-02 10:11:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-12-02 10:11:37,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-12-02 10:11:37,617 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2024-12-02 10:11:37,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2024-12-02 10:11:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:37,622 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2024-12-02 10:11:37,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2024-12-02 10:11:37,623 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-12-02 10:11:37,623 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2024-12-02 10:11:37,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:37,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:37,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 10:11:37,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2015052317, now seen corresponding path program 1 times [2024-12-02 10:11:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925483535] [2024-12-02 10:11:37,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925483535] [2024-12-02 10:11:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925483535] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511184329] [2024-12-02 10:11:37,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:37,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:37,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:37,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-12-02 10:11:37,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:37,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-12-02 10:11:37,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:37,779 INFO L124 PetriNetUnfolderBase]: 30/481 cut-off events. [2024-12-02 10:11:37,779 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 10:11:37,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 481 events. 30/481 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 930 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 503. Up to 44 conditions per place. [2024-12-02 10:11:37,781 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-12-02 10:11:37,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2024-12-02 10:11:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-12-02 10:11:37,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-12-02 10:11:37,785 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2024-12-02 10:11:37,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2024-12-02 10:11:37,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:37,789 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2024-12-02 10:11:37,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2024-12-02 10:11:37,790 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-12-02 10:11:37,791 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2024-12-02 10:11:37,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:37,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 10:11:37,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 335331165, now seen corresponding path program 1 times [2024-12-02 10:11:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100885862] [2024-12-02 10:11:37,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:37,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100885862] [2024-12-02 10:11:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100885862] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:37,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:37,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566887083] [2024-12-02 10:11:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:37,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:37,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:37,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:37,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-12-02 10:11:37,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:37,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:37,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-12-02 10:11:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:38,059 INFO L124 PetriNetUnfolderBase]: 122/1251 cut-off events. [2024-12-02 10:11:38,059 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-12-02 10:11:38,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1251 events. 122/1251 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6430 event pairs, 56 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1398. Up to 156 conditions per place. [2024-12-02 10:11:38,068 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2024-12-02 10:11:38,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2024-12-02 10:11:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-12-02 10:11:38,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-12-02 10:11:38,072 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2024-12-02 10:11:38,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2024-12-02 10:11:38,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:38,078 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2024-12-02 10:11:38,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2024-12-02 10:11:38,079 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-12-02 10:11:38,079 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2024-12-02 10:11:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:38,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:38,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:38,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 10:11:38,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:38,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1648512590, now seen corresponding path program 1 times [2024-12-02 10:11:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097596899] [2024-12-02 10:11:38,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097596899] [2024-12-02 10:11:38,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097596899] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:38,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:38,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212366744] [2024-12-02 10:11:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:38,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:38,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:38,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:39,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-12-02 10:11:39,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:39,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:39,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-12-02 10:11:39,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:39,218 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2024-12-02 10:11:39,218 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-12-02 10:11:39,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1142 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2024-12-02 10:11:39,220 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2024-12-02 10:11:39,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2024-12-02 10:11:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:11:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:11:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-12-02 10:11:39,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-12-02 10:11:39,227 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2024-12-02 10:11:39,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2024-12-02 10:11:39,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:11:39,235 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2024-12-02 10:11:39,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-12-02 10:11:39,236 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2024-12-02 10:11:39,237 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2024-12-02 10:11:39,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:39,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:39,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:39,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 10:11:39,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:39,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1098361164, now seen corresponding path program 1 times [2024-12-02 10:11:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5253290] [2024-12-02 10:11:39,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5253290] [2024-12-02 10:11:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5253290] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:39,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729682696] [2024-12-02 10:11:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:39,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:39,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:39,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-12-02 10:11:39,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:39,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:39,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-12-02 10:11:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:39,474 INFO L124 PetriNetUnfolderBase]: 63/679 cut-off events. [2024-12-02 10:11:39,474 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-12-02 10:11:39,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 679 events. 63/679 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2276 event pairs, 36 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 809. Up to 98 conditions per place. [2024-12-02 10:11:39,477 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-12-02 10:11:39,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2024-12-02 10:11:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-12-02 10:11:39,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-12-02 10:11:39,481 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2024-12-02 10:11:39,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2024-12-02 10:11:39,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 10:11:39,484 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2024-12-02 10:11:39,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2024-12-02 10:11:39,485 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-12-02 10:11:39,485 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2024-12-02 10:11:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:39,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:39,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:39,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 10:11:39,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:39,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash 30987058, now seen corresponding path program 1 times [2024-12-02 10:11:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:39,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097697897] [2024-12-02 10:11:39,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097697897] [2024-12-02 10:11:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097697897] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:39,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:39,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581520405] [2024-12-02 10:11:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:39,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:39,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:39,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-12-02 10:11:39,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:39,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:39,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-12-02 10:11:39,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:39,697 INFO L124 PetriNetUnfolderBase]: 121/1225 cut-off events. [2024-12-02 10:11:39,697 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-12-02 10:11:39,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1225 events. 121/1225 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6231 event pairs, 58 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1422. Up to 158 conditions per place. [2024-12-02 10:11:39,703 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2024-12-02 10:11:39,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2024-12-02 10:11:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-12-02 10:11:39,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-12-02 10:11:39,706 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2024-12-02 10:11:39,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2024-12-02 10:11:39,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:39,710 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2024-12-02 10:11:39,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2024-12-02 10:11:39,711 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2024-12-02 10:11:39,711 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2024-12-02 10:11:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:39,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:39,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:39,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 10:11:39,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -829143808, now seen corresponding path program 1 times [2024-12-02 10:11:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325572603] [2024-12-02 10:11:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:40,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:40,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325572603] [2024-12-02 10:11:40,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325572603] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:40,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:40,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795071565] [2024-12-02 10:11:40,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:40,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:40,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:40,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:40,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:40,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-12-02 10:11:40,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:40,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:40,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-12-02 10:11:40,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:40,745 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2024-12-02 10:11:40,745 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-12-02 10:11:40,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1107 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-12-02 10:11:40,749 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2024-12-02 10:11:40,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2024-12-02 10:11:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:11:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:11:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-12-02 10:11:40,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-12-02 10:11:40,753 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2024-12-02 10:11:40,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2024-12-02 10:11:40,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:11:40,759 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2024-12-02 10:11:40,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2024-12-02 10:11:40,760 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2024-12-02 10:11:40,760 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2024-12-02 10:11:40,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:40,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:40,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:40,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 10:11:40,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash 856030777, now seen corresponding path program 1 times [2024-12-02 10:11:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592486072] [2024-12-02 10:11:40,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592486072] [2024-12-02 10:11:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592486072] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:40,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:40,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216702031] [2024-12-02 10:11:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:40,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:40,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:40,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:40,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-12-02 10:11:40,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:40,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:40,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-12-02 10:11:40,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:40,986 INFO L124 PetriNetUnfolderBase]: 63/672 cut-off events. [2024-12-02 10:11:40,986 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-12-02 10:11:40,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 672 events. 63/672 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2192 event pairs, 36 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 804. Up to 98 conditions per place. [2024-12-02 10:11:40,991 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-12-02 10:11:40,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2024-12-02 10:11:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-12-02 10:11:40,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-12-02 10:11:40,993 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2024-12-02 10:11:40,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2024-12-02 10:11:40,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 10:11:40,999 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2024-12-02 10:11:41,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2024-12-02 10:11:41,000 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2024-12-02 10:11:41,000 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2024-12-02 10:11:41,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:41,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:41,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:41,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 10:11:41,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1700916931, now seen corresponding path program 1 times [2024-12-02 10:11:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250739756] [2024-12-02 10:11:41,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250739756] [2024-12-02 10:11:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250739756] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750821040] [2024-12-02 10:11:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:41,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:41,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:41,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:41,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:41,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-12-02 10:11:41,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:41,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:41,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-12-02 10:11:41,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:41,185 INFO L124 PetriNetUnfolderBase]: 29/485 cut-off events. [2024-12-02 10:11:41,185 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-12-02 10:11:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 485 events. 29/485 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1003 event pairs, 14 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 530. Up to 50 conditions per place. [2024-12-02 10:11:41,189 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-12-02 10:11:41,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2024-12-02 10:11:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-12-02 10:11:41,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9124183006535947 [2024-12-02 10:11:41,191 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2024-12-02 10:11:41,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2024-12-02 10:11:41,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:41,197 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2024-12-02 10:11:41,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2024-12-02 10:11:41,198 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2024-12-02 10:11:41,198 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2024-12-02 10:11:41,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:41,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:41,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:41,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 10:11:41,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1209000452, now seen corresponding path program 1 times [2024-12-02 10:11:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590921212] [2024-12-02 10:11:41,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:11:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590921212] [2024-12-02 10:11:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590921212] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745751355] [2024-12-02 10:11:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:41,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:41,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:41,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:41,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-12-02 10:11:41,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:41,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:41,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-12-02 10:11:41,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:41,564 INFO L124 PetriNetUnfolderBase]: 109/1236 cut-off events. [2024-12-02 10:11:41,564 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-12-02 10:11:41,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 1236 events. 109/1236 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7002 event pairs, 25 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1430. Up to 91 conditions per place. [2024-12-02 10:11:41,573 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2024-12-02 10:11:41,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2024-12-02 10:11:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2024-12-02 10:11:41,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196078431372549 [2024-12-02 10:11:41,576 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2024-12-02 10:11:41,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2024-12-02 10:11:41,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:11:41,582 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2024-12-02 10:11:41,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2024-12-02 10:11:41,583 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2024-12-02 10:11:41,583 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2024-12-02 10:11:41,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:41,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:41,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:41,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 10:11:41,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 539770538, now seen corresponding path program 1 times [2024-12-02 10:11:41,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:41,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857594319] [2024-12-02 10:11:41,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:11:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857594319] [2024-12-02 10:11:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857594319] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 10:11:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458629744] [2024-12-02 10:11:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:41,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:11:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:41,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:11:41,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:42,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 510 [2024-12-02 10:11:42,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:42,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:42,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 510 [2024-12-02 10:11:42,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:42,772 INFO L124 PetriNetUnfolderBase]: 234/2125 cut-off events. [2024-12-02 10:11:42,773 INFO L125 PetriNetUnfolderBase]: For 139/141 co-relation queries the response was YES. [2024-12-02 10:11:42,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2125 events. 234/2125 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11734 event pairs, 122 based on Foata normal form. 9/1969 useless extension candidates. Maximal degree in co-relation 2670. Up to 245 conditions per place. [2024-12-02 10:11:42,783 INFO L140 encePairwiseOnDemand]: 481/510 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2024-12-02 10:11:42,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2024-12-02 10:11:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:11:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 10:11:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2024-12-02 10:11:42,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709803921568627 [2024-12-02 10:11:42,788 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2024-12-02 10:11:42,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2024-12-02 10:11:42,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:11:42,793 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2024-12-02 10:11:42,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2024-12-02 10:11:42,794 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-12-02 10:11:42,794 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2024-12-02 10:11:42,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:42,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:42,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:42,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 10:11:42,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:42,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash 475647481, now seen corresponding path program 1 times [2024-12-02 10:11:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:42,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299095375] [2024-12-02 10:11:42,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:11:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299095375] [2024-12-02 10:11:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299095375] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198201795] [2024-12-02 10:11:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:42,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:42,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:42,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:42,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 510 [2024-12-02 10:11:42,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:42,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:42,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 510 [2024-12-02 10:11:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:43,074 INFO L124 PetriNetUnfolderBase]: 84/1026 cut-off events. [2024-12-02 10:11:43,075 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2024-12-02 10:11:43,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1026 events. 84/1026 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3151 event pairs, 39 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1272. Up to 125 conditions per place. [2024-12-02 10:11:43,081 INFO L140 encePairwiseOnDemand]: 508/510 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-12-02 10:11:43,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2024-12-02 10:11:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2024-12-02 10:11:43,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9183006535947712 [2024-12-02 10:11:43,083 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2024-12-02 10:11:43,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2024-12-02 10:11:43,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 10:11:43,090 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2024-12-02 10:11:43,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2024-12-02 10:11:43,091 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-12-02 10:11:43,091 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2024-12-02 10:11:43,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:43,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:43,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 10:11:43,092 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 383108662, now seen corresponding path program 1 times [2024-12-02 10:11:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716119947] [2024-12-02 10:11:43,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:11:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716119947] [2024-12-02 10:11:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716119947] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:43,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:11:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30748504] [2024-12-02 10:11:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:43,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:43,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:43,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:43,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:43,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-12-02 10:11:43,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:43,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:43,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-12-02 10:11:43,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:43,575 INFO L124 PetriNetUnfolderBase]: 235/2240 cut-off events. [2024-12-02 10:11:43,575 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2024-12-02 10:11:43,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 2240 events. 235/2240 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13833 event pairs, 61 based on Foata normal form. 4/2098 useless extension candidates. Maximal degree in co-relation 2853. Up to 176 conditions per place. [2024-12-02 10:11:43,587 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2024-12-02 10:11:43,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2024-12-02 10:11:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:11:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2024-12-02 10:11:43,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918954248366013 [2024-12-02 10:11:43,589 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2024-12-02 10:11:43,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2024-12-02 10:11:43,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:11:43,594 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2024-12-02 10:11:43,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2024-12-02 10:11:43,595 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-12-02 10:11:43,595 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2024-12-02 10:11:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:43,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:43,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:43,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 10:11:43,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:43,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1150624392, now seen corresponding path program 1 times [2024-12-02 10:11:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:43,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694159834] [2024-12-02 10:11:43,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:11:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694159834] [2024-12-02 10:11:43,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694159834] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066969165] [2024-12-02 10:11:43,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:43,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:43,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:43,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:43,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 10:11:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:43,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 10:11:43,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:11:44,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:11:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066969165] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:11:44,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:11:44,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-12-02 10:11:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37011665] [2024-12-02 10:11:44,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:11:44,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 10:11:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:44,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 10:11:44,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-12-02 10:11:45,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 510 [2024-12-02 10:11:45,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:45,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:45,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 510 [2024-12-02 10:11:45,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:46,789 INFO L124 PetriNetUnfolderBase]: 447/3267 cut-off events. [2024-12-02 10:11:46,790 INFO L125 PetriNetUnfolderBase]: For 399/409 co-relation queries the response was YES. [2024-12-02 10:11:46,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 3267 events. 447/3267 cut-off events. For 399/409 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21634 event pairs, 201 based on Foata normal form. 9/3024 useless extension candidates. Maximal degree in co-relation 4522. Up to 437 conditions per place. [2024-12-02 10:11:46,802 INFO L140 encePairwiseOnDemand]: 471/510 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2024-12-02 10:11:46,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2024-12-02 10:11:46,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 10:11:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-12-02 10:11:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2024-12-02 10:11:46,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479876160990713 [2024-12-02 10:11:46,809 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2024-12-02 10:11:46,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2024-12-02 10:11:46,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-12-02 10:11:46,815 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2024-12-02 10:11:46,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2024-12-02 10:11:46,816 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2024-12-02 10:11:46,816 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2024-12-02 10:11:46,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:46,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:46,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:46,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 10:11:47,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:47,019 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1973273238, now seen corresponding path program 2 times [2024-12-02 10:11:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510096194] [2024-12-02 10:11:47,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:11:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:47,051 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:11:47,052 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:11:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-02 10:11:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510096194] [2024-12-02 10:11:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510096194] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933886514] [2024-12-02 10:11:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:47,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:47,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:47,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-12-02 10:11:48,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:48,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:48,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-12-02 10:11:48,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:48,897 INFO L124 PetriNetUnfolderBase]: 641/3387 cut-off events. [2024-12-02 10:11:48,898 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-12-02 10:11:48,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 3387 events. 641/3387 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 26074 event pairs, 130 based on Foata normal form. 0/3134 useless extension candidates. Maximal degree in co-relation 5040. Up to 607 conditions per place. [2024-12-02 10:11:48,922 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2024-12-02 10:11:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2024-12-02 10:11:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:11:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:11:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-12-02 10:11:48,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-12-02 10:11:48,927 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2024-12-02 10:11:48,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2024-12-02 10:11:48,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-12-02 10:11:48,934 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2024-12-02 10:11:48,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2024-12-02 10:11:48,935 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2024-12-02 10:11:48,935 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2024-12-02 10:11:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:48,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:48,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:48,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 10:11:48,937 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -892936135, now seen corresponding path program 1 times [2024-12-02 10:11:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669539163] [2024-12-02 10:11:48,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-02 10:11:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669539163] [2024-12-02 10:11:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669539163] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:50,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:50,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-12-02 10:11:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473793191] [2024-12-02 10:11:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 10:11:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:50,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 10:11:50,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-12-02 10:11:54,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-12-02 10:11:54,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:54,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:11:54,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-12-02 10:11:54,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:11:57,742 INFO L124 PetriNetUnfolderBase]: 1610/10075 cut-off events. [2024-12-02 10:11:57,743 INFO L125 PetriNetUnfolderBase]: For 3427/3791 co-relation queries the response was YES. [2024-12-02 10:11:57,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16280 conditions, 10075 events. 1610/10075 cut-off events. For 3427/3791 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 108956 event pairs, 285 based on Foata normal form. 112/9196 useless extension candidates. Maximal degree in co-relation 16232. Up to 859 conditions per place. [2024-12-02 10:11:57,789 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 98 selfloop transitions, 48 changer transitions 0/488 dead transitions. [2024-12-02 10:11:57,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 488 transitions, 1743 flow [2024-12-02 10:11:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 10:11:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-12-02 10:11:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 13672 transitions. [2024-12-02 10:11:57,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8123588829471182 [2024-12-02 10:11:57,799 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 33 states and 13672 transitions. [2024-12-02 10:11:57,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 488 transitions, 1743 flow [2024-12-02 10:11:57,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 488 transitions, 1743 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 10:11:57,808 INFO L231 Difference]: Finished difference. Result has 441 places, 434 transitions, 1356 flow [2024-12-02 10:11:57,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1356, PETRI_PLACES=441, PETRI_TRANSITIONS=434} [2024-12-02 10:11:57,809 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -8 predicate places. [2024-12-02 10:11:57,809 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 434 transitions, 1356 flow [2024-12-02 10:11:57,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:57,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:11:57,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 10:11:57,811 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:11:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1058510201, now seen corresponding path program 2 times [2024-12-02 10:11:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288112595] [2024-12-02 10:11:57,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:11:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:57,851 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:11:57,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:11:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-02 10:11:59,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:59,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288112595] [2024-12-02 10:11:59,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288112595] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:59,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:59,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-12-02 10:11:59,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052085061] [2024-12-02 10:11:59,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:59,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 10:11:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:59,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 10:11:59,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-12-02 10:12:03,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-12-02 10:12:03,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 434 transitions, 1356 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:03,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:12:03,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-12-02 10:12:03,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:12:06,458 INFO L124 PetriNetUnfolderBase]: 2469/12082 cut-off events. [2024-12-02 10:12:06,459 INFO L125 PetriNetUnfolderBase]: For 10762/11723 co-relation queries the response was YES. [2024-12-02 10:12:06,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22889 conditions, 12082 events. 2469/12082 cut-off events. For 10762/11723 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 133408 event pairs, 502 based on Foata normal form. 154/10950 useless extension candidates. Maximal degree in co-relation 22835. Up to 2177 conditions per place. [2024-12-02 10:12:06,545 INFO L140 encePairwiseOnDemand]: 476/510 looper letters, 96 selfloop transitions, 49 changer transitions 0/487 dead transitions. [2024-12-02 10:12:06,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 487 transitions, 1976 flow [2024-12-02 10:12:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 10:12:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-12-02 10:12:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13250 transitions. [2024-12-02 10:12:06,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118872549019608 [2024-12-02 10:12:06,557 INFO L175 Difference]: Start difference. First operand has 441 places, 434 transitions, 1356 flow. Second operand 32 states and 13250 transitions. [2024-12-02 10:12:06,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 487 transitions, 1976 flow [2024-12-02 10:12:06,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 487 transitions, 1925 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-12-02 10:12:06,574 INFO L231 Difference]: Finished difference. Result has 450 places, 453 transitions, 1605 flow [2024-12-02 10:12:06,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1605, PETRI_PLACES=450, PETRI_TRANSITIONS=453} [2024-12-02 10:12:06,574 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 1 predicate places. [2024-12-02 10:12:06,574 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 453 transitions, 1605 flow [2024-12-02 10:12:06,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:06,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:12:06,576 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 10:12:06,576 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:12:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash -933501765, now seen corresponding path program 1 times [2024-12-02 10:12:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358950517] [2024-12-02 10:12:06,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-02 10:12:07,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:07,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358950517] [2024-12-02 10:12:07,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358950517] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:12:07,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:12:07,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:12:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963652616] [2024-12-02 10:12:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:12:07,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:12:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:07,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:12:07,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:12:07,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-12-02 10:12:07,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 453 transitions, 1605 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:07,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:12:07,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-12-02 10:12:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:12:11,990 INFO L124 PetriNetUnfolderBase]: 4655/17778 cut-off events. [2024-12-02 10:12:11,990 INFO L125 PetriNetUnfolderBase]: For 22696/23140 co-relation queries the response was YES. [2024-12-02 10:12:12,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39041 conditions, 17778 events. 4655/17778 cut-off events. For 22696/23140 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 204403 event pairs, 801 based on Foata normal form. 186/16703 useless extension candidates. Maximal degree in co-relation 38986. Up to 3422 conditions per place. [2024-12-02 10:12:12,152 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 76 selfloop transitions, 32 changer transitions 0/498 dead transitions. [2024-12-02 10:12:12,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 498 transitions, 2037 flow [2024-12-02 10:12:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:12:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:12:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-12-02 10:12:12,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-12-02 10:12:12,155 INFO L175 Difference]: Start difference. First operand has 450 places, 453 transitions, 1605 flow. Second operand 6 states and 2703 transitions. [2024-12-02 10:12:12,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 498 transitions, 2037 flow [2024-12-02 10:12:12,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 498 transitions, 1958 flow, removed 14 selfloop flow, removed 26 redundant places. [2024-12-02 10:12:12,192 INFO L231 Difference]: Finished difference. Result has 434 places, 479 transitions, 1862 flow [2024-12-02 10:12:12,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1862, PETRI_PLACES=434, PETRI_TRANSITIONS=479} [2024-12-02 10:12:12,193 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -15 predicate places. [2024-12-02 10:12:12,193 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 479 transitions, 1862 flow [2024-12-02 10:12:12,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:12,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:12:12,195 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 10:12:12,195 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:12:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1673353692, now seen corresponding path program 1 times [2024-12-02 10:12:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186638894] [2024-12-02 10:12:12,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-12-02 10:12:12,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:12,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186638894] [2024-12-02 10:12:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186638894] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:12:12,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:12:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:12:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658925262] [2024-12-02 10:12:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:12:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:12:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:12,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:12:12,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:12:12,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-12-02 10:12:12,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 479 transitions, 1862 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:12,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:12:12,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-12-02 10:12:12,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:12:15,519 INFO L124 PetriNetUnfolderBase]: 3449/15949 cut-off events. [2024-12-02 10:12:15,519 INFO L125 PetriNetUnfolderBase]: For 31847/32372 co-relation queries the response was YES. [2024-12-02 10:12:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 15949 events. 3449/15949 cut-off events. For 31847/32372 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 188755 event pairs, 937 based on Foata normal form. 95/14721 useless extension candidates. Maximal degree in co-relation 37003. Up to 2774 conditions per place. [2024-12-02 10:12:15,644 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 49 selfloop transitions, 2 changer transitions 0/485 dead transitions. [2024-12-02 10:12:15,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 485 transitions, 2004 flow [2024-12-02 10:12:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:12:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:12:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-12-02 10:12:15,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-12-02 10:12:15,645 INFO L175 Difference]: Start difference. First operand has 434 places, 479 transitions, 1862 flow. Second operand 3 states and 1398 transitions. [2024-12-02 10:12:15,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 485 transitions, 2004 flow [2024-12-02 10:12:15,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 485 transitions, 1996 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-12-02 10:12:15,689 INFO L231 Difference]: Finished difference. Result has 435 places, 478 transitions, 1856 flow [2024-12-02 10:12:15,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1856, PETRI_PLACES=435, PETRI_TRANSITIONS=478} [2024-12-02 10:12:15,690 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -14 predicate places. [2024-12-02 10:12:15,690 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 478 transitions, 1856 flow [2024-12-02 10:12:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:15,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:12:15,691 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:15,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 10:12:15,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:12:15,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1813262248, now seen corresponding path program 1 times [2024-12-02 10:12:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:15,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51469141] [2024-12-02 10:12:15,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:15,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 10:12:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51469141] [2024-12-02 10:12:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51469141] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:12:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339895001] [2024-12-02 10:12:16,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:16,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:16,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:12:16,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:12:16,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 10:12:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:16,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:12:16,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:12:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 10:12:16,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:12:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 10:12:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339895001] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:12:17,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:12:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-12-02 10:12:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364470055] [2024-12-02 10:12:17,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:12:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 10:12:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:17,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 10:12:17,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-12-02 10:12:18,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 510 [2024-12-02 10:12:18,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 478 transitions, 1856 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:18,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:12:18,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 510 [2024-12-02 10:12:18,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:12:26,464 INFO L124 PetriNetUnfolderBase]: 7168/29406 cut-off events. [2024-12-02 10:12:26,464 INFO L125 PetriNetUnfolderBase]: For 50150/57462 co-relation queries the response was YES. [2024-12-02 10:12:26,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67192 conditions, 29406 events. 7168/29406 cut-off events. For 50150/57462 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 361176 event pairs, 2305 based on Foata normal form. 820/28068 useless extension candidates. Maximal degree in co-relation 67131. Up to 6160 conditions per place. [2024-12-02 10:12:26,738 INFO L140 encePairwiseOnDemand]: 468/510 looper letters, 130 selfloop transitions, 115 changer transitions 0/613 dead transitions. [2024-12-02 10:12:26,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 613 transitions, 3067 flow [2024-12-02 10:12:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-12-02 10:12:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-12-02 10:12:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2024-12-02 10:12:26,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8394463667820069 [2024-12-02 10:12:26,746 INFO L175 Difference]: Start difference. First operand has 435 places, 478 transitions, 1856 flow. Second operand 34 states and 14556 transitions. [2024-12-02 10:12:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 613 transitions, 3067 flow [2024-12-02 10:12:26,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 613 transitions, 3063 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:12:26,814 INFO L231 Difference]: Finished difference. Result has 476 places, 556 transitions, 2594 flow [2024-12-02 10:12:26,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2594, PETRI_PLACES=476, PETRI_TRANSITIONS=556} [2024-12-02 10:12:26,814 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 27 predicate places. [2024-12-02 10:12:26,814 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 556 transitions, 2594 flow [2024-12-02 10:12:26,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:26,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:12:26,816 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:26,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 10:12:27,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 10:12:27,017 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:12:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1553325264, now seen corresponding path program 1 times [2024-12-02 10:12:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522636239] [2024-12-02 10:12:27,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-02 10:12:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522636239] [2024-12-02 10:12:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522636239] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:12:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690071123] [2024-12-02 10:12:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:28,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:12:28,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:12:28,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 10:12:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:28,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 10:12:28,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:12:28,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 10:12:28,389 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:12:28,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 10:12:28,724 INFO L349 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2024-12-02 10:12:28,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 123 [2024-12-02 10:12:28,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-12-02 10:12:28,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-12-02 10:12:28,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-12-02 10:12:28,895 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 0 case distinctions, treesize of input 57 treesize of output 34 [2024-12-02 10:12:28,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 10:12:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-02 10:12:29,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:12:29,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 132 [2024-12-02 10:12:29,102 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 43 treesize of output 36 [2024-12-02 10:12:29,107 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 98 treesize of output 84 [2024-12-02 10:12:29,113 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 37 treesize of output 30 [2024-12-02 10:12:29,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:12:29,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2024-12-02 10:12:29,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:12:29,154 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 19 treesize of output 12 [2024-12-02 10:12:29,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:12:29,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2024-12-02 10:12:29,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:12:29,165 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 19 treesize of output 12 [2024-12-02 10:12:29,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:12:29,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2024-12-02 10:12:29,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:12:29,176 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 18 treesize of output 12 [2024-12-02 10:12:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-02 10:12:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690071123] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:12:29,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:12:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-12-02 10:12:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779784507] [2024-12-02 10:12:29,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:12:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 10:12:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:29,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 10:12:29,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-12-02 10:12:33,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-12-02 10:12:33,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 556 transitions, 2594 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:33,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:12:33,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-12-02 10:12:33,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:12:41,782 INFO L124 PetriNetUnfolderBase]: 7757/32910 cut-off events. [2024-12-02 10:12:41,782 INFO L125 PetriNetUnfolderBase]: For 72847/76816 co-relation queries the response was YES. [2024-12-02 10:12:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81288 conditions, 32910 events. 7757/32910 cut-off events. For 72847/76816 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 408222 event pairs, 1222 based on Foata normal form. 1026/31685 useless extension candidates. Maximal degree in co-relation 81213. Up to 3507 conditions per place. [2024-12-02 10:12:42,093 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 163 selfloop transitions, 72 changer transitions 0/656 dead transitions. [2024-12-02 10:12:42,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 656 transitions, 3907 flow [2024-12-02 10:12:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-12-02 10:12:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-12-02 10:12:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10480 transitions. [2024-12-02 10:12:42,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8219607843137255 [2024-12-02 10:12:42,101 INFO L175 Difference]: Start difference. First operand has 476 places, 556 transitions, 2594 flow. Second operand 25 states and 10480 transitions. [2024-12-02 10:12:42,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 656 transitions, 3907 flow [2024-12-02 10:12:42,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 656 transitions, 3823 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-12-02 10:12:42,318 INFO L231 Difference]: Finished difference. Result has 500 places, 570 transitions, 2905 flow [2024-12-02 10:12:42,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2506, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2905, PETRI_PLACES=500, PETRI_TRANSITIONS=570} [2024-12-02 10:12:42,319 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 51 predicate places. [2024-12-02 10:12:42,319 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 570 transitions, 2905 flow [2024-12-02 10:12:42,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:42,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:12:42,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:42,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 10:12:42,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 10:12:42,521 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:12:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash 882039216, now seen corresponding path program 2 times [2024-12-02 10:12:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991872477] [2024-12-02 10:12:42,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:12:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:42,656 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:12:42,656 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:12:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-02 10:12:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991872477] [2024-12-02 10:12:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991872477] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:12:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795741766] [2024-12-02 10:12:43,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:12:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:43,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:12:43,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:12:43,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 10:12:44,288 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:12:44,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:12:44,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 10:12:44,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:12:44,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 10:12:44,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:12:44,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 10:12:44,695 INFO L349 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2024-12-02 10:12:44,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 123 [2024-12-02 10:12:44,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-12-02 10:12:44,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-12-02 10:12:44,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2024-12-02 10:12:44,861 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 0 case distinctions, treesize of input 57 treesize of output 34 [2024-12-02 10:12:44,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 10:12:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-02 10:12:44,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:12:44,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 132 [2024-12-02 10:12:44,967 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 44 treesize of output 37 [2024-12-02 10:12:44,969 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 98 treesize of output 84 [2024-12-02 10:12:44,973 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 36 treesize of output 29 [2024-12-02 10:12:44,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:12:44,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2024-12-02 10:12:44,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:12:44,997 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 19 treesize of output 12 [2024-12-02 10:12:44,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:12:45,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2024-12-02 10:12:45,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:12:45,007 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 18 treesize of output 12 [2024-12-02 10:12:45,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:12:45,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2024-12-02 10:12:45,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:12:45,016 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 19 treesize of output 12 [2024-12-02 10:12:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-02 10:12:45,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795741766] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:12:45,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:12:45,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-12-02 10:12:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398740318] [2024-12-02 10:12:45,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:12:45,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 10:12:45,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:45,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 10:12:45,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-12-02 10:12:48,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-12-02 10:12:48,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 570 transitions, 2905 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:48,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:12:48,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-12-02 10:12:48,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:12:56,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1474] L61-4-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][612], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8935#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), 292#L65true, Black: 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), 2475#true, Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 548#true, 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, 576#true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 13#L50-8true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:56,247 INFO L294 olderBase$Statistics]: this new event has 427 ancestors and is cut-off event [2024-12-02 10:12:56,247 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-12-02 10:12:56,247 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2024-12-02 10:12:56,247 INFO L297 olderBase$Statistics]: existing Event has 413 ancestors and is cut-off event [2024-12-02 10:12:57,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1474] L61-4-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][624], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8935#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), 292#L65true, Black: 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 2475#true, Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 548#true, Black: 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, 335#L52-5true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, Black: 576#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:57,171 INFO L294 olderBase$Statistics]: this new event has 439 ancestors and is cut-off event [2024-12-02 10:12:57,171 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2024-12-02 10:12:57,171 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is cut-off event [2024-12-02 10:12:57,171 INFO L297 olderBase$Statistics]: existing Event has 425 ancestors and is cut-off event [2024-12-02 10:12:57,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1474] L61-4-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][629], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8935#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), 292#L65true, Black: 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), 2475#true, Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 548#true, Black: 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, Black: 576#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 258#L52-6true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:57,284 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is cut-off event [2024-12-02 10:12:57,284 INFO L297 olderBase$Statistics]: existing Event has 426 ancestors and is cut-off event [2024-12-02 10:12:57,284 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is cut-off event [2024-12-02 10:12:57,285 INFO L297 olderBase$Statistics]: existing Event has 433 ancestors and is cut-off event [2024-12-02 10:12:57,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1474] L61-4-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][633], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8935#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), 292#L65true, Black: 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 331#L52-7true, Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 2475#true, Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 548#true, Black: 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, Black: 576#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:57,396 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-12-02 10:12:57,396 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-12-02 10:12:57,396 INFO L297 olderBase$Statistics]: existing Event has 434 ancestors and is cut-off event [2024-12-02 10:12:57,396 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2024-12-02 10:12:57,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1426] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 365#L68true, Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 548#true, Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2475#true, Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 501#(= |#race~N~0| 0), 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 535#(= |#race~B~0| 0), 71#L52-9true, 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 8945#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:57,493 INFO L294 olderBase$Statistics]: this new event has 443 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1426] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 325#L61-7true, 548#true, Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 501#(= |#race~N~0| 0), 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 535#(= |#race~B~0| 0), 71#L52-9true, 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 8945#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:57,494 INFO L294 olderBase$Statistics]: this new event has 438 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L297 olderBase$Statistics]: existing Event has 438 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-12-02 10:12:57,494 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is cut-off event [2024-12-02 10:12:57,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1474] L61-4-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][638], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 452#L52-8true, Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8935#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), 292#L65true, Black: 6788#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 6782#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 6780#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 6786#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 6784#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4594#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4592#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2498#(<= ~N~0 2), Black: 3481#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), 2475#true, Black: 4630#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4586#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4590#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 2499#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4628#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4578#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2464#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 522#(= |#race~A~0| 0), Black: 2468#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2466#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 548#true, Black: 2480#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2478#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2479#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, Black: 576#true, Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2383#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 330#L108-4true, Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 2489#true, 2470#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-12-02 10:12:57,495 INFO L294 olderBase$Statistics]: this new event has 442 ancestors and is cut-off event [2024-12-02 10:12:57,495 INFO L297 olderBase$Statistics]: existing Event has 442 ancestors and is cut-off event [2024-12-02 10:12:57,495 INFO L297 olderBase$Statistics]: existing Event has 435 ancestors and is cut-off event [2024-12-02 10:12:57,495 INFO L297 olderBase$Statistics]: existing Event has 428 ancestors and is cut-off event [2024-12-02 10:12:59,291 INFO L124 PetriNetUnfolderBase]: 8860/39956 cut-off events. [2024-12-02 10:12:59,292 INFO L125 PetriNetUnfolderBase]: For 116939/119905 co-relation queries the response was YES. [2024-12-02 10:12:59,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102127 conditions, 39956 events. 8860/39956 cut-off events. For 116939/119905 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 520398 event pairs, 1069 based on Foata normal form. 1297/38532 useless extension candidates. Maximal degree in co-relation 102046. Up to 4942 conditions per place. [2024-12-02 10:12:59,696 INFO L140 encePairwiseOnDemand]: 479/510 looper letters, 126 selfloop transitions, 110 changer transitions 0/657 dead transitions. [2024-12-02 10:12:59,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 657 transitions, 4129 flow [2024-12-02 10:12:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-12-02 10:12:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-12-02 10:12:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 10898 transitions. [2024-12-02 10:12:59,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8218702865761689 [2024-12-02 10:12:59,701 INFO L175 Difference]: Start difference. First operand has 500 places, 570 transitions, 2905 flow. Second operand 26 states and 10898 transitions. [2024-12-02 10:12:59,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 657 transitions, 4129 flow [2024-12-02 10:12:59,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 657 transitions, 4068 flow, removed 1 selfloop flow, removed 19 redundant places. [2024-12-02 10:12:59,990 INFO L231 Difference]: Finished difference. Result has 510 places, 599 transitions, 3541 flow [2024-12-02 10:12:59,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2847, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3541, PETRI_PLACES=510, PETRI_TRANSITIONS=599} [2024-12-02 10:12:59,991 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 61 predicate places. [2024-12-02 10:12:59,991 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 599 transitions, 3541 flow [2024-12-02 10:12:59,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:12:59,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:12:59,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:59,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 10:13:00,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 10:13:00,193 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:13:00,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1811212939, now seen corresponding path program 1 times [2024-12-02 10:13:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876544065] [2024-12-02 10:13:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-02 10:13:00,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:00,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876544065] [2024-12-02 10:13:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876544065] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:13:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:13:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:13:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116389489] [2024-12-02 10:13:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:13:00,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:13:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:00,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:13:00,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:13:00,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-12-02 10:13:00,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 599 transitions, 3541 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:13:00,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:13:00,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-12-02 10:13:00,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:13:08,738 INFO L124 PetriNetUnfolderBase]: 7128/31560 cut-off events. [2024-12-02 10:13:08,739 INFO L125 PetriNetUnfolderBase]: For 118957/120363 co-relation queries the response was YES. [2024-12-02 10:13:09,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86577 conditions, 31560 events. 7128/31560 cut-off events. For 118957/120363 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 396060 event pairs, 2098 based on Foata normal form. 233/29844 useless extension candidates. Maximal degree in co-relation 86495. Up to 5855 conditions per place. [2024-12-02 10:13:09,088 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 60 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-12-02 10:13:09,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 606 transitions, 3721 flow [2024-12-02 10:13:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:13:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:13:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-12-02 10:13:09,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-12-02 10:13:09,090 INFO L175 Difference]: Start difference. First operand has 510 places, 599 transitions, 3541 flow. Second operand 3 states and 1398 transitions. [2024-12-02 10:13:09,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 606 transitions, 3721 flow [2024-12-02 10:13:09,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 606 transitions, 3608 flow, removed 15 selfloop flow, removed 19 redundant places. [2024-12-02 10:13:09,345 INFO L231 Difference]: Finished difference. Result has 492 places, 598 transitions, 3430 flow [2024-12-02 10:13:09,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3430, PETRI_PLACES=492, PETRI_TRANSITIONS=598} [2024-12-02 10:13:09,346 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 43 predicate places. [2024-12-02 10:13:09,346 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 598 transitions, 3430 flow [2024-12-02 10:13:09,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:13:09,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:13:09,346 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:13:09,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 10:13:09,347 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:13:09,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 929107771, now seen corresponding path program 1 times [2024-12-02 10:13:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61859237] [2024-12-02 10:13:09,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 10:13:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61859237] [2024-12-02 10:13:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61859237] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:13:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060408284] [2024-12-02 10:13:09,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:13:09,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:13:09,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 10:13:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:09,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:13:09,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:13:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 10:13:10,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:13:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-02 10:13:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060408284] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:13:10,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:13:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-12-02 10:13:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223618381] [2024-12-02 10:13:10,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:13:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 10:13:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:10,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 10:13:10,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-12-02 10:13:13,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 510 [2024-12-02 10:13:13,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 598 transitions, 3430 flow. Second operand has 30 states, 30 states have (on average 425.8666666666667) internal successors, (12776), 30 states have internal predecessors, (12776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:13:13,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:13:13,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 510 [2024-12-02 10:13:13,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:13:21,159 INFO L124 PetriNetUnfolderBase]: 6005/27918 cut-off events. [2024-12-02 10:13:21,159 INFO L125 PetriNetUnfolderBase]: For 109027/109577 co-relation queries the response was YES. [2024-12-02 10:13:21,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81510 conditions, 27918 events. 6005/27918 cut-off events. For 109027/109577 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 337885 event pairs, 1758 based on Foata normal form. 212/26758 useless extension candidates. Maximal degree in co-relation 81426. Up to 5028 conditions per place. [2024-12-02 10:13:21,465 INFO L140 encePairwiseOnDemand]: 469/510 looper letters, 108 selfloop transitions, 45 changer transitions 151/689 dead transitions. [2024-12-02 10:13:21,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 689 transitions, 4878 flow [2024-12-02 10:13:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-12-02 10:13:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-12-02 10:13:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14565 transitions. [2024-12-02 10:13:21,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8399653979238755 [2024-12-02 10:13:21,472 INFO L175 Difference]: Start difference. First operand has 492 places, 598 transitions, 3430 flow. Second operand 34 states and 14565 transitions. [2024-12-02 10:13:21,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 689 transitions, 4878 flow [2024-12-02 10:13:21,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 689 transitions, 4872 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 10:13:21,780 INFO L231 Difference]: Finished difference. Result has 528 places, 526 transitions, 2949 flow [2024-12-02 10:13:21,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=3387, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2949, PETRI_PLACES=528, PETRI_TRANSITIONS=526} [2024-12-02 10:13:21,781 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 79 predicate places. [2024-12-02 10:13:21,781 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 526 transitions, 2949 flow [2024-12-02 10:13:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.8666666666667) internal successors, (12776), 30 states have internal predecessors, (12776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:13:21,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:13:21,782 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:13:21,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 10:13:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 10:13:21,983 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:13:21,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 387580490, now seen corresponding path program 2 times [2024-12-02 10:13:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774656539] [2024-12-02 10:13:21,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:13:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:22,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:13:22,132 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:13:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-12-02 10:13:25,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774656539] [2024-12-02 10:13:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774656539] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:13:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587553652] [2024-12-02 10:13:25,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:13:25,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:25,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:13:25,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:13:25,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 10:13:26,567 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:13:26,567 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:13:26,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-12-02 10:13:26,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:13:26,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 10:13:26,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:13:26,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 10:13:28,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-12-02 10:13:28,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-12-02 10:13:28,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2024-12-02 10:13:28,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2024-12-02 10:13:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 187 [2024-12-02 10:13:28,707 INFO L349 Elim1Store]: treesize reduction 313, result has 10.3 percent of original size [2024-12-02 10:13:28,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 257 treesize of output 285 [2024-12-02 10:13:28,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 83 [2024-12-02 10:13:28,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:28,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:28,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:28,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:28,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 1 [2024-12-02 10:13:28,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:28,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:13:29,015 INFO L224 Elim1Store]: Index analysis took 110 ms [2024-12-02 10:13:29,114 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:29,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:29,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:29,116 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:29,198 INFO L349 Elim1Store]: treesize reduction 317, result has 20.6 percent of original size [2024-12-02 10:13:29,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 56 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 153 [2024-12-02 10:13:29,353 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 0 case distinctions, treesize of input 260 treesize of output 229 [2024-12-02 10:13:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-12-02 10:13:34,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:13:34,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_thread2Thread1of1ForFork2_~i~1#1| 4))) (let ((.cse1 (+ .cse10 c_~C~0.offset)) (.cse2 (+ .cse10 c_~C~0.offset 1)) (.cse3 (+ .cse10 2 c_~C~0.offset)) (.cse4 (+ .cse10 3 c_~C~0.offset)) (.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse10 c_~A~0.offset) 0) (+ .cse10 c_~A~0.offset 1) 0) (+ .cse10 c_~A~0.offset 2) 0) (+ .cse10 c_~A~0.offset 3) 0))) (.cse6 (* c_thread1Thread1of1ForFork1_~i~0 4))) (and (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset 2 .cse6)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset .cse6 1)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse8 ~C~0.base (store (store (store (store (select .cse8 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse9 ~C~0.base (store (store (store (store (select .cse9 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset .cse6 3)) 0))))) is different from false [2024-12-02 10:13:34,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse10 (+ c_~A~0.offset .cse6 3)) (.cse11 (* |c_thread2Thread1of1ForFork2_~i~1#1| 4))) (let ((.cse1 (+ .cse11 c_~C~0.offset)) (.cse2 (+ .cse11 c_~C~0.offset 1)) (.cse3 (+ .cse11 2 c_~C~0.offset)) (.cse4 (+ .cse11 3 c_~C~0.offset)) (.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse10 0) (+ .cse11 c_~A~0.offset) 0) (+ .cse11 c_~A~0.offset 1) 0) (+ .cse11 c_~A~0.offset 2) 0) (+ .cse11 c_~A~0.offset 3) 0)))) (and (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset .cse6 1)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset 2 .cse6)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse8 ~C~0.base (store (store (store (store (select .cse8 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse9 ~C~0.base (store (store (store (store (select .cse9 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) .cse10) 0)))))) is different from false [2024-12-02 10:13:37,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse12 (+ c_~A~0.offset .cse8 1)) (.cse6 (+ c_~A~0.offset 2 .cse8)) (.cse10 (+ c_~A~0.offset .cse8 3)) (.cse13 (* |c_thread2Thread1of1ForFork2_~i~1#1| 4))) (let ((.cse1 (+ .cse13 c_~C~0.offset)) (.cse2 (+ .cse13 c_~C~0.offset 1)) (.cse3 (+ .cse13 2 c_~C~0.offset)) (.cse4 (+ .cse13 3 c_~C~0.offset)) (.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse12 0) .cse6 0) .cse10 0) (+ .cse13 c_~A~0.offset) 0) (+ .cse13 c_~A~0.offset 1) 0) (+ .cse13 c_~A~0.offset 2) 0) (+ .cse13 c_~A~0.offset 3) 0)))) (and (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) .cse6) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) (+ c_~A~0.offset .cse8)) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse9 ~C~0.base (store (store (store (store (select .cse9 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) .cse10) 0)) (forall ((v_ArrVal_2618 Int) (v_ArrVal_2621 Int) (v_ArrVal_2620 Int) (v_ArrVal_2623 Int) (~C~0.base Int) (v_ArrVal_2619 (Array Int Int))) (= 0 (select (select (let ((.cse11 (store .cse5 c_~B~0.base v_ArrVal_2619))) (store .cse11 ~C~0.base (store (store (store (store (select .cse11 ~C~0.base) .cse1 v_ArrVal_2618) .cse2 v_ArrVal_2620) .cse3 v_ArrVal_2623) .cse4 v_ArrVal_2621))) c_~A~0.base) .cse12))))))) is different from false [2024-12-02 10:13:38,156 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-12-02 10:13:38,157 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 8 case distinctions, treesize of input 188 treesize of output 157 [2024-12-02 10:13:38,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 10:13:38,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 532 treesize of output 510 [2024-12-02 10:13:38,181 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 31901 treesize of output 31439 [2024-12-02 10:13:38,294 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-12-02 10:13:38,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 33 [2024-12-02 10:13:38,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 10:13:38,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 7961 treesize of output 7827 [2024-12-02 10:13:38,861 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-12-02 10:13:38,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 25 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 188 treesize of output 157 [2024-12-02 10:13:38,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:38,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:13:38,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 240 treesize of output 222 [2024-12-02 10:13:38,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:38,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:38,888 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 111 treesize of output 104 [2024-12-02 10:13:38,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:38,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:38,910 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-12-02 10:13:38,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 138 [2024-12-02 10:13:39,228 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-12-02 10:13:39,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 25 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 187 treesize of output 156 [2024-12-02 10:13:39,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:13:39,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 236 treesize of output 218 [2024-12-02 10:13:39,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,264 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-12-02 10:13:39,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 76 [2024-12-02 10:13:39,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 10:13:39,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-12-02 10:13:39,325 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-12-02 10:13:39,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 25 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 188 treesize of output 1 [2024-12-02 10:13:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-12-02 10:13:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587553652] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:13:42,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:13:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 25] total 74 [2024-12-02 10:13:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718047409] [2024-12-02 10:13:42,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:13:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-12-02 10:13:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:42,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-12-02 10:13:42,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4832, Unknown=22, NotChecked=426, Total=5550 [2024-12-02 10:13:42,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 510 [2024-12-02 10:13:42,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 526 transitions, 2949 flow. Second operand has 75 states, 75 states have (on average 242.66666666666666) internal successors, (18200), 75 states have internal predecessors, (18200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:13:42,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:13:42,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 510 [2024-12-02 10:13:42,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:14:12,787 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 [0] [2024-12-02 10:14:16,883 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 [0] [2024-12-02 10:14:19,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:14:24,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:14:28,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:14:32,328 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 [0] [2024-12-02 10:14:43,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:14:49,330 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 [0] [2024-12-02 10:14:55,560 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 [0] [2024-12-02 10:15:04,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:07,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:09,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:12,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:14,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:18,452 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 [0] [2024-12-02 10:15:22,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:26,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:32,493 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 [0] [2024-12-02 10:15:36,503 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 [0] [2024-12-02 10:15:40,610 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 [0] [2024-12-02 10:15:46,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:50,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:15:57,736 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 [0] [2024-12-02 10:16:01,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:16:20,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:16:24,888 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 [0] [2024-12-02 10:16:29,272 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 [0] [2024-12-02 10:16:33,536 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 [0] [2024-12-02 10:16:36,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:16:38,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:16:43,034 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 [0] [2024-12-02 10:16:46,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:16:51,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:16:55,898 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 [0] [2024-12-02 10:17:00,367 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 [0] [2024-12-02 10:17:04,474 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 [0] [2024-12-02 10:17:08,887 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 [0] [2024-12-02 10:17:14,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:18,975 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 [0] [2024-12-02 10:17:24,068 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 [0] [2024-12-02 10:17:28,521 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 [0] [2024-12-02 10:17:32,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:35,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:37,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:41,424 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 [0] [2024-12-02 10:17:45,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:48,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:52,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:17:56,793 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 [0] [2024-12-02 10:17:59,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:04,161 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 [0] [2024-12-02 10:18:07,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:10,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:14,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:19,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:23,193 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 [0] [2024-12-02 10:18:27,244 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 [0] [2024-12-02 10:18:29,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:34,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:39,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:43,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:47,078 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 [0] [2024-12-02 10:18:52,360 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 [0] [2024-12-02 10:18:56,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:18:59,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:03,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:07,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:11,800 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 [0] [2024-12-02 10:19:17,557 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 [0] [2024-12-02 10:19:22,100 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 [0] [2024-12-02 10:19:26,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:30,306 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 [0] [2024-12-02 10:19:34,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:38,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:45,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:19:49,870 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 [0] [2024-12-02 10:19:55,140 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 [0] [2024-12-02 10:19:59,495 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 [0] [2024-12-02 10:20:03,513 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 [0] [2024-12-02 10:20:07,623 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 [0] [2024-12-02 10:20:09,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:13,821 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 [0] [2024-12-02 10:20:19,718 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 [0] [2024-12-02 10:20:24,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:29,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:30,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-12-02 10:20:34,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:39,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:43,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:47,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:50,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:54,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:20:59,588 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 [0] [2024-12-02 10:21:04,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:08,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:15,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:19,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:25,626 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 [0] [2024-12-02 10:21:29,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:35,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:39,353 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 [0] [2024-12-02 10:21:43,564 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 [0] [2024-12-02 10:21:49,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:54,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 [0] [2024-12-02 10:21:57,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:21:59,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:02,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:07,061 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 [0] [2024-12-02 10:22:12,180 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 [0] [2024-12-02 10:22:16,231 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 [0] [2024-12-02 10:22:20,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:21,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:25,945 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 [0] [2024-12-02 10:22:27,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:31,983 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 [0] [2024-12-02 10:22:38,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:42,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:46,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-12-02 10:22:48,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:55,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:22:59,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 10:23:36,223 INFO L124 PetriNetUnfolderBase]: 102216/187707 cut-off events. [2024-12-02 10:23:36,223 INFO L125 PetriNetUnfolderBase]: For 458871/458871 co-relation queries the response was YES. [2024-12-02 10:23:38,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558541 conditions, 187707 events. 102216/187707 cut-off events. For 458871/458871 co-relation queries the response was YES. Maximal size of possible extension queue 4556. Compared 2106027 event pairs, 5118 based on Foata normal form. 140/170804 useless extension candidates. Maximal degree in co-relation 558442. Up to 32838 conditions per place. [2024-12-02 10:23:38,775 INFO L140 encePairwiseOnDemand]: 434/510 looper letters, 1038 selfloop transitions, 349 changer transitions 2/1593 dead transitions. [2024-12-02 10:23:38,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 1593 transitions, 12436 flow [2024-12-02 10:23:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-12-02 10:23:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2024-12-02 10:23:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 18983 transitions. [2024-12-02 10:23:38,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48975748194014446 [2024-12-02 10:23:38,788 INFO L175 Difference]: Start difference. First operand has 528 places, 526 transitions, 2949 flow. Second operand 76 states and 18983 transitions. [2024-12-02 10:23:38,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 1593 transitions, 12436 flow [2024-12-02 10:23:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1593 transitions, 11917 flow, removed 165 selfloop flow, removed 27 redundant places. [2024-12-02 10:23:57,598 INFO L231 Difference]: Finished difference. Result has 565 places, 783 transitions, 6467 flow [2024-12-02 10:23:57,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2740, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=6467, PETRI_PLACES=565, PETRI_TRANSITIONS=783} [2024-12-02 10:23:57,600 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 116 predicate places. [2024-12-02 10:23:57,600 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 783 transitions, 6467 flow [2024-12-02 10:23:57,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 242.66666666666666) internal successors, (18200), 75 states have internal predecessors, (18200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:23:57,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:23:57,602 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:23:57,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-02 10:23:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:23:57,803 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-12-02 10:23:57,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:23:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash 422506900, now seen corresponding path program 3 times [2024-12-02 10:23:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:23:57,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452813242] [2024-12-02 10:23:57,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:23:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:23:58,166 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-12-02 10:23:58,167 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:24:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-12-02 10:24:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:24:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452813242] [2024-12-02 10:24:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452813242] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:24:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785598965] [2024-12-02 10:24:08,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:24:08,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:24:08,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:24:08,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:24:08,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eac9a3d8-0ce4-441e-bafa-41ccea1c785f/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process