./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/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_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/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_ef60b121-60ac-4476-b49d-07d28932be5b/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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:23:45,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:23:45,073 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 19:23:45,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:23:45,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:23:45,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:23:45,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:23:45,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:23:45,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:23:45,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:23:45,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:23:45,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:23:45,124 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:23:45,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:23:45,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:23:45,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:23:45,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:23:45,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:23:45,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:23:45,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:23:45,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:23:45,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:23:45,134 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 19:23:45,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:23:45,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:23:45,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:23:45,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:23:45,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:23:45,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:23:45,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:23:45,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:23:45,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:45,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:23:45,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:23:45,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:23:45,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:23:45,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:23:45,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:23:45,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:23:45,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:23:45,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:23:45,144 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_ef60b121-60ac-4476-b49d-07d28932be5b/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_ef60b121-60ac-4476-b49d-07d28932be5b/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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2024-11-08 19:23:45,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:23:45,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:23:45,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:23:45,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:23:45,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:23:45,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i Unable to find full path for "g++" [2024-11-08 19:23:47,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:23:47,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:23:47,874 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-08 19:23:47,891 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/data/5feb9987b/4f9e9afee9644dff8a58cbcb65613e56/FLAG3234f0799 [2024-11-08 19:23:47,910 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/data/5feb9987b/4f9e9afee9644dff8a58cbcb65613e56 [2024-11-08 19:23:47,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:23:47,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:23:47,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:47,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:23:47,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:23:47,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:47" (1/1) ... [2024-11-08 19:23:47,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18311a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:47, skipping insertion in model container [2024-11-08 19:23:47,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:47" (1/1) ... [2024-11-08 19:23:47,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:23:48,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:48,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:23:48,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:48,740 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:23:48,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48 WrapperNode [2024-11-08 19:23:48,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:48,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:48,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:23:48,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:23:48,750 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:23:48" (1/1) ... [2024-11-08 19:23:48,775 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:23:48" (1/1) ... [2024-11-08 19:23:48,805 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2024-11-08 19:23:48,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:48,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:23:48,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:23:48,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:23:48,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:23:48,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:23:48,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:23:48,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:23:48,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (1/1) ... [2024-11-08 19:23:48,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:48,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/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:23:48,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/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:23:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:23:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-08 19:23:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-08 19:23:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:23:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:23:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:23:48,913 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:23:49,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:23:49,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:23:49,511 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:23:49,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:23:49,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:23:49,557 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-08 19:23:49,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:49 BoogieIcfgContainer [2024-11-08 19:23:49,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:23:49,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:23:49,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:23:49,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:23:49,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:23:47" (1/3) ... [2024-11-08 19:23:49,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445d6294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:49, skipping insertion in model container [2024-11-08 19:23:49,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:48" (2/3) ... [2024-11-08 19:23:49,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445d6294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:49, skipping insertion in model container [2024-11-08 19:23:49,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:49" (3/3) ... [2024-11-08 19:23:49,574 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2024-11-08 19:23:49,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:23:49,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-08 19:23:49,592 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:23:49,740 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 19:23:49,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 213 transitions, 433 flow [2024-11-08 19:23:49,923 INFO L124 PetriNetUnfolderBase]: 25/284 cut-off events. [2024-11-08 19:23:49,923 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 19:23:49,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 284 events. 25/284 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 684 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 157. Up to 6 conditions per place. [2024-11-08 19:23:49,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 213 transitions, 433 flow [2024-11-08 19:23:49,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 213 transitions, 433 flow [2024-11-08 19:23:49,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:23:49,970 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;@7904de67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:23:49,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-08 19:23:49,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:23:49,995 INFO L124 PetriNetUnfolderBase]: 4/117 cut-off events. [2024-11-08 19:23:49,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:23:49,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:49,996 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] [2024-11-08 19:23:49,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 19:23:50,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash -797653642, now seen corresponding path program 1 times [2024-11-08 19:23:50,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:50,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001243068] [2024-11-08 19:23:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:51,248 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:23:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001243068] [2024-11-08 19:23:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001243068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:23:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273335039] [2024-11-08 19:23:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:51,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:23:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:23:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:23:51,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 213 [2024-11-08 19:23:51,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 213 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 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:23:51,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:51,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 213 [2024-11-08 19:23:51,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:51,949 INFO L124 PetriNetUnfolderBase]: 137/824 cut-off events. [2024-11-08 19:23:51,950 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 19:23:51,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 824 events. 137/824 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4528 event pairs, 12 based on Foata normal form. 92/820 useless extension candidates. Maximal degree in co-relation 896. Up to 174 conditions per place. [2024-11-08 19:23:51,962 INFO L140 encePairwiseOnDemand]: 197/213 looper letters, 48 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2024-11-08 19:23:51,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 224 transitions, 561 flow [2024-11-08 19:23:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:23:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:23:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1120 transitions. [2024-11-08 19:23:51,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8763693270735524 [2024-11-08 19:23:51,993 INFO L175 Difference]: Start difference. First operand has 200 places, 213 transitions, 433 flow. Second operand 6 states and 1120 transitions. [2024-11-08 19:23:51,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 224 transitions, 561 flow [2024-11-08 19:23:51,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 224 transitions, 561 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:23:52,005 INFO L231 Difference]: Finished difference. Result has 202 places, 200 transitions, 417 flow [2024-11-08 19:23:52,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=202, PETRI_TRANSITIONS=200} [2024-11-08 19:23:52,012 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, 2 predicate places. [2024-11-08 19:23:52,012 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 200 transitions, 417 flow [2024-11-08 19:23:52,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 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:23:52,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:52,014 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] [2024-11-08 19:23:52,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:23:52,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 19:23:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1942045854, now seen corresponding path program 1 times [2024-11-08 19:23:52,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179026476] [2024-11-08 19:23:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:52,136 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:23:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179026476] [2024-11-08 19:23:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179026476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:23:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677200885] [2024-11-08 19:23:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:52,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:52,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:52,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:52,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 213 [2024-11-08 19:23:52,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 200 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:23:52,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:52,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 213 [2024-11-08 19:23:52,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:52,374 INFO L124 PetriNetUnfolderBase]: 72/667 cut-off events. [2024-11-08 19:23:52,375 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-08 19:23:52,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 667 events. 72/667 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3065 event pairs, 0 based on Foata normal form. 2/602 useless extension candidates. Maximal degree in co-relation 680. Up to 103 conditions per place. [2024-11-08 19:23:52,381 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 23 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-11-08 19:23:52,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 206 transitions, 479 flow [2024-11-08 19:23:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:23:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:23:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-11-08 19:23:52,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9014084507042254 [2024-11-08 19:23:52,386 INFO L175 Difference]: Start difference. First operand has 202 places, 200 transitions, 417 flow. Second operand 3 states and 576 transitions. [2024-11-08 19:23:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 206 transitions, 479 flow [2024-11-08 19:23:52,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 206 transitions, 469 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 19:23:52,395 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 417 flow [2024-11-08 19:23:52,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2024-11-08 19:23:52,396 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, 0 predicate places. [2024-11-08 19:23:52,397 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 417 flow [2024-11-08 19:23:52,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:23:52,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:52,398 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] [2024-11-08 19:23:52,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:23:52,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 19:23:52,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2015420780, now seen corresponding path program 1 times [2024-11-08 19:23:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:52,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571862198] [2024-11-08 19:23:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:52,496 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:23:52,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571862198] [2024-11-08 19:23:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571862198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:23:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597600698] [2024-11-08 19:23:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:52,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:52,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:52,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 213 [2024-11-08 19:23:52,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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:23:52,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:52,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 213 [2024-11-08 19:23:52,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:52,779 INFO L124 PetriNetUnfolderBase]: 148/964 cut-off events. [2024-11-08 19:23:52,779 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-08 19:23:52,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 964 events. 148/964 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5471 event pairs, 33 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1117. Up to 130 conditions per place. [2024-11-08 19:23:52,788 INFO L140 encePairwiseOnDemand]: 204/213 looper letters, 30 selfloop transitions, 6 changer transitions 0/213 dead transitions. [2024-11-08 19:23:52,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 213 transitions, 518 flow [2024-11-08 19:23:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:23:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:23:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2024-11-08 19:23:52,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9014084507042254 [2024-11-08 19:23:52,792 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 417 flow. Second operand 3 states and 576 transitions. [2024-11-08 19:23:52,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 213 transitions, 518 flow [2024-11-08 19:23:52,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 213 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:23:52,802 INFO L231 Difference]: Finished difference. Result has 200 places, 202 transitions, 451 flow [2024-11-08 19:23:52,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=200, PETRI_TRANSITIONS=202} [2024-11-08 19:23:52,804 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, 0 predicate places. [2024-11-08 19:23:52,804 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 202 transitions, 451 flow [2024-11-08 19:23:52,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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:23:52,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:52,806 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] [2024-11-08 19:23:52,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:23:52,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 19:23:52,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -628316361, now seen corresponding path program 1 times [2024-11-08 19:23:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155257636] [2024-11-08 19:23:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:52,928 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:23:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155257636] [2024-11-08 19:23:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155257636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:23:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245662104] [2024-11-08 19:23:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:52,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:52,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 213 [2024-11-08 19:23:52,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 202 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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:23:52,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:52,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 213 [2024-11-08 19:23:52,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:53,198 INFO L124 PetriNetUnfolderBase]: 157/1054 cut-off events. [2024-11-08 19:23:53,199 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-08 19:23:53,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1054 events. 157/1054 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6411 event pairs, 51 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1301. Up to 220 conditions per place. [2024-11-08 19:23:53,207 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 27 selfloop transitions, 4 changer transitions 0/209 dead transitions. [2024-11-08 19:23:53,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 209 transitions, 531 flow [2024-11-08 19:23:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:23:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:23:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2024-11-08 19:23:53,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8951486697965572 [2024-11-08 19:23:53,211 INFO L175 Difference]: Start difference. First operand has 200 places, 202 transitions, 451 flow. Second operand 3 states and 572 transitions. [2024-11-08 19:23:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 209 transitions, 531 flow [2024-11-08 19:23:53,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 209 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:23:53,219 INFO L231 Difference]: Finished difference. Result has 202 places, 205 transitions, 471 flow [2024-11-08 19:23:53,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=202, PETRI_TRANSITIONS=205} [2024-11-08 19:23:53,221 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, 2 predicate places. [2024-11-08 19:23:53,221 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 205 transitions, 471 flow [2024-11-08 19:23:53,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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:23:53,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:53,223 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:23:53,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 19:23:53,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash -315045137, now seen corresponding path program 1 times [2024-11-08 19:23:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350141758] [2024-11-08 19:23:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:23:53,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:23:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:23:53,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:23:53,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:23:53,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-08 19:23:53,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-08 19:23:53,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-08 19:23:53,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-08 19:23:53,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-08 19:23:53,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-08 19:23:53,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-08 19:23:53,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-08 19:23:53,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-08 19:23:53,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-08 19:23:53,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-08 19:23:53,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-08 19:23:53,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:23:53,385 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 19:23:53,391 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 19:23:53,391 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-08 19:23:53,439 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-08 19:23:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 262 transitions, 540 flow [2024-11-08 19:23:53,537 INFO L124 PetriNetUnfolderBase]: 43/433 cut-off events. [2024-11-08 19:23:53,537 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-08 19:23:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 433 events. 43/433 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1286 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 286. Up to 9 conditions per place. [2024-11-08 19:23:53,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 262 transitions, 540 flow [2024-11-08 19:23:53,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 262 transitions, 540 flow [2024-11-08 19:23:53,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:23:53,548 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;@7904de67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:23:53,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-08 19:23:53,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:23:53,562 INFO L124 PetriNetUnfolderBase]: 4/117 cut-off events. [2024-11-08 19:23:53,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:23:53,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:53,563 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] [2024-11-08 19:23:53,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:23:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2044633724, now seen corresponding path program 1 times [2024-11-08 19:23:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:53,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608960186] [2024-11-08 19:23:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,167 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:23:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608960186] [2024-11-08 19:23:54,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608960186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:54,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:54,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:23:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041090275] [2024-11-08 19:23:54,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:23:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:23:54,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:23:54,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 262 [2024-11-08 19:23:54,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 262 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 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:23:54,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:54,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 262 [2024-11-08 19:23:54,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:56,540 INFO L124 PetriNetUnfolderBase]: 1948/8347 cut-off events. [2024-11-08 19:23:56,540 INFO L125 PetriNetUnfolderBase]: For 83/85 co-relation queries the response was YES. [2024-11-08 19:23:56,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11315 conditions, 8347 events. 1948/8347 cut-off events. For 83/85 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 85883 event pairs, 708 based on Foata normal form. 1227/8622 useless extension candidates. Maximal degree in co-relation 3324. Up to 2093 conditions per place. [2024-11-08 19:23:56,604 INFO L140 encePairwiseOnDemand]: 240/262 looper letters, 80 selfloop transitions, 5 changer transitions 0/291 dead transitions. [2024-11-08 19:23:56,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 291 transitions, 768 flow [2024-11-08 19:23:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:23:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:23:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2024-11-08 19:23:56,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8854961832061069 [2024-11-08 19:23:56,609 INFO L175 Difference]: Start difference. First operand has 244 places, 262 transitions, 540 flow. Second operand 6 states and 1392 transitions. [2024-11-08 19:23:56,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 291 transitions, 768 flow [2024-11-08 19:23:56,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:23:56,617 INFO L231 Difference]: Finished difference. Result has 246 places, 243 transitions, 512 flow [2024-11-08 19:23:56,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=512, PETRI_PLACES=246, PETRI_TRANSITIONS=243} [2024-11-08 19:23:56,618 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, 2 predicate places. [2024-11-08 19:23:56,618 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 243 transitions, 512 flow [2024-11-08 19:23:56,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 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:23:56,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:56,620 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] [2024-11-08 19:23:56,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:23:56,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:23:56,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash -141358754, now seen corresponding path program 1 times [2024-11-08 19:23:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819278016] [2024-11-08 19:23:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,746 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:23:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819278016] [2024-11-08 19:23:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819278016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:56,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:56,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:23:56,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460198546] [2024-11-08 19:23:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:56,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:56,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:56,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:56,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 262 [2024-11-08 19:23:56,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 243 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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:23:56,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:56,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 262 [2024-11-08 19:23:56,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:58,067 INFO L124 PetriNetUnfolderBase]: 1045/4891 cut-off events. [2024-11-08 19:23:58,067 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-11-08 19:23:58,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6551 conditions, 4891 events. 1045/4891 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 45765 event pairs, 695 based on Foata normal form. 2/4351 useless extension candidates. Maximal degree in co-relation 4775. Up to 1518 conditions per place. [2024-11-08 19:23:58,121 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 32 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-11-08 19:23:58,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 250 transitions, 596 flow [2024-11-08 19:23:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:23:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:23:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-11-08 19:23:58,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778625954198473 [2024-11-08 19:23:58,128 INFO L175 Difference]: Start difference. First operand has 246 places, 243 transitions, 512 flow. Second operand 3 states and 690 transitions. [2024-11-08 19:23:58,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 250 transitions, 596 flow [2024-11-08 19:23:58,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 250 transitions, 584 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 19:23:58,134 INFO L231 Difference]: Finished difference. Result has 244 places, 244 transitions, 516 flow [2024-11-08 19:23:58,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=244, PETRI_TRANSITIONS=244} [2024-11-08 19:23:58,136 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, 0 predicate places. [2024-11-08 19:23:58,136 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 244 transitions, 516 flow [2024-11-08 19:23:58,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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:23:58,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:58,137 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] [2024-11-08 19:23:58,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:23:58,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:23:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1113462909, now seen corresponding path program 1 times [2024-11-08 19:23:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864179776] [2024-11-08 19:23:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:58,290 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:23:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864179776] [2024-11-08 19:23:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864179776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:58,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:23:58,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231372907] [2024-11-08 19:23:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:58,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:58,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:58,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 262 [2024-11-08 19:23:58,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 244 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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:23:58,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:58,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 262 [2024-11-08 19:23:58,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:01,504 INFO L124 PetriNetUnfolderBase]: 4873/15832 cut-off events. [2024-11-08 19:24:01,504 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-08 19:24:01,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23141 conditions, 15832 events. 4873/15832 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 175632 event pairs, 1605 based on Foata normal form. 0/13892 useless extension candidates. Maximal degree in co-relation 23029. Up to 3665 conditions per place. [2024-11-08 19:24:01,669 INFO L140 encePairwiseOnDemand]: 243/262 looper letters, 58 selfloop transitions, 14 changer transitions 0/277 dead transitions. [2024-11-08 19:24:01,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 277 transitions, 737 flow [2024-11-08 19:24:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:24:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2024-11-08 19:24:01,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8842239185750637 [2024-11-08 19:24:01,673 INFO L175 Difference]: Start difference. First operand has 244 places, 244 transitions, 516 flow. Second operand 3 states and 695 transitions. [2024-11-08 19:24:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 277 transitions, 737 flow [2024-11-08 19:24:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 277 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 19:24:01,685 INFO L231 Difference]: Finished difference. Result has 247 places, 258 transitions, 636 flow [2024-11-08 19:24:01,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=247, PETRI_TRANSITIONS=258} [2024-11-08 19:24:01,687 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, 3 predicate places. [2024-11-08 19:24:01,691 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 636 flow [2024-11-08 19:24:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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:24:01,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:01,692 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] [2024-11-08 19:24:01,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:24:01,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:24:01,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash -570148050, now seen corresponding path program 1 times [2024-11-08 19:24:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737462650] [2024-11-08 19:24:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,767 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:24:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737462650] [2024-11-08 19:24:01,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737462650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359996679] [2024-11-08 19:24:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:01,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:01,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 262 [2024-11-08 19:24:01,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 258 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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:24:01,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:01,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 262 [2024-11-08 19:24:01,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:05,180 INFO L124 PetriNetUnfolderBase]: 5044/18373 cut-off events. [2024-11-08 19:24:05,181 INFO L125 PetriNetUnfolderBase]: For 4431/4592 co-relation queries the response was YES. [2024-11-08 19:24:05,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29835 conditions, 18373 events. 5044/18373 cut-off events. For 4431/4592 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 217953 event pairs, 2430 based on Foata normal form. 47/16417 useless extension candidates. Maximal degree in co-relation 28287. Up to 6126 conditions per place. [2024-11-08 19:24:05,347 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 52 selfloop transitions, 14 changer transitions 0/282 dead transitions. [2024-11-08 19:24:05,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 282 transitions, 854 flow [2024-11-08 19:24:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:24:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2024-11-08 19:24:05,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8765903307888041 [2024-11-08 19:24:05,351 INFO L175 Difference]: Start difference. First operand has 247 places, 258 transitions, 636 flow. Second operand 3 states and 689 transitions. [2024-11-08 19:24:05,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 282 transitions, 854 flow [2024-11-08 19:24:05,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 282 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:24:05,368 INFO L231 Difference]: Finished difference. Result has 249 places, 270 transitions, 734 flow [2024-11-08 19:24:05,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=249, PETRI_TRANSITIONS=270} [2024-11-08 19:24:05,371 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, 5 predicate places. [2024-11-08 19:24:05,372 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 270 transitions, 734 flow [2024-11-08 19:24:05,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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:24:05,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:05,373 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] [2024-11-08 19:24:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:24:05,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:24:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 617723684, now seen corresponding path program 1 times [2024-11-08 19:24:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:05,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205799443] [2024-11-08 19:24:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:05,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:05,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205799443] [2024-11-08 19:24:05,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205799443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:05,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290371344] [2024-11-08 19:24:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:05,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:05,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:05,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:05,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:24:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:05,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:24:05,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:05,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290371344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:05,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 19:24:05,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313083159] [2024-11-08 19:24:05,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:24:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:24:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:24:06,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 262 [2024-11-08 19:24:06,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 270 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 216.4) internal successors, (2164), 10 states have internal predecessors, (2164), 0 states have call successors, (0), 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:24:06,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:06,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 262 [2024-11-08 19:24:06,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:06,912 INFO L124 PetriNetUnfolderBase]: 813/3187 cut-off events. [2024-11-08 19:24:06,912 INFO L125 PetriNetUnfolderBase]: For 270/287 co-relation queries the response was YES. [2024-11-08 19:24:06,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 3187 events. 813/3187 cut-off events. For 270/287 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 27311 event pairs, 63 based on Foata normal form. 210/3237 useless extension candidates. Maximal degree in co-relation 3335. Up to 687 conditions per place. [2024-11-08 19:24:06,941 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 75 selfloop transitions, 7 changer transitions 0/266 dead transitions. [2024-11-08 19:24:06,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 266 transitions, 842 flow [2024-11-08 19:24:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:24:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 19:24:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2012 transitions. [2024-11-08 19:24:06,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8532654792196777 [2024-11-08 19:24:06,947 INFO L175 Difference]: Start difference. First operand has 249 places, 270 transitions, 734 flow. Second operand 9 states and 2012 transitions. [2024-11-08 19:24:06,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 266 transitions, 842 flow [2024-11-08 19:24:06,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 266 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:24:06,956 INFO L231 Difference]: Finished difference. Result has 204 places, 208 transitions, 556 flow [2024-11-08 19:24:06,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=556, PETRI_PLACES=204, PETRI_TRANSITIONS=208} [2024-11-08 19:24:06,957 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -40 predicate places. [2024-11-08 19:24:06,957 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 208 transitions, 556 flow [2024-11-08 19:24:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 216.4) internal successors, (2164), 10 states have internal predecessors, (2164), 0 states have call successors, (0), 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:24:06,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:06,960 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] [2024-11-08 19:24:06,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:24:07,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60b121-60ac-4476-b49d-07d28932be5b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:07,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:24:07,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1140777220, now seen corresponding path program 1 times [2024-11-08 19:24:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19413363] [2024-11-08 19:24:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:07,255 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:24:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:07,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19413363] [2024-11-08 19:24:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19413363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:07,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482469077] [2024-11-08 19:24:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:07,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:07,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 262 [2024-11-08 19:24:07,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 208 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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:24:07,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:07,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 262 [2024-11-08 19:24:07,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:07,596 INFO L124 PetriNetUnfolderBase]: 256/1297 cut-off events. [2024-11-08 19:24:07,597 INFO L125 PetriNetUnfolderBase]: For 545/576 co-relation queries the response was YES. [2024-11-08 19:24:07,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1297 events. 256/1297 cut-off events. For 545/576 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8310 event pairs, 135 based on Foata normal form. 9/1226 useless extension candidates. Maximal degree in co-relation 2228. Up to 457 conditions per place. [2024-11-08 19:24:07,610 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 45 selfloop transitions, 10 changer transitions 0/223 dead transitions. [2024-11-08 19:24:07,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 223 transitions, 725 flow [2024-11-08 19:24:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:24:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2024-11-08 19:24:07,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8600508905852418 [2024-11-08 19:24:07,613 INFO L175 Difference]: Start difference. First operand has 204 places, 208 transitions, 556 flow. Second operand 3 states and 676 transitions. [2024-11-08 19:24:07,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 223 transitions, 725 flow [2024-11-08 19:24:07,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 223 transitions, 710 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-08 19:24:07,622 INFO L231 Difference]: Finished difference. Result has 203 places, 216 transitions, 639 flow [2024-11-08 19:24:07,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=203, PETRI_TRANSITIONS=216} [2024-11-08 19:24:07,623 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -41 predicate places. [2024-11-08 19:24:07,623 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 216 transitions, 639 flow [2024-11-08 19:24:07,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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:24:07,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:07,628 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:24:07,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:24:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -157698209, now seen corresponding path program 1 times [2024-11-08 19:24:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915144138] [2024-11-08 19:24:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:24:07,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:07,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915144138] [2024-11-08 19:24:07,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915144138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:07,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:07,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:07,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889041329] [2024-11-08 19:24:07,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:07,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:07,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:07,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:07,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:07,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 262 [2024-11-08 19:24:07,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 216 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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:24:07,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:07,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 262 [2024-11-08 19:24:07,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:08,153 INFO L124 PetriNetUnfolderBase]: 292/1465 cut-off events. [2024-11-08 19:24:08,154 INFO L125 PetriNetUnfolderBase]: For 1016/1040 co-relation queries the response was YES. [2024-11-08 19:24:08,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 1465 events. 292/1465 cut-off events. For 1016/1040 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9572 event pairs, 139 based on Foata normal form. 6/1382 useless extension candidates. Maximal degree in co-relation 2736. Up to 498 conditions per place. [2024-11-08 19:24:08,170 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 46 selfloop transitions, 14 changer transitions 0/230 dead transitions. [2024-11-08 19:24:08,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 230 transitions, 811 flow [2024-11-08 19:24:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:24:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-11-08 19:24:08,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8587786259541985 [2024-11-08 19:24:08,175 INFO L175 Difference]: Start difference. First operand has 203 places, 216 transitions, 639 flow. Second operand 3 states and 675 transitions. [2024-11-08 19:24:08,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 230 transitions, 811 flow [2024-11-08 19:24:08,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 230 transitions, 775 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-08 19:24:08,185 INFO L231 Difference]: Finished difference. Result has 205 places, 224 transitions, 717 flow [2024-11-08 19:24:08,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=205, PETRI_TRANSITIONS=224} [2024-11-08 19:24:08,187 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -39 predicate places. [2024-11-08 19:24:08,187 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 224 transitions, 717 flow [2024-11-08 19:24:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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:24:08,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:08,188 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 19:24:08,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:24:08,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 19:24:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1945025321, now seen corresponding path program 1 times [2024-11-08 19:24:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935438648] [2024-11-08 19:24:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:24:08,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:24:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:24:08,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:24:08,312 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:24:08,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-08 19:24:08,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-08 19:24:08,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-08 19:24:08,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-08 19:24:08,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-08 19:24:08,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-08 19:24:08,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-08 19:24:08,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-08 19:24:08,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-08 19:24:08,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-08 19:24:08,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-08 19:24:08,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-08 19:24:08,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-08 19:24:08,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-08 19:24:08,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-08 19:24:08,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-08 19:24:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:24:08,320 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:08,321 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 19:24:08,321 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-08 19:24:08,374 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 19:24:08,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 311 transitions, 649 flow [2024-11-08 19:24:08,542 INFO L124 PetriNetUnfolderBase]: 66/629 cut-off events. [2024-11-08 19:24:08,543 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-08 19:24:08,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 629 events. 66/629 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2154 event pairs, 1 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 441. Up to 16 conditions per place. [2024-11-08 19:24:08,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 311 transitions, 649 flow [2024-11-08 19:24:08,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 311 transitions, 649 flow [2024-11-08 19:24:08,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:24:08,560 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;@7904de67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:24:08,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-08 19:24:08,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:24:08,575 INFO L124 PetriNetUnfolderBase]: 4/117 cut-off events. [2024-11-08 19:24:08,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:24:08,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:08,576 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] [2024-11-08 19:24:08,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-08 19:24:08,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash -105948749, now seen corresponding path program 1 times [2024-11-08 19:24:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107689290] [2024-11-08 19:24:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:09,285 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:24:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107689290] [2024-11-08 19:24:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107689290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:24:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487601161] [2024-11-08 19:24:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:24:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:24:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:24:09,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 311 [2024-11-08 19:24:09,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 311 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 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:24:09,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:09,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 311 [2024-11-08 19:24:09,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:23,835 INFO L124 PetriNetUnfolderBase]: 20864/70002 cut-off events. [2024-11-08 19:24:23,835 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-08 19:24:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98609 conditions, 70002 events. 20864/70002 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 959164 event pairs, 6970 based on Foata normal form. 13397/76081 useless extension candidates. Maximal degree in co-relation 11547. Up to 20303 conditions per place. [2024-11-08 19:24:24,440 INFO L140 encePairwiseOnDemand]: 283/311 looper letters, 112 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2024-11-08 19:24:24,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 358 transitions, 977 flow [2024-11-08 19:24:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:24:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:24:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1664 transitions. [2024-11-08 19:24:24,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8917470525187567 [2024-11-08 19:24:24,449 INFO L175 Difference]: Start difference. First operand has 288 places, 311 transitions, 649 flow. Second operand 6 states and 1664 transitions. [2024-11-08 19:24:24,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 358 transitions, 977 flow [2024-11-08 19:24:24,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 358 transitions, 977 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:24:24,458 INFO L231 Difference]: Finished difference. Result has 290 places, 286 transitions, 609 flow [2024-11-08 19:24:24,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=609, PETRI_PLACES=290, PETRI_TRANSITIONS=286} [2024-11-08 19:24:24,459 INFO L277 CegarLoopForPetriNet]: 288 programPoint places, 2 predicate places. [2024-11-08 19:24:24,460 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 286 transitions, 609 flow [2024-11-08 19:24:24,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 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:24:24,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:24,462 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] [2024-11-08 19:24:24,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:24:24,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-08 19:24:24,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1910061630, now seen corresponding path program 1 times [2024-11-08 19:24:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:24,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217872916] [2024-11-08 19:24:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:24,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:24:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217872916] [2024-11-08 19:24:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217872916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:24:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236340967] [2024-11-08 19:24:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:24,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 311 [2024-11-08 19:24:24,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 286 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 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:24:24,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:24,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 311 [2024-11-08 19:24:24,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:30,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L-1-5-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][183], [111#L939-3true, 297#true, 288#true, 291#true, 224#ULTIMATE.startFINALtrue, 7#L939-3true, 285#true, 287#true]) [2024-11-08 19:24:30,023 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-11-08 19:24:30,023 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-08 19:24:30,023 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-08 19:24:30,023 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-08 19:24:30,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L-1-5-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][183], [111#L939-3true, 297#true, 288#true, 291#true, 224#ULTIMATE.startFINALtrue, 58#L939-16true, 285#true, 287#true]) [2024-11-08 19:24:30,603 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2024-11-08 19:24:30,604 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-08 19:24:30,604 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-08 19:24:30,604 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-08 19:24:30,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L-1-5-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][183], [111#L939-3true, 297#true, 288#true, 291#true, 224#ULTIMATE.startFINALtrue, 43#L939-22true, 285#true, 287#true]) [2024-11-08 19:24:30,713 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-11-08 19:24:30,713 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-08 19:24:30,713 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-08 19:24:30,713 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-08 19:24:31,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L-1-5-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][183], [60#L939-35true, 111#L939-3true, 297#true, 288#true, 291#true, 224#ULTIMATE.startFINALtrue, 285#true, 287#true]) [2024-11-08 19:24:31,141 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2024-11-08 19:24:31,141 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-11-08 19:24:31,141 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2024-11-08 19:24:31,141 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-11-08 19:24:31,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L-1-5-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][183], [111#L939-3true, 297#true, 288#true, 291#true, 193#L940-2true, 224#ULTIMATE.startFINALtrue, 285#true, 287#true]) [2024-11-08 19:24:31,195 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-11-08 19:24:31,195 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-08 19:24:31,195 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-08 19:24:31,195 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-08 19:24:31,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1248] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][279], [111#L939-3true, 112#L952-10true, 297#true, 288#true, 291#true, 286#true, 285#true]) [2024-11-08 19:24:31,215 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-11-08 19:24:31,215 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-08 19:24:31,215 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-08 19:24:31,215 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-08 19:24:31,306 INFO L124 PetriNetUnfolderBase]: 11329/38743 cut-off events. [2024-11-08 19:24:31,306 INFO L125 PetriNetUnfolderBase]: For 2263/2263 co-relation queries the response was YES. [2024-11-08 19:24:31,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54873 conditions, 38743 events. 11329/38743 cut-off events. For 2263/2263 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 491499 event pairs, 8266 based on Foata normal form. 2/34805 useless extension candidates. Maximal degree in co-relation 40086. Up to 14957 conditions per place. [2024-11-08 19:24:31,710 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 40 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-08 19:24:31,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 293 transitions, 709 flow [2024-11-08 19:24:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:24:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-08 19:24:31,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8606645230439443 [2024-11-08 19:24:31,713 INFO L175 Difference]: Start difference. First operand has 290 places, 286 transitions, 609 flow. Second operand 3 states and 803 transitions. [2024-11-08 19:24:31,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 293 transitions, 709 flow [2024-11-08 19:24:31,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 293 transitions, 697 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 19:24:31,722 INFO L231 Difference]: Finished difference. Result has 288 places, 287 transitions, 613 flow [2024-11-08 19:24:31,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=288, PETRI_TRANSITIONS=287} [2024-11-08 19:24:31,724 INFO L277 CegarLoopForPetriNet]: 288 programPoint places, 0 predicate places. [2024-11-08 19:24:31,724 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 287 transitions, 613 flow [2024-11-08 19:24:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 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:24:31,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:31,725 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] [2024-11-08 19:24:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:24:31,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-08 19:24:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash 751137810, now seen corresponding path program 1 times [2024-11-08 19:24:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:31,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534310716] [2024-11-08 19:24:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:31,788 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:24:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:31,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534310716] [2024-11-08 19:24:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534310716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470819447] [2024-11-08 19:24:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:31,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 311 [2024-11-08 19:24:31,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 287 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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:24:31,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:31,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 311 [2024-11-08 19:24:31,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:34,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][252], [112#L952-10true, 297#true, 288#true, 301#true, 286#true, 284#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-08 19:24:34,308 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2024-11-08 19:24:34,308 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-08 19:24:34,308 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-08 19:24:34,308 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2024-11-08 19:24:41,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][252], [112#L952-10true, 297#true, 288#true, 301#true, 134#$Ultimate##0true, 284#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0), 287#true]) [2024-11-08 19:24:41,196 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2024-11-08 19:24:41,196 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-08 19:24:41,196 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is not cut-off event [2024-11-08 19:24:41,196 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is not cut-off event [2024-11-08 19:24:41,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][252], [112#L952-10true, 297#true, 288#true, 172#L938-3true, 301#true, 284#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0), 287#true]) [2024-11-08 19:24:41,197 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-08 19:24:41,197 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2024-11-08 19:24:41,197 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-08 19:24:41,197 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-08 19:24:41,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1248] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][304], [112#L952-10true, 297#true, 288#true, 79#$Ultimate##0true, 301#true, 286#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0), 285#true]) [2024-11-08 19:24:41,207 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2024-11-08 19:24:41,207 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is not cut-off event [2024-11-08 19:24:41,207 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-08 19:24:41,207 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is not cut-off event [2024-11-08 19:24:41,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1248] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][304], [112#L952-10true, 297#true, 288#true, 83#L938-3true, 301#true, 286#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0), 285#true]) [2024-11-08 19:24:41,208 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-08 19:24:41,208 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-08 19:24:41,208 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2024-11-08 19:24:41,208 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-08 19:24:43,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][252], [112#L952-10true, 297#true, 288#true, 301#true, 7#L939-3true, 284#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0), 287#true]) [2024-11-08 19:24:43,548 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-08 19:24:43,548 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-08 19:24:43,549 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-08 19:24:43,549 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-08 19:24:43,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1248] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][304], [111#L939-3true, 112#L952-10true, 297#true, 288#true, 301#true, 286#true, Black: 299#(= |ULTIMATE.start_main_~i~1#1| 0), 285#true]) [2024-11-08 19:24:43,551 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-08 19:24:43,551 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-08 19:24:43,551 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-08 19:24:43,551 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event