./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:09:32,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:09:32,376 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 19:09:32,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:09:32,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:09:32,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:09:32,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:09:32,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:09:32,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:09:32,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:09:32,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:09:32,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:09:32,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:09:32,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:09:32,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:09:32,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:09:32,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:09:32,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:09:32,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:09:32,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:09:32,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:09:32,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:09:32,420 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 19:09:32,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:09:32,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:09:32,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:09:32,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:09:32,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:09:32,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:09:32,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:09:32,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:09:32,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:09:32,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:09:32,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:09:32,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:09:32,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:09:32,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:09:32,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:09:32,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:09:32,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:09:32,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:09:32,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2024-11-08 19:09:32,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:09:32,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:09:32,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:09:32,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:09:32,747 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:09:32,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c Unable to find full path for "g++" [2024-11-08 19:09:34,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:09:34,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:09:34,929 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-08 19:09:34,938 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/data/6a85d4cb7/df3c9643e69445428f99dedd75b0a94c/FLAGe6c6d7b70 [2024-11-08 19:09:34,958 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/data/6a85d4cb7/df3c9643e69445428f99dedd75b0a94c [2024-11-08 19:09:34,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:09:34,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:09:34,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:09:34,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:09:34,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:09:34,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:09:34" (1/1) ... [2024-11-08 19:09:34,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32da6c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:34, skipping insertion in model container [2024-11-08 19:09:34,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:09:34" (1/1) ... [2024-11-08 19:09:35,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:09:35,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:09:35,256 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:09:35,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:09:35,312 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:09:35,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35 WrapperNode [2024-11-08 19:09:35,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:09:35,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:09:35,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:09:35,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:09:35,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,364 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 186 [2024-11-08 19:09:35,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:09:35,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:09:35,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:09:35,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:09:35,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:09:35,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:09:35,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:09:35,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:09:35,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (1/1) ... [2024-11-08 19:09:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:09:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:09:35,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:09:35,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:09:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:09:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 19:09:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 19:09:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 19:09:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 19:09:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 19:09:35,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 19:09:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:09:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:09:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 19:09:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 19:09:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 19:09:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:09:35,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:09:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:09:35,497 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 19:09:35,607 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:09:35,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:09:36,289 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:09:36,289 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:09:36,537 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:09:36,537 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 19:09:36,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:09:36 BoogieIcfgContainer [2024-11-08 19:09:36,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:09:36,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:09:36,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:09:36,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:09:36,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:09:34" (1/3) ... [2024-11-08 19:09:36,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdee1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:09:36, skipping insertion in model container [2024-11-08 19:09:36,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:09:35" (2/3) ... [2024-11-08 19:09:36,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdee1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:09:36, skipping insertion in model container [2024-11-08 19:09:36,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:09:36" (3/3) ... [2024-11-08 19:09:36,552 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-11-08 19:09:36,571 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:09:36,572 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-08 19:09:36,572 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:09:36,700 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 19:09:36,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 347 transitions, 715 flow [2024-11-08 19:09:36,942 INFO L124 PetriNetUnfolderBase]: 20/344 cut-off events. [2024-11-08 19:09:36,942 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 19:09:36,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 344 events. 20/344 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 464 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2024-11-08 19:09:36,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 347 transitions, 715 flow [2024-11-08 19:09:36,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 327 transitions, 672 flow [2024-11-08 19:09:36,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:09:36,990 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;@4418ee53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:09:36,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-08 19:09:36,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:09:36,997 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-08 19:09:36,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:09:36,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:36,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:37,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:37,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1561691004, now seen corresponding path program 1 times [2024-11-08 19:09:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773021484] [2024-11-08 19:09:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773021484] [2024-11-08 19:09:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773021484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:37,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948736867] [2024-11-08 19:09:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:37,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:37,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:37,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 347 [2024-11-08 19:09:37,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 327 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:37,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:37,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 347 [2024-11-08 19:09:37,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:37,730 INFO L124 PetriNetUnfolderBase]: 88/890 cut-off events. [2024-11-08 19:09:37,730 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-08 19:09:37,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 890 events. 88/890 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4496 event pairs, 51 based on Foata normal form. 6/749 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2024-11-08 19:09:37,746 INFO L140 encePairwiseOnDemand]: 323/347 looper letters, 18 selfloop transitions, 2 changer transitions 6/305 dead transitions. [2024-11-08 19:09:37,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 305 transitions, 668 flow [2024-11-08 19:09:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2024-11-08 19:09:37,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9106628242074928 [2024-11-08 19:09:37,774 INFO L175 Difference]: Start difference. First operand has 318 places, 327 transitions, 672 flow. Second operand 3 states and 948 transitions. [2024-11-08 19:09:37,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 305 transitions, 668 flow [2024-11-08 19:09:37,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 305 transitions, 656 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 19:09:37,788 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 608 flow [2024-11-08 19:09:37,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2024-11-08 19:09:37,824 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -17 predicate places. [2024-11-08 19:09:37,824 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 608 flow [2024-11-08 19:09:37,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:37,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:37,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:37,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:09:37,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 145741639, now seen corresponding path program 1 times [2024-11-08 19:09:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:37,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450932698] [2024-11-08 19:09:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450932698] [2024-11-08 19:09:37,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450932698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:37,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:37,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372553255] [2024-11-08 19:09:37,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:37,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:37,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:37,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:37,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:37,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 347 [2024-11-08 19:09:37,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:37,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:37,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 347 [2024-11-08 19:09:37,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:38,257 INFO L124 PetriNetUnfolderBase]: 216/1001 cut-off events. [2024-11-08 19:09:38,257 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-08 19:09:38,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 1001 events. 216/1001 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5265 event pairs, 128 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1287. Up to 297 conditions per place. [2024-11-08 19:09:38,268 INFO L140 encePairwiseOnDemand]: 340/347 looper letters, 21 selfloop transitions, 1 changer transitions 0/293 dead transitions. [2024-11-08 19:09:38,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 293 transitions, 640 flow [2024-11-08 19:09:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-11-08 19:09:38,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8799231508165226 [2024-11-08 19:09:38,273 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 608 flow. Second operand 3 states and 916 transitions. [2024-11-08 19:09:38,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 293 transitions, 640 flow [2024-11-08 19:09:38,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 293 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:09:38,283 INFO L231 Difference]: Finished difference. Result has 289 places, 293 transitions, 594 flow [2024-11-08 19:09:38,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=289, PETRI_TRANSITIONS=293} [2024-11-08 19:09:38,285 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -29 predicate places. [2024-11-08 19:09:38,285 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 293 transitions, 594 flow [2024-11-08 19:09:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:38,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:38,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:38,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:09:38,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:38,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2049516456, now seen corresponding path program 1 times [2024-11-08 19:09:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:38,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687238374] [2024-11-08 19:09:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:38,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687238374] [2024-11-08 19:09:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687238374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127701360] [2024-11-08 19:09:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:38,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:38,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:38,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:38,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 347 [2024-11-08 19:09:38,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 293 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:38,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:38,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 347 [2024-11-08 19:09:38,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:38,632 INFO L124 PetriNetUnfolderBase]: 48/448 cut-off events. [2024-11-08 19:09:38,632 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 19:09:38,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 448 events. 48/448 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1331 event pairs, 23 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 494. Up to 67 conditions per place. [2024-11-08 19:09:38,636 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 13 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-11-08 19:09:38,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 292 transitions, 622 flow [2024-11-08 19:09:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-11-08 19:09:38,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9000960614793467 [2024-11-08 19:09:38,640 INFO L175 Difference]: Start difference. First operand has 289 places, 293 transitions, 594 flow. Second operand 3 states and 937 transitions. [2024-11-08 19:09:38,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 292 transitions, 622 flow [2024-11-08 19:09:38,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 292 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 19:09:38,648 INFO L231 Difference]: Finished difference. Result has 289 places, 292 transitions, 595 flow [2024-11-08 19:09:38,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=289, PETRI_TRANSITIONS=292} [2024-11-08 19:09:38,651 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -29 predicate places. [2024-11-08 19:09:38,651 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 292 transitions, 595 flow [2024-11-08 19:09:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:38,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:38,653 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:38,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:09:38,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1368585426, now seen corresponding path program 1 times [2024-11-08 19:09:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332589572] [2024-11-08 19:09:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332589572] [2024-11-08 19:09:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332589572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:09:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778976535] [2024-11-08 19:09:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:39,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:09:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:09:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:09:39,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 347 [2024-11-08 19:09:39,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 292 transitions, 595 flow. Second operand has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:39,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:39,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 347 [2024-11-08 19:09:39,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:40,278 INFO L124 PetriNetUnfolderBase]: 160/979 cut-off events. [2024-11-08 19:09:40,279 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-08 19:09:40,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 979 events. 160/979 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4911 event pairs, 100 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1258. Up to 263 conditions per place. [2024-11-08 19:09:40,287 INFO L140 encePairwiseOnDemand]: 329/347 looper letters, 41 selfloop transitions, 15 changer transitions 0/289 dead transitions. [2024-11-08 19:09:40,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 289 transitions, 701 flow [2024-11-08 19:09:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:09:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:09:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2024-11-08 19:09:40,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7920268972142172 [2024-11-08 19:09:40,291 INFO L175 Difference]: Start difference. First operand has 289 places, 292 transitions, 595 flow. Second operand 6 states and 1649 transitions. [2024-11-08 19:09:40,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 289 transitions, 701 flow [2024-11-08 19:09:40,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:09:40,324 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 615 flow [2024-11-08 19:09:40,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2024-11-08 19:09:40,327 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -29 predicate places. [2024-11-08 19:09:40,328 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 615 flow [2024-11-08 19:09:40,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:40,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:40,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:40,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:09:40,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:40,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 640211648, now seen corresponding path program 1 times [2024-11-08 19:09:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871792960] [2024-11-08 19:09:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:40,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871792960] [2024-11-08 19:09:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871792960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:40,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244506350] [2024-11-08 19:09:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:40,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:40,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 347 [2024-11-08 19:09:40,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:40,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:40,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 347 [2024-11-08 19:09:40,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:40,557 INFO L124 PetriNetUnfolderBase]: 48/444 cut-off events. [2024-11-08 19:09:40,558 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 19:09:40,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 444 events. 48/444 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1313 event pairs, 23 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 505. Up to 67 conditions per place. [2024-11-08 19:09:40,561 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 13 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-08 19:09:40,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 288 transitions, 643 flow [2024-11-08 19:09:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-11-08 19:09:40,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9000960614793467 [2024-11-08 19:09:40,564 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 615 flow. Second operand 3 states and 937 transitions. [2024-11-08 19:09:40,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 288 transitions, 643 flow [2024-11-08 19:09:40,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 288 transitions, 613 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 19:09:40,569 INFO L231 Difference]: Finished difference. Result has 285 places, 288 transitions, 587 flow [2024-11-08 19:09:40,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=587, PETRI_PLACES=285, PETRI_TRANSITIONS=288} [2024-11-08 19:09:40,571 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -33 predicate places. [2024-11-08 19:09:40,571 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 288 transitions, 587 flow [2024-11-08 19:09:40,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:40,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:40,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:40,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:09:40,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1117301975, now seen corresponding path program 1 times [2024-11-08 19:09:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:40,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964797446] [2024-11-08 19:09:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:40,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:40,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964797446] [2024-11-08 19:09:40,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964797446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:40,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163822297] [2024-11-08 19:09:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:40,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:40,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:40,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-08 19:09:40,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 288 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:40,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:40,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-08 19:09:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:40,777 INFO L124 PetriNetUnfolderBase]: 31/358 cut-off events. [2024-11-08 19:09:40,777 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 19:09:40,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 358 events. 31/358 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 786 event pairs, 12 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 380. Up to 44 conditions per place. [2024-11-08 19:09:40,780 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 12 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-08 19:09:40,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 287 transitions, 613 flow [2024-11-08 19:09:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2024-11-08 19:09:40,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020172910662824 [2024-11-08 19:09:40,783 INFO L175 Difference]: Start difference. First operand has 285 places, 288 transitions, 587 flow. Second operand 3 states and 939 transitions. [2024-11-08 19:09:40,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 287 transitions, 613 flow [2024-11-08 19:09:40,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:09:40,789 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 585 flow [2024-11-08 19:09:40,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2024-11-08 19:09:40,790 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -34 predicate places. [2024-11-08 19:09:40,790 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 585 flow [2024-11-08 19:09:40,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:40,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:40,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:40,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:09:40,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1013408963, now seen corresponding path program 1 times [2024-11-08 19:09:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893218095] [2024-11-08 19:09:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893218095] [2024-11-08 19:09:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893218095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:40,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:40,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202116272] [2024-11-08 19:09:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:40,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:40,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:40,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-08 19:09:40,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:40,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:40,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-08 19:09:40,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:41,103 INFO L124 PetriNetUnfolderBase]: 76/581 cut-off events. [2024-11-08 19:09:41,103 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 19:09:41,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 581 events. 76/581 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2296 event pairs, 23 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 679. Up to 64 conditions per place. [2024-11-08 19:09:41,107 INFO L140 encePairwiseOnDemand]: 342/347 looper letters, 16 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2024-11-08 19:09:41,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 290 transitions, 631 flow [2024-11-08 19:09:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 945 transitions. [2024-11-08 19:09:41,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9077809798270894 [2024-11-08 19:09:41,110 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 585 flow. Second operand 3 states and 945 transitions. [2024-11-08 19:09:41,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 290 transitions, 631 flow [2024-11-08 19:09:41,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 290 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:09:41,118 INFO L231 Difference]: Finished difference. Result has 282 places, 285 transitions, 583 flow [2024-11-08 19:09:41,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=282, PETRI_TRANSITIONS=285} [2024-11-08 19:09:41,122 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -36 predicate places. [2024-11-08 19:09:41,122 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 285 transitions, 583 flow [2024-11-08 19:09:41,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:41,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:41,123 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:41,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:09:41,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:41,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1071593215, now seen corresponding path program 1 times [2024-11-08 19:09:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:41,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788969661] [2024-11-08 19:09:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:41,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788969661] [2024-11-08 19:09:41,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788969661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433144557] [2024-11-08 19:09:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:41,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:41,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:41,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 347 [2024-11-08 19:09:41,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 285 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:41,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:41,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 347 [2024-11-08 19:09:41,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:41,412 INFO L124 PetriNetUnfolderBase]: 79/771 cut-off events. [2024-11-08 19:09:41,412 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-08 19:09:41,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 771 events. 79/771 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3543 event pairs, 8 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 884. Up to 99 conditions per place. [2024-11-08 19:09:41,418 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 19 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-08 19:09:41,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 646 flow [2024-11-08 19:09:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2024-11-08 19:09:41,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173871277617676 [2024-11-08 19:09:41,421 INFO L175 Difference]: Start difference. First operand has 282 places, 285 transitions, 583 flow. Second operand 3 states and 955 transitions. [2024-11-08 19:09:41,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 646 flow [2024-11-08 19:09:41,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:09:41,428 INFO L231 Difference]: Finished difference. Result has 282 places, 286 transitions, 589 flow [2024-11-08 19:09:41,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=282, PETRI_TRANSITIONS=286} [2024-11-08 19:09:41,431 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -36 predicate places. [2024-11-08 19:09:41,431 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 286 transitions, 589 flow [2024-11-08 19:09:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:41,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:41,433 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:41,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:09:41,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1920542179, now seen corresponding path program 1 times [2024-11-08 19:09:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005781566] [2024-11-08 19:09:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005781566] [2024-11-08 19:09:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005781566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:41,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:41,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:09:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770426044] [2024-11-08 19:09:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:41,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:09:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:09:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:09:42,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 347 [2024-11-08 19:09:42,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 286 transitions, 589 flow. Second operand has 7 states, 7 states have (on average 283.14285714285717) internal successors, (1982), 7 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:42,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:42,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 347 [2024-11-08 19:09:42,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:42,999 INFO L124 PetriNetUnfolderBase]: 203/1419 cut-off events. [2024-11-08 19:09:43,000 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-08 19:09:43,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1419 events. 203/1419 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6862 event pairs, 96 based on Foata normal form. 9/1338 useless extension candidates. Maximal degree in co-relation 1928. Up to 201 conditions per place. [2024-11-08 19:09:43,009 INFO L140 encePairwiseOnDemand]: 315/347 looper letters, 59 selfloop transitions, 45 changer transitions 0/344 dead transitions. [2024-11-08 19:09:43,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 344 transitions, 931 flow [2024-11-08 19:09:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:09:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 19:09:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2892 transitions. [2024-11-08 19:09:43,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8334293948126801 [2024-11-08 19:09:43,016 INFO L175 Difference]: Start difference. First operand has 282 places, 286 transitions, 589 flow. Second operand 10 states and 2892 transitions. [2024-11-08 19:09:43,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 344 transitions, 931 flow [2024-11-08 19:09:43,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 344 transitions, 931 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:09:43,023 INFO L231 Difference]: Finished difference. Result has 295 places, 314 transitions, 805 flow [2024-11-08 19:09:43,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=805, PETRI_PLACES=295, PETRI_TRANSITIONS=314} [2024-11-08 19:09:43,026 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -23 predicate places. [2024-11-08 19:09:43,026 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 314 transitions, 805 flow [2024-11-08 19:09:43,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 283.14285714285717) internal successors, (1982), 7 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:43,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:43,028 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:43,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:09:43,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -289741147, now seen corresponding path program 1 times [2024-11-08 19:09:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700659753] [2024-11-08 19:09:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700659753] [2024-11-08 19:09:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700659753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169818327] [2024-11-08 19:09:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:43,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:43,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:43,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 347 [2024-11-08 19:09:43,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 314 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:43,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:43,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 347 [2024-11-08 19:09:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:43,397 INFO L124 PetriNetUnfolderBase]: 91/957 cut-off events. [2024-11-08 19:09:43,397 INFO L125 PetriNetUnfolderBase]: For 76/78 co-relation queries the response was YES. [2024-11-08 19:09:43,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 957 events. 91/957 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3539 event pairs, 30 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1222. Up to 112 conditions per place. [2024-11-08 19:09:43,404 INFO L140 encePairwiseOnDemand]: 345/347 looper letters, 11 selfloop transitions, 1 changer transitions 0/313 dead transitions. [2024-11-08 19:09:43,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 313 transitions, 827 flow [2024-11-08 19:09:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2024-11-08 19:09:43,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9106628242074928 [2024-11-08 19:09:43,407 INFO L175 Difference]: Start difference. First operand has 295 places, 314 transitions, 805 flow. Second operand 3 states and 948 transitions. [2024-11-08 19:09:43,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 313 transitions, 827 flow [2024-11-08 19:09:43,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 313 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:09:43,417 INFO L231 Difference]: Finished difference. Result has 296 places, 313 transitions, 805 flow [2024-11-08 19:09:43,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=296, PETRI_TRANSITIONS=313} [2024-11-08 19:09:43,421 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -22 predicate places. [2024-11-08 19:09:43,421 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 313 transitions, 805 flow [2024-11-08 19:09:43,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:43,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:43,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:09:43,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash -961384757, now seen corresponding path program 1 times [2024-11-08 19:09:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060511955] [2024-11-08 19:09:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:09:43,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060511955] [2024-11-08 19:09:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060511955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:43,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:43,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080857140] [2024-11-08 19:09:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:43,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-08 19:09:43,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 313 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:43,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:43,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-08 19:09:43,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:43,829 INFO L124 PetriNetUnfolderBase]: 138/1083 cut-off events. [2024-11-08 19:09:43,829 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-08 19:09:43,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1083 events. 138/1083 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4538 event pairs, 37 based on Foata normal form. 4/1029 useless extension candidates. Maximal degree in co-relation 1457. Up to 136 conditions per place. [2024-11-08 19:09:43,837 INFO L140 encePairwiseOnDemand]: 342/347 looper letters, 15 selfloop transitions, 2 changer transitions 31/316 dead transitions. [2024-11-08 19:09:43,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 316 transitions, 853 flow [2024-11-08 19:09:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions. [2024-11-08 19:09:43,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9068203650336215 [2024-11-08 19:09:43,840 INFO L175 Difference]: Start difference. First operand has 296 places, 313 transitions, 805 flow. Second operand 3 states and 944 transitions. [2024-11-08 19:09:43,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 316 transitions, 853 flow [2024-11-08 19:09:43,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 316 transitions, 852 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 19:09:43,849 INFO L231 Difference]: Finished difference. Result has 295 places, 280 transitions, 662 flow [2024-11-08 19:09:43,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=295, PETRI_TRANSITIONS=280} [2024-11-08 19:09:43,851 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -23 predicate places. [2024-11-08 19:09:43,851 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 280 transitions, 662 flow [2024-11-08 19:09:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:43,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:43,852 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:43,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:09:43,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:43,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1554926587, now seen corresponding path program 1 times [2024-11-08 19:09:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937294949] [2024-11-08 19:09:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:09:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937294949] [2024-11-08 19:09:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937294949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:44,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:09:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491940316] [2024-11-08 19:09:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:44,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:09:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:09:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:09:44,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 347 [2024-11-08 19:09:44,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 280 transitions, 662 flow. Second operand has 6 states, 6 states have (on average 295.5) internal successors, (1773), 6 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:44,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 347 [2024-11-08 19:09:44,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:45,626 INFO L124 PetriNetUnfolderBase]: 231/1371 cut-off events. [2024-11-08 19:09:45,626 INFO L125 PetriNetUnfolderBase]: For 162/169 co-relation queries the response was YES. [2024-11-08 19:09:45,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 1371 events. 231/1371 cut-off events. For 162/169 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8142 event pairs, 74 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 1990. Up to 282 conditions per place. [2024-11-08 19:09:45,637 INFO L140 encePairwiseOnDemand]: 339/347 looper letters, 47 selfloop transitions, 10 changer transitions 0/305 dead transitions. [2024-11-08 19:09:45,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 305 transitions, 842 flow [2024-11-08 19:09:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:09:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:09:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2024-11-08 19:09:45,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8688760806916427 [2024-11-08 19:09:45,642 INFO L175 Difference]: Start difference. First operand has 295 places, 280 transitions, 662 flow. Second operand 6 states and 1809 transitions. [2024-11-08 19:09:45,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 305 transitions, 842 flow [2024-11-08 19:09:45,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 305 transitions, 786 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-11-08 19:09:45,650 INFO L231 Difference]: Finished difference. Result has 285 places, 289 transitions, 686 flow [2024-11-08 19:09:45,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=686, PETRI_PLACES=285, PETRI_TRANSITIONS=289} [2024-11-08 19:09:45,653 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -33 predicate places. [2024-11-08 19:09:45,653 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 289 transitions, 686 flow [2024-11-08 19:09:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 295.5) internal successors, (1773), 6 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:45,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:45,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:45,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:09:45,655 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:45,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2103578120, now seen corresponding path program 1 times [2024-11-08 19:09:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162139144] [2024-11-08 19:09:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:45,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:09:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162139144] [2024-11-08 19:09:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162139144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:45,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:45,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647683357] [2024-11-08 19:09:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:45,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:45,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:45,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:45,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-08 19:09:45,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 289 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:45,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:45,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-08 19:09:45,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:46,212 INFO L124 PetriNetUnfolderBase]: 285/1473 cut-off events. [2024-11-08 19:09:46,213 INFO L125 PetriNetUnfolderBase]: For 810/822 co-relation queries the response was YES. [2024-11-08 19:09:46,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 1473 events. 285/1473 cut-off events. For 810/822 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8729 event pairs, 84 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 2426. Up to 293 conditions per place. [2024-11-08 19:09:46,226 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 22 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-11-08 19:09:46,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 294 transitions, 756 flow [2024-11-08 19:09:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2024-11-08 19:09:46,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9058597502401537 [2024-11-08 19:09:46,230 INFO L175 Difference]: Start difference. First operand has 285 places, 289 transitions, 686 flow. Second operand 3 states and 943 transitions. [2024-11-08 19:09:46,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 294 transitions, 756 flow [2024-11-08 19:09:46,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 294 transitions, 746 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-08 19:09:46,237 INFO L231 Difference]: Finished difference. Result has 286 places, 288 transitions, 680 flow [2024-11-08 19:09:46,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=286, PETRI_TRANSITIONS=288} [2024-11-08 19:09:46,239 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -32 predicate places. [2024-11-08 19:09:46,239 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 288 transitions, 680 flow [2024-11-08 19:09:46,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:46,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:46,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:46,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:09:46,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:46,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1400879757, now seen corresponding path program 1 times [2024-11-08 19:09:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236626534] [2024-11-08 19:09:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:09:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236626534] [2024-11-08 19:09:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236626534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:09:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176337804] [2024-11-08 19:09:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:09:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:46,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:09:46,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:09:46,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 347 [2024-11-08 19:09:46,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 288 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:46,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:46,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 347 [2024-11-08 19:09:46,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:46,702 INFO L124 PetriNetUnfolderBase]: 211/1301 cut-off events. [2024-11-08 19:09:46,702 INFO L125 PetriNetUnfolderBase]: For 435/445 co-relation queries the response was YES. [2024-11-08 19:09:46,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1301 events. 211/1301 cut-off events. For 435/445 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7356 event pairs, 4 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 2009. Up to 234 conditions per place. [2024-11-08 19:09:46,716 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 21 selfloop transitions, 7 changer transitions 0/299 dead transitions. [2024-11-08 19:09:46,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 299 transitions, 782 flow [2024-11-08 19:09:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:09:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:09:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 953 transitions. [2024-11-08 19:09:46,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154658981748319 [2024-11-08 19:09:46,719 INFO L175 Difference]: Start difference. First operand has 286 places, 288 transitions, 680 flow. Second operand 3 states and 953 transitions. [2024-11-08 19:09:46,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 299 transitions, 782 flow [2024-11-08 19:09:46,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 299 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:09:46,725 INFO L231 Difference]: Finished difference. Result has 286 places, 293 transitions, 739 flow [2024-11-08 19:09:46,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=286, PETRI_TRANSITIONS=293} [2024-11-08 19:09:46,727 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -32 predicate places. [2024-11-08 19:09:46,727 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 293 transitions, 739 flow [2024-11-08 19:09:46,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:46,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:46,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:09:46,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1374144938, now seen corresponding path program 1 times [2024-11-08 19:09:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900964931] [2024-11-08 19:09:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:09:48,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:48,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900964931] [2024-11-08 19:09:48,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900964931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:48,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 19:09:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159168661] [2024-11-08 19:09:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:48,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:09:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:48,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:09:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:09:51,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 347 [2024-11-08 19:09:51,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 293 transitions, 739 flow. Second operand has 20 states, 20 states have (on average 262.6) internal successors, (5252), 20 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:51,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:51,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 347 [2024-11-08 19:09:51,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:09:54,698 INFO L124 PetriNetUnfolderBase]: 983/4268 cut-off events. [2024-11-08 19:09:54,698 INFO L125 PetriNetUnfolderBase]: For 1995/2127 co-relation queries the response was YES. [2024-11-08 19:09:54,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7263 conditions, 4268 events. 983/4268 cut-off events. For 1995/2127 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 35003 event pairs, 193 based on Foata normal form. 90/4008 useless extension candidates. Maximal degree in co-relation 7220. Up to 561 conditions per place. [2024-11-08 19:09:54,728 INFO L140 encePairwiseOnDemand]: 312/347 looper letters, 87 selfloop transitions, 53 changer transitions 4/361 dead transitions. [2024-11-08 19:09:54,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 361 transitions, 1340 flow [2024-11-08 19:09:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 19:09:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-11-08 19:09:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8690 transitions. [2024-11-08 19:09:54,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7588856868395774 [2024-11-08 19:09:54,745 INFO L175 Difference]: Start difference. First operand has 286 places, 293 transitions, 739 flow. Second operand 33 states and 8690 transitions. [2024-11-08 19:09:54,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 361 transitions, 1340 flow [2024-11-08 19:09:54,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 361 transitions, 1340 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:09:54,754 INFO L231 Difference]: Finished difference. Result has 323 places, 314 transitions, 1041 flow [2024-11-08 19:09:54,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1041, PETRI_PLACES=323, PETRI_TRANSITIONS=314} [2024-11-08 19:09:54,756 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 5 predicate places. [2024-11-08 19:09:54,756 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 314 transitions, 1041 flow [2024-11-08 19:09:54,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 262.6) internal successors, (5252), 20 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:54,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:09:54,759 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:09:54,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:09:54,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:09:54,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:09:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash -394543698, now seen corresponding path program 2 times [2024-11-08 19:09:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:09:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381188468] [2024-11-08 19:09:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:09:54,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:09:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:09:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:09:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:09:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381188468] [2024-11-08 19:09:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381188468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:09:56,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:09:56,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 19:09:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470171216] [2024-11-08 19:09:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:09:56,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:09:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:09:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:09:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:09:58,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 347 [2024-11-08 19:09:58,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 314 transitions, 1041 flow. Second operand has 20 states, 20 states have (on average 262.6) internal successors, (5252), 20 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:09:58,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:09:58,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 347 [2024-11-08 19:09:58,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:01,732 INFO L124 PetriNetUnfolderBase]: 1213/5205 cut-off events. [2024-11-08 19:10:01,732 INFO L125 PetriNetUnfolderBase]: For 6086/6421 co-relation queries the response was YES. [2024-11-08 19:10:01,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11064 conditions, 5205 events. 1213/5205 cut-off events. For 6086/6421 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 46480 event pairs, 354 based on Foata normal form. 198/5014 useless extension candidates. Maximal degree in co-relation 11015. Up to 1090 conditions per place. [2024-11-08 19:10:01,776 INFO L140 encePairwiseOnDemand]: 312/347 looper letters, 98 selfloop transitions, 53 changer transitions 0/368 dead transitions. [2024-11-08 19:10:01,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 368 transitions, 1689 flow [2024-11-08 19:10:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 19:10:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-08 19:10:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 8419 transitions. [2024-11-08 19:10:01,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7581952449567724 [2024-11-08 19:10:01,792 INFO L175 Difference]: Start difference. First operand has 323 places, 314 transitions, 1041 flow. Second operand 32 states and 8419 transitions. [2024-11-08 19:10:01,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 368 transitions, 1689 flow [2024-11-08 19:10:01,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 368 transitions, 1638 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-11-08 19:10:01,811 INFO L231 Difference]: Finished difference. Result has 328 places, 333 transitions, 1292 flow [2024-11-08 19:10:01,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1292, PETRI_PLACES=328, PETRI_TRANSITIONS=333} [2024-11-08 19:10:01,812 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 10 predicate places. [2024-11-08 19:10:01,812 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 333 transitions, 1292 flow [2024-11-08 19:10:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 262.6) internal successors, (5252), 20 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:01,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:01,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:10:01,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 19:10:01,815 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:01,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1721471375, now seen corresponding path program 1 times [2024-11-08 19:10:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008590856] [2024-11-08 19:10:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:10:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:02,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008590856] [2024-11-08 19:10:02,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008590856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:10:02,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:10:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:10:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907749026] [2024-11-08 19:10:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:10:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:10:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:10:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:10:02,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 347 [2024-11-08 19:10:02,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 333 transitions, 1292 flow. Second operand has 6 states, 6 states have (on average 295.5) internal successors, (1773), 6 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:02,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:10:02,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 347 [2024-11-08 19:10:02,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:04,423 INFO L124 PetriNetUnfolderBase]: 1560/6319 cut-off events. [2024-11-08 19:10:04,424 INFO L125 PetriNetUnfolderBase]: For 9050/9223 co-relation queries the response was YES. [2024-11-08 19:10:04,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14422 conditions, 6319 events. 1560/6319 cut-off events. For 9050/9223 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 58035 event pairs, 420 based on Foata normal form. 89/5992 useless extension candidates. Maximal degree in co-relation 14372. Up to 1325 conditions per place. [2024-11-08 19:10:04,488 INFO L140 encePairwiseOnDemand]: 339/347 looper letters, 74 selfloop transitions, 23 changer transitions 0/366 dead transitions. [2024-11-08 19:10:04,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 366 transitions, 1646 flow [2024-11-08 19:10:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:10:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:10:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1807 transitions. [2024-11-08 19:10:04,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8679154658981748 [2024-11-08 19:10:04,492 INFO L175 Difference]: Start difference. First operand has 328 places, 333 transitions, 1292 flow. Second operand 6 states and 1807 transitions. [2024-11-08 19:10:04,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 366 transitions, 1646 flow [2024-11-08 19:10:04,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 366 transitions, 1565 flow, removed 15 selfloop flow, removed 26 redundant places. [2024-11-08 19:10:04,521 INFO L231 Difference]: Finished difference. Result has 312 places, 350 transitions, 1447 flow [2024-11-08 19:10:04,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1447, PETRI_PLACES=312, PETRI_TRANSITIONS=350} [2024-11-08 19:10:04,522 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -6 predicate places. [2024-11-08 19:10:04,522 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 350 transitions, 1447 flow [2024-11-08 19:10:04,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 295.5) internal successors, (1773), 6 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:04,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:04,524 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-08 19:10:04,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 19:10:04,524 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:04,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1703102702, now seen corresponding path program 1 times [2024-11-08 19:10:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:04,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622831642] [2024-11-08 19:10:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:10:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622831642] [2024-11-08 19:10:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622831642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:10:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319671207] [2024-11-08 19:10:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:04,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:10:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:10:04,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:10:04,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:10:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:05,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 19:10:05,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:10:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:10:05,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:10:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:10:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319671207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:10:06,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:10:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-08 19:10:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991368999] [2024-11-08 19:10:06,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:10:06,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 19:10:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 19:10:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-08 19:10:07,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 347 [2024-11-08 19:10:07,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 350 transitions, 1447 flow. Second operand has 24 states, 24 states have (on average 267.3333333333333) internal successors, (6416), 24 states have internal predecessors, (6416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:07,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:10:07,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 347 [2024-11-08 19:10:07,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:11,549 INFO L124 PetriNetUnfolderBase]: 3171/11025 cut-off events. [2024-11-08 19:10:11,550 INFO L125 PetriNetUnfolderBase]: For 16520/18653 co-relation queries the response was YES. [2024-11-08 19:10:11,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27008 conditions, 11025 events. 3171/11025 cut-off events. For 16520/18653 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 109080 event pairs, 1337 based on Foata normal form. 375/10745 useless extension candidates. Maximal degree in co-relation 26953. Up to 2983 conditions per place. [2024-11-08 19:10:11,644 INFO L140 encePairwiseOnDemand]: 302/347 looper letters, 154 selfloop transitions, 98 changer transitions 0/503 dead transitions. [2024-11-08 19:10:11,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 503 transitions, 2617 flow [2024-11-08 19:10:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:10:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-08 19:10:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6254 transitions. [2024-11-08 19:10:11,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7836110763062273 [2024-11-08 19:10:11,655 INFO L175 Difference]: Start difference. First operand has 312 places, 350 transitions, 1447 flow. Second operand 23 states and 6254 transitions. [2024-11-08 19:10:11,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 503 transitions, 2617 flow [2024-11-08 19:10:11,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 503 transitions, 2585 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-11-08 19:10:11,706 INFO L231 Difference]: Finished difference. Result has 349 places, 417 transitions, 2077 flow [2024-11-08 19:10:11,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2077, PETRI_PLACES=349, PETRI_TRANSITIONS=417} [2024-11-08 19:10:11,708 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 31 predicate places. [2024-11-08 19:10:11,708 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 417 transitions, 2077 flow [2024-11-08 19:10:11,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.3333333333333) internal successors, (6416), 24 states have internal predecessors, (6416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:11,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:11,711 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:10:11,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:10:11,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 19:10:11,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:11,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1568872308, now seen corresponding path program 1 times [2024-11-08 19:10:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872201785] [2024-11-08 19:10:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:10:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872201785] [2024-11-08 19:10:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872201785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:10:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:10:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:10:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264135527] [2024-11-08 19:10:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:10:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:10:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:10:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:10:12,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-08 19:10:12,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 417 transitions, 2077 flow. Second operand has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:12,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:10:12,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-08 19:10:12,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:14,939 INFO L124 PetriNetUnfolderBase]: 2551/10937 cut-off events. [2024-11-08 19:10:14,939 INFO L125 PetriNetUnfolderBase]: For 19061/19414 co-relation queries the response was YES. [2024-11-08 19:10:14,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27748 conditions, 10937 events. 2551/10937 cut-off events. For 19061/19414 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 108639 event pairs, 879 based on Foata normal form. 47/10485 useless extension candidates. Maximal degree in co-relation 27676. Up to 2124 conditions per place. [2024-11-08 19:10:15,040 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 42 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-11-08 19:10:15,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 423 transitions, 2201 flow [2024-11-08 19:10:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:10:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:10:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2024-11-08 19:10:15,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9039385206532181 [2024-11-08 19:10:15,043 INFO L175 Difference]: Start difference. First operand has 349 places, 417 transitions, 2077 flow. Second operand 3 states and 941 transitions. [2024-11-08 19:10:15,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 423 transitions, 2201 flow [2024-11-08 19:10:15,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 423 transitions, 2161 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-08 19:10:15,111 INFO L231 Difference]: Finished difference. Result has 349 places, 416 transitions, 2039 flow [2024-11-08 19:10:15,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=347, 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=2039, PETRI_PLACES=349, PETRI_TRANSITIONS=416} [2024-11-08 19:10:15,112 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 31 predicate places. [2024-11-08 19:10:15,112 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 416 transitions, 2039 flow [2024-11-08 19:10:15,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:15,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:15,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:10:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 19:10:15,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:15,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash -63624510, now seen corresponding path program 1 times [2024-11-08 19:10:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833055313] [2024-11-08 19:10:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:10:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:17,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833055313] [2024-11-08 19:10:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833055313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:10:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:10:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 19:10:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106940865] [2024-11-08 19:10:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:10:17,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 19:10:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:17,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 19:10:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:10:20,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 347 [2024-11-08 19:10:20,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 416 transitions, 2039 flow. Second operand has 21 states, 21 states have (on average 262.5238095238095) internal successors, (5513), 21 states have internal predecessors, (5513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:20,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:10:20,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 347 [2024-11-08 19:10:20,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:25,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L51-9-->L51-10: Formula: (let ((.cse0 (select |v_#race_20| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork2_~i~0_35 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_20|, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_35} OutVars{#race=|v_#race_20|, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_35} AuxVars[] AssignedVars[][363], [Black: 571#(and (= (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset 1)))), Black: 568#true, Black: 378#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 579#true, 573#(and (= (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~B~0.offset))) (= 0 (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset 1))) (= (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~B~0.offset)) 0)), 274#L96-4true, 366#(= |#race~A~0| 0), 345#(= |#race~N~0| 0), 275#L51-10true, Black: 395#true, Black: 397#(= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) 0), 1993#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~C~0.base ~B~0.base)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 398#(and (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 1)) 0)), Black: 399#(and (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 1)) 0)), 128#L77true, 98#L65true, Black: 409#true, 411#(= |#race~B~0| 0), Black: 478#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 555#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 482#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork0_~i~1 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) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 480#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 484#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (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) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 476#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1886#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1870#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1878#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 364#true, Black: 1898#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0) (<= ~N~0 1)), Black: 1900#(and (<= 1 thread2Thread1of1ForFork0_~i~1) (= |thread2Thread1of1ForFork0_#t~post10| 0) (<= ~N~0 1)), Black: 1880#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), 400#(and (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 1)) 0)), Black: 587#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~N~0 1)), Black: 1892#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 557#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork0_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 559#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1882#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 561#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork0_~i~1 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) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 1872#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 563#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (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) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 586#(<= ~N~0 1), Black: 1888#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 1894#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), 1916#true, Black: 1174#(and (<= 1 thread2Thread1of1ForFork0_~i~1) (<= ~N~0 1)), Black: 1876#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 570#(= (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset)) 0), Black: 572#(and (= (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~B~0.offset))) (= 0 (select (select |#race| ~B~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~B~0.offset 1))))]) [2024-11-08 19:10:25,018 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-08 19:10:25,018 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-08 19:10:25,018 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-08 19:10:25,018 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-08 19:10:25,718 INFO L124 PetriNetUnfolderBase]: 3566/12988 cut-off events. [2024-11-08 19:10:25,718 INFO L125 PetriNetUnfolderBase]: For 27229/28525 co-relation queries the response was YES. [2024-11-08 19:10:25,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32805 conditions, 12988 events. 3566/12988 cut-off events. For 27229/28525 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 128959 event pairs, 817 based on Foata normal form. 447/12553 useless extension candidates. Maximal degree in co-relation 32728. Up to 1936 conditions per place. [2024-11-08 19:10:25,827 INFO L140 encePairwiseOnDemand]: 312/347 looper letters, 132 selfloop transitions, 79 changer transitions 0/488 dead transitions. [2024-11-08 19:10:25,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 488 transitions, 2990 flow [2024-11-08 19:10:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 19:10:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-08 19:10:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 8420 transitions. [2024-11-08 19:10:25,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7582853025936599 [2024-11-08 19:10:25,839 INFO L175 Difference]: Start difference. First operand has 349 places, 416 transitions, 2039 flow. Second operand 32 states and 8420 transitions. [2024-11-08 19:10:25,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 488 transitions, 2990 flow [2024-11-08 19:10:25,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 488 transitions, 2986 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:10:25,924 INFO L231 Difference]: Finished difference. Result has 382 places, 429 transitions, 2418 flow [2024-11-08 19:10:25,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2418, PETRI_PLACES=382, PETRI_TRANSITIONS=429} [2024-11-08 19:10:25,925 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 64 predicate places. [2024-11-08 19:10:25,925 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 429 transitions, 2418 flow [2024-11-08 19:10:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 262.5238095238095) internal successors, (5513), 21 states have internal predecessors, (5513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:25,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:25,928 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:10:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 19:10:25,928 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 195719250, now seen corresponding path program 2 times [2024-11-08 19:10:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424036568] [2024-11-08 19:10:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:10:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:27,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424036568] [2024-11-08 19:10:27,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424036568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:10:27,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:10:27,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:10:27,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845677107] [2024-11-08 19:10:27,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:10:27,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:10:27,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:27,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:10:27,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:10:28,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 347 [2024-11-08 19:10:28,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 429 transitions, 2418 flow. Second operand has 15 states, 15 states have (on average 267.2) internal successors, (4008), 15 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:28,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:10:28,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 347 [2024-11-08 19:10:28,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:33,385 INFO L124 PetriNetUnfolderBase]: 3702/14316 cut-off events. [2024-11-08 19:10:33,385 INFO L125 PetriNetUnfolderBase]: For 39837/41076 co-relation queries the response was YES. [2024-11-08 19:10:33,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38190 conditions, 14316 events. 3702/14316 cut-off events. For 39837/41076 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 147711 event pairs, 717 based on Foata normal form. 574/13909 useless extension candidates. Maximal degree in co-relation 38110. Up to 3205 conditions per place. [2024-11-08 19:10:33,520 INFO L140 encePairwiseOnDemand]: 315/347 looper letters, 129 selfloop transitions, 81 changer transitions 0/491 dead transitions. [2024-11-08 19:10:33,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 491 transitions, 3374 flow [2024-11-08 19:10:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 19:10:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-08 19:10:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 6431 transitions. [2024-11-08 19:10:33,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7722142170989433 [2024-11-08 19:10:33,528 INFO L175 Difference]: Start difference. First operand has 382 places, 429 transitions, 2418 flow. Second operand 24 states and 6431 transitions. [2024-11-08 19:10:33,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 491 transitions, 3374 flow [2024-11-08 19:10:33,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 491 transitions, 3290 flow, removed 1 selfloop flow, removed 27 redundant places. [2024-11-08 19:10:33,626 INFO L231 Difference]: Finished difference. Result has 381 places, 442 transitions, 2731 flow [2024-11-08 19:10:33,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2731, PETRI_PLACES=381, PETRI_TRANSITIONS=442} [2024-11-08 19:10:33,628 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 63 predicate places. [2024-11-08 19:10:33,628 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 442 transitions, 2731 flow [2024-11-08 19:10:33,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 267.2) internal successors, (4008), 15 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:33,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:33,630 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-08 19:10:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 19:10:33,630 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash -524113088, now seen corresponding path program 1 times [2024-11-08 19:10:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502453477] [2024-11-08 19:10:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:10:34,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502453477] [2024-11-08 19:10:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502453477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:10:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462462420] [2024-11-08 19:10:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:34,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:10:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:10:34,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:10:34,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:10:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:34,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 19:10:34,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:10:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:10:34,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:10:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:10:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462462420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:10:35,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:10:35,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-08 19:10:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669264475] [2024-11-08 19:10:35,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:10:35,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 19:10:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:35,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 19:10:35,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-08 19:10:36,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 347 [2024-11-08 19:10:36,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 442 transitions, 2731 flow. Second operand has 24 states, 24 states have (on average 267.2083333333333) internal successors, (6413), 24 states have internal predecessors, (6413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:36,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:10:36,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 347 [2024-11-08 19:10:36,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:10:41,388 INFO L124 PetriNetUnfolderBase]: 2339/11451 cut-off events. [2024-11-08 19:10:41,388 INFO L125 PetriNetUnfolderBase]: For 34345/34603 co-relation queries the response was YES. [2024-11-08 19:10:41,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33044 conditions, 11451 events. 2339/11451 cut-off events. For 34345/34603 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 114107 event pairs, 663 based on Foata normal form. 160/11298 useless extension candidates. Maximal degree in co-relation 32962. Up to 1781 conditions per place. [2024-11-08 19:10:41,467 INFO L140 encePairwiseOnDemand]: 302/347 looper letters, 105 selfloop transitions, 41 changer transitions 178/573 dead transitions. [2024-11-08 19:10:41,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 573 transitions, 4465 flow [2024-11-08 19:10:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:10:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-08 19:10:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6266 transitions. [2024-11-08 19:10:41,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7851146472873074 [2024-11-08 19:10:41,474 INFO L175 Difference]: Start difference. First operand has 381 places, 442 transitions, 2731 flow. Second operand 23 states and 6266 transitions. [2024-11-08 19:10:41,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 573 transitions, 4465 flow [2024-11-08 19:10:41,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 573 transitions, 4307 flow, removed 19 selfloop flow, removed 20 redundant places. [2024-11-08 19:10:41,609 INFO L231 Difference]: Finished difference. Result has 388 places, 377 transitions, 2191 flow [2024-11-08 19:10:41,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2191, PETRI_PLACES=388, PETRI_TRANSITIONS=377} [2024-11-08 19:10:41,611 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 70 predicate places. [2024-11-08 19:10:41,611 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 377 transitions, 2191 flow [2024-11-08 19:10:41,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.2083333333333) internal successors, (6413), 24 states have internal predecessors, (6413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:10:41,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:10:41,613 INFO L204 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] [2024-11-08 19:10:41,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:10:41,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-08 19:10:41,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:10:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:10:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1872755604, now seen corresponding path program 2 times [2024-11-08 19:10:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:10:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258401371] [2024-11-08 19:10:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:10:41,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:10:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:10:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 19:10:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:10:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258401371] [2024-11-08 19:10:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258401371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:10:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14939893] [2024-11-08 19:10:44,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:10:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:10:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:10:44,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:10:44,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:10:45,116 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:10:45,116 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:10:45,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 19:10:45,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:10:45,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 19:10:45,539 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 19:10:45,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 19:10:46,367 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 19:10:46,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 19:10:47,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 19:10:47,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 19:10:47,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:10:47,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:10:47,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:10:47,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:10:47,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:10:47,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:10:47,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 96 [2024-11-08 19:10:47,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2024-11-08 19:10:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 19:10:52,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:10:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14939893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:10:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:10:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [25] total 51 [2024-11-08 19:10:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898632377] [2024-11-08 19:10:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:10:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 19:10:52,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:10:52,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 19:10:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2430, Unknown=1, NotChecked=0, Total=2652 [2024-11-08 19:10:56,043 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-11-08 19:11:00,058 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-11-08 19:11:04,095 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-11-08 19:11:08,128 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-11-08 19:11:12,156 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-11-08 19:11:16,294 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-11-08 19:11:20,318 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-11-08 19:11:24,332 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-11-08 19:11:28,342 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-11-08 19:11:32,349 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-11-08 19:11:36,373 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-11-08 19:11:40,401 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-11-08 19:11:44,415 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-11-08 19:11:48,422 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-11-08 19:11:52,432 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-11-08 19:11:56,476 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-11-08 19:12:00,483 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-11-08 19:12:04,490 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-11-08 19:12:08,497 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-11-08 19:12:12,553 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-11-08 19:12:16,592 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-11-08 19:12:20,613 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-11-08 19:12:24,645 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-11-08 19:12:28,669 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-11-08 19:12:32,684 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-11-08 19:12:36,699 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-11-08 19:12:40,708 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-11-08 19:12:44,715 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-11-08 19:12:48,720 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-11-08 19:12:52,733 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-11-08 19:12:56,756 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-11-08 19:13:00,785 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-11-08 19:13:04,806 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-11-08 19:13:08,829 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-11-08 19:13:12,854 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-11-08 19:13:16,862 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-11-08 19:13:20,868 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-11-08 19:13:24,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:13:28,949 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-11-08 19:13:33,050 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-11-08 19:13:37,056 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-11-08 19:13:41,077 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-11-08 19:13:45,086 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-11-08 19:13:49,095 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-11-08 19:13:53,105 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-11-08 19:13:57,199 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-11-08 19:14:01,262 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-11-08 19:14:05,268 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-11-08 19:14:09,276 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-11-08 19:14:13,296 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-11-08 19:14:17,378 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-11-08 19:14:21,422 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-11-08 19:14:25,477 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-11-08 19:14:29,486 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-11-08 19:14:33,508 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-11-08 19:14:37,539 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-11-08 19:14:41,570 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-11-08 19:14:45,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-11-08 19:14:50,530 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-11-08 19:14:54,585 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-11-08 19:14:59,641 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-11-08 19:15:03,685 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-11-08 19:15:07,723 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-11-08 19:15:11,784 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-11-08 19:15:15,807 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-11-08 19:15:19,855 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-11-08 19:15:19,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 347 [2024-11-08 19:15:19,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 377 transitions, 2191 flow. Second operand has 28 states, 28 states have (on average 190.78571428571428) internal successors, (5342), 28 states have internal predecessors, (5342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:19,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:15:19,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 347 [2024-11-08 19:15:19,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:15:37,378 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-11-08 19:15:41,396 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-11-08 19:15:45,416 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-11-08 19:15:49,892 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-11-08 19:15:53,904 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-11-08 19:15:57,923 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-11-08 19:16:01,935 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-11-08 19:16:15,684 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-11-08 19:16:19,844 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-11-08 19:16:28,122 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-11-08 19:16:32,410 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-11-08 19:16:36,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-11-08 19:16:49,587 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-11-08 19:16:53,750 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-11-08 19:16:58,475 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-11-08 19:17:02,627 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-11-08 19:17:07,651 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-11-08 19:17:11,807 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-11-08 19:17:16,064 INFO L124 PetriNetUnfolderBase]: 10351/23338 cut-off events. [2024-11-08 19:17:16,064 INFO L125 PetriNetUnfolderBase]: For 58038/58410 co-relation queries the response was YES. [2024-11-08 19:17:16,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70853 conditions, 23338 events. 10351/23338 cut-off events. For 58038/58410 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 233556 event pairs, 1260 based on Foata normal form. 349/22939 useless extension candidates. Maximal degree in co-relation 70758. Up to 5448 conditions per place. [2024-11-08 19:17:16,406 INFO L140 encePairwiseOnDemand]: 299/347 looper letters, 413 selfloop transitions, 108 changer transitions 17/706 dead transitions. [2024-11-08 19:17:16,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 706 transitions, 5894 flow [2024-11-08 19:17:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-08 19:17:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-11-08 19:17:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 9118 transitions. [2024-11-08 19:17:16,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590778097982709 [2024-11-08 19:17:16,421 INFO L175 Difference]: Start difference. First operand has 388 places, 377 transitions, 2191 flow. Second operand 47 states and 9118 transitions. [2024-11-08 19:17:16,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 706 transitions, 5894 flow [2024-11-08 19:17:17,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 706 transitions, 5478 flow, removed 110 selfloop flow, removed 30 redundant places. [2024-11-08 19:17:17,169 INFO L231 Difference]: Finished difference. Result has 393 places, 435 transitions, 2847 flow [2024-11-08 19:17:17,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2847, PETRI_PLACES=393, PETRI_TRANSITIONS=435} [2024-11-08 19:17:17,170 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 75 predicate places. [2024-11-08 19:17:17,170 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 435 transitions, 2847 flow [2024-11-08 19:17:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 190.78571428571428) internal successors, (5342), 28 states have internal predecessors, (5342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:17:17,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:17:17,173 INFO L204 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] [2024-11-08 19:17:17,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:17:17,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-08 19:17:17,374 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-08 19:17:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash -533682834, now seen corresponding path program 3 times [2024-11-08 19:17:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082377330] [2024-11-08 19:17:17,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:17,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 19:17:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:17:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082377330] [2024-11-08 19:17:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082377330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:17:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47923736] [2024-11-08 19:17:20,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 19:17:20,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:17:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:17:20,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:17:20,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ca1747-a82c-4abf-a660-69b9530d3548/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:17:21,045 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 19:17:21,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:17:21,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-08 19:17:21,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:17:21,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 19:17:21,631 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 19:17:21,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 19:17:23,032 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 19:17:23,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 19:17:24,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 19:17:24,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 19:17:24,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:17:24,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:17:25,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:17:25,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:17:25,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:17:25,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:17:25,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 96 [2024-11-08 19:17:25,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2024-11-08 19:17:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 19:17:37,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:17:37,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0)))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1324) c_~C~0.base v_ArrVal_1322) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1324) c_~C~0.base v_ArrVal_1322) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1324) c_~C~0.base v_ArrVal_1322) c_~A~0.base) (+ c_~A~0.offset .cse1 3)) 0)) (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1324) c_~C~0.base v_ArrVal_1322) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)))) is different from false [2024-11-08 19:17:47,369 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-11-08 19:17:47,369 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 85 treesize of output 121 [2024-11-08 19:17:47,391 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 19:17:47,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 95 [2024-11-08 19:17:47,413 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 34 treesize of output 27 [2024-11-08 19:17:47,419 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 34 [2024-11-08 19:17:47,490 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-11-08 19:17:47,490 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 85 treesize of output 1 [2024-11-08 19:17:47,527 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-11-08 19:17:47,527 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 85 treesize of output 1 [2024-11-08 19:17:47,564 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-11-08 19:17:47,565 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 84 treesize of output 1 [2024-11-08 19:18:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 51 trivial. 1 not checked. [2024-11-08 19:18:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47923736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:18:09,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:18:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29, 29] total 81 [2024-11-08 19:18:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534335848] [2024-11-08 19:18:09,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:18:09,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-11-08 19:18:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-11-08 19:18:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=5991, Unknown=10, NotChecked=158, Total=6642 [2024-11-08 19:18:10,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 347 [2024-11-08 19:18:10,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 435 transitions, 2847 flow. Second operand has 82 states, 82 states have (on average 159.109756097561) internal successors, (13047), 82 states have internal predecessors, (13047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:10,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:18:10,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 347 [2024-11-08 19:18:10,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:18:30,511 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-11-08 19:18:34,547 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-11-08 19:18:42,744 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-11-08 19:18:46,775 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-11-08 19:18:55,817 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-11-08 19:19:03,988 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-11-08 19:19:08,018 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-11-08 19:19:16,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-11-08 19:19:21,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:19:25,653 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-11-08 19:19:33,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-11-08 19:19:37,877 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-11-08 19:19:46,595 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-11-08 19:19:50,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-11-08 19:19:55,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-11-08 19:19:59,408 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-11-08 19:20:07,618 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-11-08 19:20:13,362 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-11-08 19:20:17,410 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-11-08 19:20:24,210 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-11-08 19:20:28,245 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-11-08 19:20:34,267 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-11-08 19:20:38,497 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-11-08 19:20:44,378 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-11-08 19:20:48,400 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-11-08 19:20:52,439 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-11-08 19:20:56,454 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-11-08 19:21:17,444 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-11-08 19:21:29,545 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-11-08 19:21:33,566 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-11-08 19:21:37,588 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-11-08 19:21:58,228 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-11-08 19:22:02,236 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-11-08 19:22:11,030 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-11-08 19:22:17,717 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-11-08 19:22:21,918 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-11-08 19:22:25,959 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-11-08 19:22:30,183 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-11-08 19:22:34,227 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-11-08 19:22:38,611 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-11-08 19:22:45,084 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-11-08 19:22:49,103 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-11-08 19:23:02,091 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-11-08 19:23:06,148 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-11-08 19:23:10,193 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-11-08 19:23:14,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-11-08 19:23:18,934 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-11-08 19:23:24,022 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-11-08 19:23:28,031 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-11-08 19:23:34,887 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-11-08 19:23:38,923 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-11-08 19:23:43,702 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-11-08 19:23:50,859 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-11-08 19:23:54,903 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-11-08 19:23:58,994 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-11-08 19:24:03,044 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-11-08 19:24:07,490 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-11-08 19:24:12,963 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]